Class List

Here are the classes, structs, unions and interfaces with brief descriptions:

[detail level 123]

▼Nliblevenshtein	Various utilities regarding Levenshtein transducers
▼Ndemo
CCommandLine
▼Ndistance	Memoized, recursive distance metrics typically used to evaluate the correctness of Levenshtein automata
CDistance	Metric that measures the edit distance between two terms, denoted d(v,w)
CMemoizedDistance	Memoizes the distance between pairs of terms
CMergeAndSplitDistance	Computes the standard Levenshtein distance extended with two additional elementary operations: (1) merge and (2) split
CStandardDistance	Computes the standard Levenshtein distance, which includes the elementary operations of insertion, deletion, and substitution
CSymmetricPair	Represents a pair of terms sorted, lexicographically, in ascending order
CTranspositionDistance	Computes the standard Levenshtein distance extended with the elementary operation of transposition
CDawg	A Directed Acyclic Word Graph (DAWG) maps sequences of characters to form words; the collection of words is known as a dictionary
CDawgIterator	Iterates over all the terms in a DAWG dictionary
CDawgNode	Represents a position within one or more terms of a DAWG dictionary
CIntersection	Represents an Intersection between a dictionary automaton and Levenshtein automaton, guided by the query term
CLazyIterator	Lazily traverses the intersection between the dictionary automaton and Levenshtein automaton, guided by the query term, and yields each spelling candidate as it is matched
CLazyQuery	Lazily traverses the intersection between the dictionary automaton and Levenshtein automaton, guided by the query term, and yields each spelling candidate as it is matched
CPosition	Represents a location within the Levenshtein automaton
CPrefix	Represents the prefix of a dictionary term
CSortedDawg	A specific type of Dawg that is constructed over lexicographically sorted terms
CState	Consists of a closure of Position nodes within the Levenshtein automaton
CStateIterator	Iterates over the Position nodes in the linked-list of a Levenshtein State
CStateTransition	Transitions Levenshtein States given a characteristic vector
CTransducer	Constructs a Levenshtein Transducer that, when given a dictionary automaton, query term, and maximum edit distance, n, is able to match all spelling candidates in the dictionary automaton for the query term whose edit distances are no larger than n
CTransition	Represents an edge from one DawgNode to another, annotated with a character label from the current position of the dictionary term
CUnsubsumeFn	Removes (unsubsumes) all Positions from a State that are subsumed by another Position within the same State
▼Nstd	STL namespace
Chash< liblevenshtein::Dawg >	Generates a hash code for the given DAWG
Chash< liblevenshtein::DawgNode >	Overloaded hash template struct that serves to generate hash codes for DAWG nodes
Chash< liblevenshtein::distance::SymmetricPair >	Generates hash codes for SymmetricPair instances