Struct str_distance::ratcliff::RatcliffObershelp

pub struct RatcliffObershelp;

The distance between two strings is defined as one minus the number of matching characters divided by the total number of characters in the two strings. Matching characters are those in the longest common subsequence plus, recursively, matching characters in the unmatched region on either side of the longest common subsequence.

Trait Implementations

impl DistanceMetric for RatcliffObershelp

type Dist = f64

Represents the data type in which this distance is evaluated.

fn distance<S, T>(&self, a: S, b: T) -> Self::Dist where
    S: IntoIterator,
    T: IntoIterator,
    <S as IntoIterator>::IntoIter: Clone,
    <T as IntoIterator>::IntoIter: Clone,
    <S as IntoIterator>::Item: PartialEq + PartialEq<<T as IntoIterator>::Item>,
    <T as IntoIterator>::Item: PartialEq, 

Generic implementation of the metric.

fn normalized<S, T>(&self, a: S, b: T) -> f64 where
    S: IntoIterator,
    T: IntoIterator,
    <S as IntoIterator>::IntoIter: Clone,
    <T as IntoIterator>::IntoIter: Clone,
    <S as IntoIterator>::Item: PartialEq + PartialEq<<T as IntoIterator>::Item>,
    <T as IntoIterator>::Item: PartialEq, 

Evaluates the normalized distance between two strings A value of '0.0' corresponds to the "zero distance", both strings are considered equal by means of the metric, whereas a value of '1.0' corresponds to the maximum distance that can exist between the strings.

fn str_distance<S, T>(&self, a: S, b: T) -> Self::Dist where
    S: AsRef<str>,
    T: AsRef<str>, 

Evaluates the distance between two str.

fn str_normalized<S, T>(&self, a: S, b: T) -> f64 where
    S: AsRef<str>,
    T: AsRef<str>, 

Convenience normalization for str types.