liblevenshtein 0.9.1

Levenshtein/Universal Automata for approximate string matching using various dictionary backends
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14

//! Lexer for phonetic regular expressions.
//!
//! Tokenizes input strings into a stream of tokens for the parser.

mod byte;
mod char;
#[cfg(test)]
mod tests;

pub use byte::{LexerByte, TokenByte};
pub use char::{Lexer, Token};

// Re-export ParsedFlags for users of this module
pub use crate::phonetic::common::flags::ParsedFlags;