Struct Levenshtein 

pub struct Levenshtein {
    pub del_cost: usize,
    pub ins_cost: usize,
    pub sub_cost: usize,
}

Levenshtein distance is an edit distance between two sequences.

It is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other.

See also DamerauLevenshtein which is an extended version of this algorithm that also includes transpositions.

Fields

del_cost: usize

The cost of removing a character.

ins_cost: usize

The cost of adding a new character.

sub_cost: usize

The cost of replacing a character with another one.

Trait Implementations

impl Algorithm<usize> for Levenshtein

fn for_iter<C, E>(&self, s1: C, s2: C) -> Result<usize>

where C: Iterator<Item = E>, E: Eq,

Calculate distance/similarity for iterators.

fn for_vec<E>(&self, s1: &[E], s2: &[E]) -> Result<R>

where E: Eq + Hash,

Calculate distance/similarity for vectors.

fn for_str(&self, s1: &str, s2: &str) -> Result<R>

Calculate distance/similarity for strings.

fn for_words(&self, s1: &str, s2: &str) -> Result<R>

Calculate distance/similarity for words in strings.

fn for_bigrams(&self, s1: &str, s2: &str) -> Result<R>

Calculate distance/similarity for bigrams in strings.

impl Default for Levenshtein

fn default() -> Self

Returns the “default value” for a type.