Struct RatcliffObershelp 

pub struct RatcliffObershelp {}

Ratcliff/Obershelp similarity is LCSStr that recursively finds matches on both sides of the longest substring.

The non-normalized result is a double number of matching characters defined as the first longest common substring plus recursively the number of matching characters in the non-matching regions on both sides of the longest common substring.

The normalized result is the non-normalized one divided by the sum of the input string lengths.

Trait Implementations

impl Algorithm<usize> for RatcliffObershelp

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 RatcliffObershelp

fn default() -> RatcliffObershelp

Returns the “default value” for a type.