edit-distance

Levenshtein and restricted Damerau-Levenshtein edit distances

LTS Haskell 22.39:	0.2.2.1@rev:1
Stackage Nightly 2024-10-31:	0.2.2.1@rev:1
Latest on Hackage:	0.2.2.1@rev:1

See all snapshots edit-distance appears in

BSD-3-Clause licensed by Max Bolingbroke

Maintained by Oleg Grenrus

This version can be pinned in stack with:edit-distance-0.2.2.1@sha256:4d33a49cd383d50af090f1b888642d10116e43809f9da6023d9fc6f67d2656ee,2351

Module documentation for 0.2.2.1

Text
- Text.EditDistance

Depends on 4 packages(full list with versions):

array, base, containers, random

Used by 2 packages in lts-18.8(full list with versions):

Agda, lambdabot-core

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:

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