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

#87 in Algorithms

Download history 147795/week @ 2024-11-17 104258/week @ 2024-11-24 149952/week @ 2024-12-01 142908/week @ 2024-12-08 137863/week @ 2024-12-15 49473/week @ 2024-12-22 56844/week @ 2024-12-29 133624/week @ 2025-01-05 151648/week @ 2025-01-12 126384/week @ 2025-01-19 129820/week @ 2025-01-26 148360/week @ 2025-02-02 160773/week @ 2025-02-09 135876/week @ 2025-02-16 151955/week @ 2025-02-23 152802/week @ 2025-03-02

609,703 downloads per month
Used in 234 crates (34 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