transducer.h File Reference

#include <cstddef>
#include <string>
#include <utility>
#include "liblevenshtein/collection/dawg_node.h"
#include "liblevenshtein/transducer/algorithm.h"
#include "liblevenshtein/transducer/intersection.h"
#include "liblevenshtein/transducer/lazy_query.h"

Include dependency graph for transducer.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Classes
class	liblevenshtein::Transducer< Type, Result >
	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. More...

Namespaces
namespace	liblevenshtein
	Various utilities regarding Levenshtein transducers.

Typedefs
using	liblevenshtein::Candidate = std::pair<std::string, std::size_t>
	Spelling candidate that includes both the dictionary term and its edit distance from the query term.