levenshtein-rs
| Crates.io | levenshtein-rs |
| lib.rs | levenshtein-rs |
| version | 0.1.1 |
| created_at | 2020-08-06 14:44:41.684641+00 |
| updated_at | 2022-07-20 14:04:40.16354+00 |
| description | Levenshtein distance algorithm |
| homepage | |
| repository | https://github.com/kenkyu392/levenshtein-rs |
| max_upload_size | |
| id | 273681 |
| size | 3,971 |
NONAME (kenkyu392)
documentation
README
:warning: This crate has been moved to levenshtein-distance.
levenshtein-rs
Provides the Levenshtein distance algorithm for Rust.
Usage
[dependencies]
levenshtein-rs = "0.1.0"
use levenshtein_rs::compute;
fn main() {
let cat = "I Am a Cat";
let dog = "I Am a Dog";
println!("{}", compute(cat, dog));
// -> 3
}