Struct LIG3 

pub struct LIG3 {
    pub levenshtein: Levenshtein,
    pub hamming: Hamming,
}

LIG3 similarity is a normalization of Hamming by Levenshtein.

Fields

levenshtein: Levenshtein

Algorithm instance to use for calculating Levenshtein distance.

hamming: Hamming

Algorithm instance to use for calculating Hamming similarity.

Trait Implementations

impl Algorithm<f64> for LIG3

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

where E: Eq + Hash,

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 LIG3

fn default() -> Self

Returns the “default value” for a type.