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

#36 in Algorithms

Download history 39303/week @ 2024-01-10 44784/week @ 2024-01-17 48903/week @ 2024-01-24 41764/week @ 2024-01-31 45744/week @ 2024-02-07 48090/week @ 2024-02-14 48259/week @ 2024-02-21 49638/week @ 2024-02-28 51784/week @ 2024-03-06 54190/week @ 2024-03-13 46525/week @ 2024-03-20 53187/week @ 2024-03-27 55300/week @ 2024-04-03 51517/week @ 2024-04-10 60963/week @ 2024-04-17 48792/week @ 2024-04-24

226,389 downloads per month
Used in 171 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