README

A generic and fast implementation of the Levenshtein distance.

Generic

This crate can work on slices of any kind. It can therefore:

• Compute a distance in characters between two strings:

assert_eq!(distance ("abc", "aaxcc"), 3);

• Compute a distance in words between two strings:

assert_eq!(
   distance (
      "The quick brown fox".split (' ').collect::<Vec<_>>(),
      "The very quick brown cat".split (' ').collect()),
   2);

• Or even compute a distance between two sequences of anything:

assert_eq!(distance (vec![1, 2, 3], vec![0, 1, 3, 3, 4]), 3);

Fast

At the time of writing, this crate is the fastest on crates.io when working with text (on par with eddie):

All times in ns on an Intel(R) Core(TM) i5-4300M CPU @ 2.60GHz.