#text-processing #search #spelling

edit-distance

Levenshtein edit distance between strings, a measure for similarity

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

#372 in Algorithms

Download history 5454/week @ 2023-10-22 5685/week @ 2023-10-29 6081/week @ 2023-11-05 5254/week @ 2023-11-12 5615/week @ 2023-11-19 6078/week @ 2023-11-26 7912/week @ 2023-12-03 7544/week @ 2023-12-10 5550/week @ 2023-12-17 3706/week @ 2023-12-24 4118/week @ 2023-12-31 5282/week @ 2024-01-07 5841/week @ 2024-01-14 4773/week @ 2024-01-21 4878/week @ 2024-01-28 4845/week @ 2024-02-04

20,867 downloads per month
Used in 81 crates (17 directly)

Apache-2.0

8KB

edit-distance

Build Status

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.

Installation

In Cargo.toml add

[dependencies]
edit-distance = "2.1.0"

Then re-run cargo build. That fetches the dependencies and builds the code.

Usage

extern crate edit_distance;

edit_distance("kitten", "sitting"); // => 3

Contributing

  1. Fork it!
  2. Create your feature branch: git checkout -b my-new-feature
  3. Test your changes: cargo test
  4. Commit your changes: git commit -am 'Add some feature'
  5. Push to the branch: git push origin my-new-feature
  6. Submit a pull request :D

History

2019-03-02 2.1.0 Optimize memory usage
2018-01-02 2.0.1 Update dev-dependencies
2017-07-02 2.0.0
2015-05-01 1.0.0 Release
2015-04-18 0.0.1 Initial upload

Credits

Thanks to @skade for very helpful criticism of my first rust lib.

License

APL 2.0, see LICENSE file.

No runtime deps