liblevenshtein::Transducer< Type, Result > Class Template Reference

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...

#include <transducer.h>

Collaboration diagram for liblevenshtein::Transducer< Type, Result >:

Public Member Functions
	Transducer (DawgNode *root)
	Constructs a Levenshtein Transducer around the root DawgNode of a Dawg dictionary.
	~Transducer ()
	Frees any owned allocations.
auto	operator() (const std::string &term, std::size_t max_distance=2) -> LazyIterator< Result >
	Transduces the query term and max_distance into the set of all spelling candidates from the dictionary automaton whose edit distances from term are no greater than max_distance.

Private Attributes
Intersection *	_intersection
	Initial intersection between the Levenshtein automaton and dictionary automaton.

Detailed Description

template<Algorithm Type, class Result>
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.

Definition at line 26 of file transducer.h.

Constructor & Destructor Documentation

Transducer()

template<Algorithm Type, class Result >

liblevenshtein::Transducer< Type, Result >::Transducer

(

DawgNode *

root

)

Constructs a Levenshtein Transducer around the root DawgNode of a Dawg dictionary.

Parameters

root	Root DawgNode for some Dawg dictionary.

Definition at line 14 of file transducer.cpp.

                                                   {
  auto *position = new Position(0, 0);
  auto *initial_state = new State({position});
  _intersection = new Intersection('\0', root, initial_state);
}

References query().

Here is the call graph for this function:

~Transducer()

template<Algorithm Type, class Result >

liblevenshtein::Transducer< Type, Result >::~Transducer

(

)

Frees any owned allocations.

Definition at line 21 of file transducer.cpp.

                                      {
  delete _intersection;
}

Member Function Documentation

operator()()

template<Algorithm Type, class Result >

auto liblevenshtein::Transducer< Type, Result >::operator()	(	const std::string &	term,
		std::size_t	max_distance = 2 ) -> LazyIterator<Result>

Transduces the query term and max_distance into the set of all spelling candidates from the dictionary automaton whose edit distances from term are no greater than max_distance.

Parameters

term	Query term for spelling correction.
max_distance	Maximum edit distance to consider when matching spelling candidates.

Returns

An iterator over the spelling candidates from the dictionary automaton whose edit distances from term are no greater than max_distance.

Definition at line 26 of file transducer.cpp.

                            {
  return LazyIterator<Result>(
    term, max_distance, _intersection,
    StateTransition(position_transition<Type>, compare<Type>,
            merge<Type>, UnsubsumeFn(subsumes<Type>),
            max_distance, term.length()),
    distance<Type>);
}

References query().

Here is the call graph for this function:

Member Data Documentation

_intersection

template<Algorithm Type, class Result >

Intersection* liblevenshtein::Transducer< Type, Result >::_intersection

private

Initial intersection between the Levenshtein automaton and dictionary automaton.

Definition at line 61 of file transducer.h.

---

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

• src/liblevenshtein/transducer/transducer.h
• src/liblevenshtein/transducer/transducer.cpp