Struct Jaccard 

pub struct Jaccard {}

Jaccard similarity is a ratio of intersection to union of two sets.

The metric works with the set of input elements, so strings “abc” and “bca” are the same if compared by letters.

The metric is always normalized on the interval from 0.0 to 1.0.

Trait Implementations

impl Algorithm<f64> for Jaccard

fn for_iter<C, E>(&self, s1: C, s2: C) -> Result<f64>

where C: Iterator<Item = E>, E: Eq + Hash,

Calculate distance/similarity for iterators.

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

where E: Eq + Hash,

Calculate distance/similarity for vectors.

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 Jaccard

fn default() -> Jaccard

Returns the “default value” for a type.