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

Interface Summary

Interface	Description
GeneralEditDistance	An engine definition for computing string edit distances, and implementation generators.

Class Summary

Class	Description
CharIndex	A performance-oriented character-indexed map.
CharIndex.FullHash	An index based on a garden-variety hash map.
CharIndex.Masked	An index based on a simple mask: index(c) = (c & MASK).
CharIndex.Straight	An index based on the identity mapping: index(c) = c.
GeneralEditDistances	A collection of instance generators for the GeneralEditDistance interface.
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.
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.
PatternBitmap	A bitmap array generator for the positions that a given character appears within a pattern.