Struct str_distance::token::TokenSet

pub struct TokenSet<D: DistanceMetric> { /* fields omitted */ }

A TokenSet distance modifies the distance of its inner DistanceMetric to adjust for differences in word orders and word numbers by comparing the intersection of two str with each str.

http://chairnerd.seatgeek.com/fuzzywuzzy-fuzzy-string-matching-in-python/

Methods

impl<D: DistanceMetric> TokenSet<D>

pub fn new(inner: D) -> Self

Create a new TokenSet distance metric using distance D as base.

Trait Implementations

impl<D: DistanceMetric> DistanceMetric for TokenSet<D>

type Dist = <D as DistanceMetric>::Dist

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 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 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_normalized<S, T>(&self, a: S, b: T) -> f64 where
    S: AsRef<str>,
    T: AsRef<str>, 

Convenience normalization for str types.