levenshteinversion
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.
| Author | Jun Furuse |
|---|---|
| Published | |
| Homepage | https://bitbucket.org/camlspotter/ocaml_levenshtein/ |
| Issue Tracker | https://bitbucket.org/camlspotter/ocaml_levenshtein/issues?status=new&status=open |
| Maintainer | jun.furuse@gmail.com |
| Dependencies | |
| Source [http] | https://github.com/ocaml/opam-source-archives/raw/main/levenshtein-1.0.0.tar.gz sha256=04b69c752562553c9f1ca47c17847b45faf7e26a96f855debea039e96a16459b md5=513c55272e1f1809aae4f922705abe70 |
| Edit | https://github.com/ocaml/opam-repository/tree/master/packages/levenshtein/levenshtein.1.0.0/opam |
No package is dependent
