Algorithms Library Toolkit
A toolkit for algorithms, especially for algorithms on formal languages
Static Public Member Functions
stringology::matching::GeneralizedLevenshteinSequenceMatchingAutomaton Class Reference

#include <GeneralizedLevenshteinSequenceMatchingAutomaton.h>

Static Public Member Functions

template<class SymbolType >
static automaton::EpsilonNFA< SymbolType, ext::pair< unsigned int, unsigned int > > construct (const string::LinearString< SymbolType > &pattern, unsigned int allowed_errors)
 
template<class SymbolType >
static automaton::EpsilonNFA< SymbolType, ext::pair< unsigned int, unsigned int > > construct (const string::WildcardLinearString< SymbolType > &pattern, unsigned int allowed_errors)
 

Member Function Documentation

◆ construct() [1/2]

template<class SymbolType >
automaton::EpsilonNFA< SymbolType, ext::pair< unsigned int, unsigned int > > stringology::matching::GeneralizedLevenshteinSequenceMatchingAutomaton::construct ( const string::LinearString< SymbolType > &  pattern,
unsigned int  allowed_errors 
)
static

Creates Generalized Levenshtein matching automata for sequence matching from LinearString.

Returns
automata for aproximate sequence matching using Levenshtein method.
Here is the call graph for this function:

◆ construct() [2/2]

template<class SymbolType >
automaton::EpsilonNFA< SymbolType, ext::pair< unsigned int, unsigned int > > stringology::matching::GeneralizedLevenshteinSequenceMatchingAutomaton::construct ( const string::WildcardLinearString< SymbolType > &  pattern,
unsigned int  allowed_errors 
)
static

Creates Generalized Levenshtein matching automata for sequence matching from WildcardLinearString.

Returns
automata for aproximate sequence matching using Levenshtein method.
Here is the call graph for this function:

The documentation for this class was generated from the following file: