6 stable releases

Uses old Rust 2015

1.0.5 Feb 22, 2021
1.0.4 Apr 16, 2019
1.0.3 Jul 6, 2017
1.0.1 Feb 15, 2017
1.0.0 Feb 9, 2016

#94 in Algorithms

Download history 29190/week @ 2023-02-05 29730/week @ 2023-02-12 26449/week @ 2023-02-19 27778/week @ 2023-02-26 24182/week @ 2023-03-05 29105/week @ 2023-03-12 27200/week @ 2023-03-19 33637/week @ 2023-03-26 26325/week @ 2023-04-02 24023/week @ 2023-04-09 25511/week @ 2023-04-16 24055/week @ 2023-04-23 26103/week @ 2023-04-30 28852/week @ 2023-05-07 29861/week @ 2023-05-14 31334/week @ 2023-05-21

117,181 downloads per month
Used in 114 crates (21 directly)

MIT license

3KB

levenshtein.rs

Build Coverage Crate

Vladimir Levenshtein’s edit distance algorithm as a Rust library. There’s also a C library, C user command, and JavaScript module.

🎉 This is my first attempt at Rust!

Installation

Cargo:

[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.

License

MIT © Titus Wormer

No runtime deps