Rapid fuzzy string matching in Rust using the Levenshtein Distance

Description

Key Features

Installation

$cargo add rapidfuzz

Usage

use rapidfuzz::distance::levenshtein;// Perform a simple comparision using he levenshtein distanceassert_eq!(3,    levenshtein::distance("kitten".chars(),"sitting".chars()));// If you are sure the input strings are ASCII only it's usually faster to operate on bytesassert_eq!(3,    levenshtein::distance("kitten".bytes(),"sitting".bytes()));// You can provide a score_cutoff value to filter out strings with distance that is worse than// the score_cutoffassert_eq!(None,    levenshtein::distance_with_args("kitten".chars(),"sitting".chars(),&levenshtein::Args::default().score_cutoff(2)));// You can provide a score_hint to tell the implementation about the expected score.// This can be used to select a more performant implementation internally, but might cause// a slowdown in cases where the distance is actually worse than the score_hintassert_eq!(3,    levenshtein::distance_with_args("kitten".chars(),"sitting".chars(),&levenshtein::Args::default().score_hint(2)));// When comparing a single string to multiple strings you can use the// provided `BatchComparators`. These can cache part of the calculation// which can provide significant speedupslet scorer = levenshtein::BatchComparator::new("kitten".chars());assert_eq!(3, scorer.distance("sitting".chars()));assert_eq!(0, scorer.distance("kitten".chars()));

License