stringology::matching::GeneralizedLevenshteinMatchingAutomaton Class Reference

#include <GeneralizedLevenshteinMatchingAutomaton.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::GeneralizedLevenshteinMatchingAutomaton::construct ( const string::LinearString< SymbolType > &  pattern, unsigned int  allowed_errors  )

static

Creates Levenshtein matching automata from LinearString

Returns

automata for aproximate string matching using Hamming algorithm

Here is the call graph for this function:

Here is the caller graph for this function:

construct() [2/2]

template<class SymbolType >

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

static

Creates Levenshtein matching automata from LinearString

Returns

automata for aproximate string matching using Hamming algorithm

Here is the call graph for this function:

---

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

• alib2algo/src/stringology/matching/GeneralizedLevenshteinMatchingAutomaton.h