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

#96 in Algorithms

Download history 116539/week @ 2024-08-21 104837/week @ 2024-08-28 115671/week @ 2024-09-04 109177/week @ 2024-09-11 108587/week @ 2024-09-18 113282/week @ 2024-09-25 124991/week @ 2024-10-02 122319/week @ 2024-10-09 132486/week @ 2024-10-16 119942/week @ 2024-10-23 116538/week @ 2024-10-30 122119/week @ 2024-11-06 160705/week @ 2024-11-13 134732/week @ 2024-11-20 112292/week @ 2024-11-27 118496/week @ 2024-12-04

550,464 downloads per month
Used in 204 crates (33 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