levenshtein 1.0.0
| Maintainer | jun.furuse@gmail.com | |||||||||||||||||
|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Dependencies |
|
|||||||||||||||||
| OCaml | >= 4.01.0 | |||||||||||||||||
| Published | Aug 28, 2014 | |||||||||||||||||
| Source [http] |
https://bitbucket.org/camlspotter/ocaml_levenshtein/get/1.0.0.tar.gz 513c55272e1f1809aae4f922705abe70 |
|||||||||||||||||
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/levenshtein/levenshtein.1.0.0/opam | |||||||||||||||||
Levenshtein distance algorithm for general array.
Levenshtein distance algorithm for general array.
It provides:
- Levenshtein alrogithm by Wagner-Fischer algorithm: http://en.wikipedia.org/wiki/Wagner%E2%80%93Fischer_algorithm
- Correctness is tested comparing against a naive but more mathematical algorithm.
- Upperbound parameter to stop the comparision once the distance is found bigger than it.
- Memoisation cache to avoid repeating distance calculations.
- Functor to abstact the implementation of the array and cache.
- Ready-to-use String and StringWithHashtbl modules are provided.
| No package is dependent |