levenshtein
| Crates.io | levenshtein |
| lib.rs | levenshtein |
| version | 1.0.5 |
| created_at | 2016-02-09 16:11:54.828913+00 |
| updated_at | 2021-02-22 09:21:50.932859+00 |
| description | Levenshtein algorithm |
| homepage | |
| repository | https://github.com/wooorm/levenshtein-rs |
| max_upload_size | |
| id | 4137 |
| size | 3,035 |
Titus (wooorm)
documentation
README
levenshtein.rs
Vladimir Levenshtein’s edit distance algorithm as a Rust library. There’s also a C library, C user command, and JavaScript module.
:tada: This is my first attempt at Rust!
Installation
[dependencies]
levenshtein = "1.0.5"
Usage
extern crate levenshtein;
use levenshtein::levenshtein;
fn main() {
println!("{}", levenshtein("kitten", "sitting"));
}
Yields:
3
API
fn levenshtein(a: &str, b: &str) -> usize
Given two strings, returns the edit distance between them.