liblevenshtein 4.0.0
A library for generating Finite State Transducers based on Levenshtein Automata.
Loading...
Searching...
No Matches
subsumes.h
Go to the documentation of this file.
1#ifndef LIBLEVENSHTEIN_TRANSDUCER_SUBSUMES_H
2#define LIBLEVENSHTEIN_TRANSDUCER_SUBSUMES_H
3
6
7namespace liblevenshtein {
8
22template <Algorithm Type>
23auto subsumes(Position *lhs, Position *rhs, std::size_t n) -> bool;
24
35template <>
37 -> bool;
38
49template <>
51 std::size_t n) -> bool;
52
63template <>
65 std::size_t n) -> bool;
66
67} // namespace liblevenshtein
68
69#endif // LIBLEVENSHTEIN_TRANSDUCER_SUBSUMES_H
Represents a location within the Levenshtein automaton.
Definition position.h:11
void query(ll::Dawg *dawg, const std::string &query_term, std::size_t max_distance)
Definition main.cpp:25
Various utilities regarding Levenshtein transducers.
Definition namespaces.dox:9
auto subsumes(Position *lhs, Position *rhs, std::size_t n) -> bool
Returns whether Position lhs subsumes Position rhs, given the maximum edit distance n.
auto subsumes< Algorithm::MERGE_AND_SPLIT >(Position *lhs, Position *rhs, std::size_t n) -> bool
Returns whether lhs subsumes rhs according to the subsumption rules of standard Levenshtein distance ...
Definition subsumes.cpp:42
auto subsumes< Algorithm::TRANSPOSITION >(Position *lhs, Position *rhs, std::size_t n) -> bool
Returns whether lhs subsumes rhs according to the subsumption rules of standard Levenshtein distance ...
Definition subsumes.cpp:16
auto subsumes< Algorithm::STANDARD >(Position *lhs, Position *rhs, std::size_t n) -> bool
Returns whether lhs subsumes rhs according to the subsumption rules of standard Levenshtein distance,...
Definition subsumes.cpp:6