edit-distance: Levenshtein and restricted Damerau-Levenshtein edit distances
Optimized edit distances for fuzzy matching, including Levenshtein and restricted Damerau-Levenshtein algorithms.
| Versions | 0.1, 0.1.1, 0.1.2 |
|---|---|
| Dependencies | array (>=0.1), base (>=3 && <5), containers (>=0.1.0.1), random (>=1.0) or base (<3) |
| License | BSD3 |
| Author | Max Bolingbroke |
| Maintainer | batterseapower@hotmail.com |
| Category | Algorithms |
| Home page | http://github.com/batterseapower/edit-distance |
| Executables | edit-distance-tests, edit-distance-benchmark |
| Upload date | Fri Jul 3 12:47:30 UTC 2009 |
| Uploaded by | MaxBolingbroke |
| Built on | ghc-6.10, ghc-6.12 |
| Distributions | Arch: 0.1.2 |
Modules
Downloads
- edit-distance-0.1.2.tar.gz (Cabal source package)
- package description (included in the package)