leven-distance

Crates.ioleven-distance
lib.rsleven-distance
version1.0.0
created_at2024-02-06 18:03:27.158327+00
updated_at2024-02-06 18:03:27.158327+00
descriptionCompute operational differences between two sequences using the Levenshtein algorithm.
homepage
repositoryhttps://github.com/syn-chromatic/levenshtein-rs
max_upload_size
id1129258
size15,610
Synchromatic (syn-chromatic)

documentation

README

Levenshtein

Compute operational differences between two sequences using the Levenshtein algorithm.

Add to Cargo.toml

leven-distance = "*"

Usage:

Basic Usage

use levenshtein::Levenshtein;
use levenshtein::Results;

fn main() {
    let mut levenshtein: Levenshtein = Levenshtein::new();

    // Specify costs as you see fit, the default is 1 for all parameters.
    levenshtein.set_insert_cost(2);
    levenshtein.set_replace_cost(2);
    levenshtein.set_delete_cost(2);

    let results: Results = levenshtein.calculate("test", "text");

    let distance: i32 = results.distance();
    let sequence: &Vec<Vec<i32>> = results.sequence();

    println!("Distance: {}", distance);
    println!("Sequence: {:#?}", sequence);
}

License

This project is licensed under the MIT License.
See the LICENSE file for more information.
Commit count: 17

cargo fmt