liblevenshtein 4.0.0
A library for generating Finite State Transducers based on Levenshtein Automata.
Loading...
Searching...
No Matches
comparator.h
Go to the documentation of this file.
1#ifndef LIBLEVENSHTEIN_TRANSDUCER_COMPARATOR_H
2#define LIBLEVENSHTEIN_TRANSDUCER_COMPARATOR_H
3
4#include "liblevenshtein/transducer/algorithm.h"
5#include "liblevenshtein/transducer/position.h"
6
7namespace liblevenshtein {
8
17template <Algorithm Type> auto compare(Position *lhs, Position *rhs) -> int;
18
27template <>
28auto compare<Algorithm::STANDARD>(Position *lhs, Position *rhs) -> int;
29
39template <>
40auto compare<Algorithm::TRANSPOSITION>(Position *lhs, Position *rhs) -> int;
41
51template <>
52auto compare<Algorithm::MERGE_AND_SPLIT>(Position *lhs, Position *rhs) -> int;
53
54} // namespace liblevenshtein
55
56
57#endif // LIBLEVENSHTEIN_TRANSDUCER_COMPARATOR_H
liblevenshtein::Position
Represents a location within the Levenshtein automaton.
Definition position.h:11
query
void query(ll::Dawg *dawg, const std::string &query_term, std::size_t max_distance)
Definition main.cpp:25
liblevenshtein
Various utilities regarding Levenshtein transducers.
Definition namespaces.dox:9
liblevenshtein::compare< Algorithm::MERGE_AND_SPLIT >
auto compare< Algorithm::MERGE_AND_SPLIT >(Position *lhs, Position *rhs) -> int
Compares two Positions for the standard Levenshtein transducer extended with merge and split.
Definition comparator.cpp:53
liblevenshtein::compare< Algorithm::STANDARD >
auto compare< Algorithm::STANDARD >(Position *lhs, Position *rhs) -> int
Compares two Positions for the standard Levenshtein transducer.
Definition comparator.cpp:10
liblevenshtein::compare< Algorithm::TRANSPOSITION >
auto compare< Algorithm::TRANSPOSITION >(Position *lhs, Position *rhs) -> int
Compares two Positions for the standard Levenshtein transducer extended with transposition.
Definition comparator.cpp:31
liblevenshtein::compare
auto compare(Position *lhs, Position *rhs) -> int
Compares two Positions within the Levenshtein transducer.