Levenshtein and restricted Damerau-Levenshtein edit distances.

Optimized edit distances for fuzzy matching, including Levenshtein and restricted Damerau-Levenshtein algorithms.

Edit Distance Algorithms

Installing

To just install the library:

cabal configure
cabal build
cabal install

Description

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

• Levenshtein distance
• Restricted Damerau-Levenshtein distance

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.

Example

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

Links

• Hackage
• GitHub
• Original gitHub.