Struct DamerauLevenshtein 

pub struct DamerauLevenshtein {
    pub restricted: bool,
    pub del_cost: usize,
    pub ins_cost: usize,
    pub sub_cost: usize,
    pub trans_cost: usize,
}

Damerau-Levenshtein distance is an edit distance between two sequences.

It is an improved version of Levenshtein that also includes transpositions.

It is the minimum number of operations (consisting of insertions, deletions or substitutions of a single character, or transposition of two adjacent characters) required to change one text into the other.

Fields

restricted: bool

If false (default), allow adjacent transpositions.

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.

trans_cost: usize

The cost of swapping two adjacent characters.

Trait Implementations

impl Algorithm<usize> for DamerauLevenshtein

fn for_vec<E: Eq + Hash>(&self, s1: &[E], s2: &[E]) -> Result<usize>

Calculate distance/similarity for vectors.

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

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

Calculate distance/similarity for iterators.

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 DamerauLevenshtein

fn default() -> Self

Returns the “default value” for a type.