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

#2 in #distance

Download history 54439/week @ 2024-03-14 45326/week @ 2024-03-21 58173/week @ 2024-03-28 51136/week @ 2024-04-04 54404/week @ 2024-04-11 59140/week @ 2024-04-18 59547/week @ 2024-04-25 62766/week @ 2024-05-02 68578/week @ 2024-05-09 97606/week @ 2024-05-16 96685/week @ 2024-05-23 96844/week @ 2024-05-30 101309/week @ 2024-06-06 103162/week @ 2024-06-13 99931/week @ 2024-06-20 82166/week @ 2024-06-27

406,732 downloads per month
Used in 182 crates (30 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