levenshtein

Levenshtein distance algorithm for general array.
Description

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.
Install
Published
31 Aug 2014
Authors
Sources
levenshtein-1.0.0.tar.gz
md5=513c55272e1f1809aae4f922705abe70
Dependencies
pa_ounit
>= "109.53.02"
omake
build & < "0.10.1"
ocaml
>= "4.01.0"
Reverse Dependencies