Struct Sift4Common 

pub struct Sift4Common {
    pub max_offset: usize,
    pub max_distance: usize,
}

Sift4 distance is an edit algorithm designed to be “fast and relatively accurate”.

The original blog post describes 3 different implementations of the algorithm, this is the “common” one. The main difference from Sift4Simple is the support for max_distance that can be used to stop calculating the distance after a certain threshold.

Fields

max_offset: usize

The number of characters to search for matching letters. Default: 5.

max_distance: usize

The distance at which the algorithm should stop computing the value and just exit (the strings are too different anyway). Default: 0.

Trait Implementations

impl Algorithm<usize> for Sift4Common

fn for_vec<E: Eq>(&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 Sift4Common

fn default() -> Self

Returns the “default value” for a type.