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

Latest on Hackage:[email protected]:1

See all snapshots edit-distance appears in

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

Module documentation for

This version can be pinned in stack with:[email protected]:4d33a49cd383d50af090f1b888642d10116e43809f9da6023d9fc6f67d2656ee,2351

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"


Used by 3 packages in lts-12.26(full list with versions):