liblevenshtein::distance Namespace Reference

Memoized, recursive distance metrics typically used to evaluate the correctness of Levenshtein automata. More...

Classes
class	Distance
	Metric that measures the edit distance between two terms, denoted d(v,w). More...
class	MemoizedDistance
	Memoizes the distance between pairs of terms. More...
class	MergeAndSplitDistance
	Computes the standard Levenshtein distance extended with two additional elementary operations: (1) merge and (2) split. More...
class	StandardDistance
	Computes the standard Levenshtein distance, which includes the elementary operations of insertion, deletion, and substitution. More...
class	SymmetricPair
	Represents a pair of terms sorted, lexicographically, in ascending order. More...
class	TranspositionDistance
	Computes the standard Levenshtein distance extended with the elementary operation of transposition. More...

Functions
auto	operator<< (std::ostream &out, const SymmetricPair &pair) -> std::ostream &

Detailed Description

Memoized, recursive distance metrics typically used to evaluate the correctness of Levenshtein automata.

These may also be used to compare individual pairs of terms.

Function Documentation

operator<<()

auto liblevenshtein::distance::operator<<	(	std::ostream &	out,
		const SymmetricPair &	pair ) -> std::ostream &

Definition at line 23 of file symmetric_pair.cpp.

                    {
  out << "SymmetricPair{first=\"" << pair.first << "\", second=\""
      << pair.second << "\"}";
  return out;
}