Fast and well-tested implementations of edit distance/string similarity metrics: - Levenshtein, - Damerau-Levenshtein, - Hamming, - Jaro, - Jaro-Winkler.
See API reference.
Add this to your Cargo.toml:
toml
[dependencies]
eddie = "0.3"
Levenshtein:
rust
use eddie::Levenshtein;
let lev = Levenshtein::new();
let dist = lev.distance("martha", "marhta");
assert_eq!(dist, 2);
Damerau-Levenshtein:
rust
use eddie::DamerauLevenshtein;
let damlev = DamerauLevenshtein::new();
let dist = damlev.distance("martha", "marhta");
assert_eq!(dist, 1);
Hamming:
rust
use eddie::Hamming;
let hamming = Hamming::new();
let dist = hamming.distance("martha", "marhta");
assert_eq!(dist, Some(2));
Jaro:
rust
use eddie::Jaro;
let jaro = Jaro::new();
let sim = jaro.similarity("martha", "marhta");
assert!((sim - 0.94).abs() < 0.01);
Jaro-Winkler:
rust
use eddie::JaroWinkler;
let jarwin = JaroWinkler::new();
let sim = jarwin.similarity("martha", "marhta");
assert!((sim - 0.96).abs() < 0.01);
The main metric methods are complemented with inverted and/or relative versions.
The naming convention across the crate is following:
- distance — a number of edits required to transform one string to the other;
- rel_dist — a distance between two strings, relative to string length (inversion of similarity);
- similarity — similarity between two strings (inversion of relative distance).
At the moment Eddie has the fastest implementations among the alternatives from crates.io that have Unicode support.
For example, when comparing common english words you can expect at least 1.5-2x speedup for any given algorithm except Hamming.
For the detailed measurements tables see Benchmarks page.