All Classes and Interfaces

Class
Description
is an iterator that returns lookup results in a BKTree according to an order provided.
a dictionary implementation using Burkhard Keller Trees.
provides several implementations of LevenCosts.
defines a dictionary for approximate lookup.
is an implementation of a did you mean based on a Dictionary.
is the exception thrown if a file read does contain format errors.
defines a function to compute an integer valued metric.
is a trivial example of IntMetric that uses the difference of string length as the distance value.
Defines the methods necessary to parameterize the cost of the LevenshteinMetric.
is an implementation of the Levenshtein edit distance (or metric).
a dictionary for fast approximate lookup of words.
defines result elements returned by lookup().