stringmetrics 2.2.2

Rust library for approximate string matching
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32

//! # Stringmetric Algorithms
//!
//! This module includes the various implementations for Levenshthein and
//! Hamming distance, as well as the Jaccard index. See these modules for
//! in-depth explanation of how the algorithms work, or the function docs for
//! usage information
//!
//! All relevant functions can be directly imported from `stringmetrics`, no
//! need to access them nested modules (see the example below).
//!
//! ## Example
//!
//! ```
//! use stringmetrics::levenshtein;
//! let a = "this is a book";
//! let b = "i am a cook";
//! assert_eq!(levenshtein(a, b), 6);
//! ```

mod hamming_impl;
// mod damerau;
mod jaccard_impl;
mod lev_impl;

pub use self::hamming_impl::{hamming, hamming_iter};
// pub use self::damerau::damerau_levenshtein;
pub use self::jaccard_impl::{jaccard, jaccard_set};
pub use self::lev_impl::{
    levenshtein, levenshtein_limit, levenshtein_limit_iter, levenshtein_weight,
    levenshtein_weight_iter, try_levenshtein, try_levenshtein_iter, try_levenshtein_weight,
    try_levenshtein_weight_iter, LevWeights,
};