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

#38 in Algorithms

Download history 46233/week @ 2023-12-14 26895/week @ 2023-12-21 24829/week @ 2023-12-28 41153/week @ 2024-01-04 38214/week @ 2024-01-11 48299/week @ 2024-01-18 45271/week @ 2024-01-25 42414/week @ 2024-02-01 48848/week @ 2024-02-08 45327/week @ 2024-02-15 49002/week @ 2024-02-22 49956/week @ 2024-02-29 51781/week @ 2024-03-07 54439/week @ 2024-03-14 45350/week @ 2024-03-21 45657/week @ 2024-03-28

206,463 downloads per month
Used in 168 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