Uses of Interface
com.google.gwt.dev.util.editdistance.GeneralEditDistance

Packages that use GeneralEditDistance

Package	Description
com.google.gwt.dev.util.editdistance

Uses of GeneralEditDistance in com.google.gwt.dev.util.editdistance

Classes in com.google.gwt.dev.util.editdistance that implement GeneralEditDistance

Modifier and Type	Class and Description
class	ModifiedBerghelRoachEditDistance A modified version of a string edit distance described by Berghel and Roach that uses only O(d) space and O(n*d) worst-case time, where n is the pattern string length and d is the edit distance computed.
class	MyersBitParallelEditDistance Computes Levenshtein string-edit distance using the algorithm of Eugene Myers (see "A fast bit-vector algorithm for approximate string matching based on dynamic progamming", Journal of the ACM, 46(3): 395-415, 1999), using the reformulations of Heikki Hyyro (see "Explaining and Extending the Bit-parallel Approximate String Matching Algorithm of Myers") along with Gonzalo Navarro ("Faster Bit-Parallel Approximate String Matching", Proc.

Methods in com.google.gwt.dev.util.editdistance that return GeneralEditDistance

Modifier and Type	Method and Description
GeneralEditDistance	MyersBitParallelEditDistance.duplicate()
GeneralEditDistance	GeneralEditDistance.duplicate() Creates a duplicate (clone) of this distance engine, typically in order to use it in another thread (as the GeneralEditDistance contract does not specify thread safety).
static GeneralEditDistance	GeneralEditDistances.getLevenshteinDistance(CharSequence pattern) Generates an GeneralEditDistance engine for a particular pattern string based on Levenshtein distance.