Levenshtein and restricted Damerau-Levenshtein edit distances http://github.com/phadej/edit-distance

Version on this page:
LTS Haskell 13.21:
Stackage Nightly 2019-05-18:
Latest on Hackage:

See all snapshots edit-distance appears in

BSD-3-Clause licensed by Max Bolingbroke
Maintained by Oleg Grenrus

Module documentation for

There are no documented modules for this package.

Edit Distance Algorithms

Build Status Hackage


To just install the library:

cabal configure
cabal build
cabal install


Edit distances algorithms for fuzzy matching. Specifically, this library provides:

They have been fairly heavily optimized. Indeed, for situations where one of the strings is under 64 characters long we use a rather neat “bit vector” algorithm: see the authors paper and the associated errata for more information. The algorithms could be faster, but they aren’t yet slow enough to force us into improving the situation.


Text.EditDistance> levenshteinDistance defaultEditCosts "witch" "kitsch"


comments powered byDisqus