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

#88 in Algorithms

Download history 368293/week @ 2025-09-23 353197/week @ 2025-09-30 296940/week @ 2025-10-07 324822/week @ 2025-10-14 350315/week @ 2025-10-21 330580/week @ 2025-10-28 295455/week @ 2025-11-04 170115/week @ 2025-11-11 250769/week @ 2025-11-18 197351/week @ 2025-11-25 192360/week @ 2025-12-02 169978/week @ 2025-12-09 157528/week @ 2025-12-16 79784/week @ 2025-12-23 96211/week @ 2025-12-30 185513/week @ 2026-01-06

546,847 downloads per month
Used in 311 crates (42 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