The edit-distance package
Optimized edit distances for fuzzy matching, including Levenshtein and restricted Damerau-Levenshtein algorithms.
[Skip to Readme]
Properties
| Versions | 0.1, 0.1.1, 0.1.2, 0.2.0, 0.2.1, 0.2.1.1, 0.2.1.2, 0.2.1.3, 0.2.2.1 |
|---|---|
| Dependencies | array (>=0.1), base (>=4.5 && <5), containers (>=0.1.0.1), random (>=1.0) [details] |
| License | BSD3 |
| Copyright | (c) 2008-2013 Maximilian Bolinbroke |
| Author | Max Bolingbroke <batterseapower@hotmail.com> |
| Maintainer | Oleg Grenrus <oleg.grenrus@iki.fi> |
| Category | Algorithms |
| Home page | http://github.com/phadej/edit-distance |
| Source repository | head: git clone https://github.com/phadej/edit-distance.git |
| Uploaded | Sun Jul 12 17:57:09 UTC 2015 by phadej |
| Updated | Wed Aug 10 15:33:44 UTC 2016 by phadej to revision 1 |
| Distributions | Arch:0.2.2.1, Debian:0.2.2.1, Fedora:0.2.2.1, FreeBSD:0.2.2.1, LTSHaskell:0.2.2.1, NixOS:0.2.2.1, Stackage:0.2.2.1, Tumbleweed:0.2.2.1 |
| Downloads | 13073 total (1148 in the last 30 days) |
| Votes | |
| Status | Docs available [build log] Last success reported on 2015-07-12 [all 1 reports] Hackage Matrix CI |
Downloads
- edit-distance-0.2.2.1.tar.gz [browse] (Cabal source package)
- Package description (included in the package)
Readme for edit-distance
Readme for edit-distance-0.2.2.1
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