4 stable releases
Uses old Rust 2015
|2.1.0||Mar 2, 2019|
|2.0.1||Jan 2, 2018|
|2.0.0||Jul 2, 2017|
|1.0.0||May 1, 2015|
#139 in Algorithms
20,384 downloads per month
Used in 81 crates (17 directly)
Calculate Levenshtein distance between two strings.
The Levenshtein edit distance is a measure for the similarity between two strings. It's helpful for spelling correction, fuzzy completion, type-ahead and similar use cases.
This implementation supports Unicode.
In Cargo.toml add
[dependencies] edit-distance = "2.1.0"
cargo build. That fetches the dependencies and builds
extern crate edit_distance; edit_distance("kitten", "sitting"); // => 3
- Fork it!
- Create your feature branch:
git checkout -b my-new-feature
- Test your changes:
- Commit your changes:
git commit -am 'Add some feature'
- Push to the branch:
git push origin my-new-feature
- Submit a pull request :D
2019-03-02 2.1.0 Optimize memory usage
2018-01-02 2.0.1 Update dev-dependencies
2015-05-01 1.0.0 Release
2015-04-18 0.0.1 Initial upload
Thanks to @skade for very helpful criticism of my first rust lib.
APL 2.0, see LICENSE file.