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

#285 in Algorithms

Download history 175198/week @ 2026-01-04 198332/week @ 2026-01-11 165043/week @ 2026-01-18 169586/week @ 2026-01-25 197768/week @ 2026-02-01 220372/week @ 2026-02-08 172029/week @ 2026-02-15 165827/week @ 2026-02-22 224252/week @ 2026-03-01 249273/week @ 2026-03-08 202723/week @ 2026-03-15 227020/week @ 2026-03-22 211594/week @ 2026-03-29 221632/week @ 2026-04-05 226278/week @ 2026-04-12 200245/week @ 2026-04-19

874,880 downloads per month
Used in 352 crates (47 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