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!;
- Compute a distance in words between two strings:
assert_eq!;
- Or even compute a distance between two sequences of anything:
assert_eq!;
Fast
At the time of writing, this crate is the fastest on crates.io when
working with text (on par with eddie
):
Identical | Same length | Different lengths | |
---|---|---|---|
generic_levenshtein | 3 | 9_616 | 11_010 |
levenshtein v1.0.4 | 4 | 11_030 | 12_777 |
strsim v0.9.2 | 9_173 | 10_100 | 11_738 |
distance v0.4.0 | 23_594 | 13_800 | 26_890 |
eddie v0.3.2 | 215 | 7_464 | 11_968 |
txtdist v0.2.1 | 17_732 | 17_635 | 20_975 |
All times in ns
on an Intel(R) Core(TM) i5-4300M CPU @ 2.60GHz
.