package levenshtein

  1. Overview
  2. No Docs
Levenshtein distance algorithm for general array.

Install

Dune Dependency

Authors

Maintainers

Sources

levenshtein-1.0.0.tar.gz
sha256=04b69c752562553c9f1ca47c17847b45faf7e26a96f855debea039e96a16459b
md5=513c55272e1f1809aae4f922705abe70

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.

Published: 31 Aug 2014

Dependencies (4)

  1. pa_ounit >= "109.53.02"
  2. omake build & < "0.10.1"
  3. ocamlfind build
  4. ocaml >= "4.01.0"

Dev Dependencies

None

Used by

None

Conflicts

None

OCaml

Innovation. Community. Security.