Crate editdistancek

Edit Distance

A library for fast finding the Levenshtein edit distance between s and t.

Functions

edit_distance

Returns edit distance between s and t.

edit_distance_bounded

If edit distance d between s and t is at most k, then returns Some(d) otherwise returns None.

mismatch

Returns the length of longest common prefix s and t (uses SIMD if it is possible).