Struct Suffix 

pub struct Suffix {}

Suffix similarity is the length of the longest common suffix of the given sequences.

It’s a very dumb metric but it can work surprisingly well for comparing words in languages with an active use of prefixes.

Trait Implementations

impl Algorithm<usize> for Suffix

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 Suffix

fn default() -> Suffix

Returns the “default value” for a type.