package levenshtein

  1. Overview
  2. Docs

Simple implementation without cache

type t
val distance : ?upper_bound:int -> t -> t -> int

Calculate Levenshtein distance between two t's.

If we are only interested in the distance if it is smaller than some threshold, specifying upper_bound greatly improves the performance. In that case, the return value is always is culled to upper_bound.

OCaml

Innovation. Community. Security.