Implementations of distance measures for general sequences of various forms, including Strings, arrays of primitive types, arrays of objects, etc.
Interface Summary Interface Description SequenceDistanceMeasurerImplement this interface, SequenceDistanceMeasurer, to define a distance metric for sequences. SequenceDistanceMeasurerDoubleImplement this interface, SequenceDistanceMeasurerDouble, to define a distance metric for sequences.
Class Summary Class Description EditDistanceEditDistance is an implementation of Wagner and Fischer's dynamic programming algorithm for computing string edit distance. ExactMatchDistanceExactMatch distance (or Hamming Distance) of a pair of non-binary strings (or more generally sequences) is the number of sequence (or string) positions where the two sequences differ. KendallTauSequenceDistanceKendall Tau Sequence Distance is the minimum number of adjacent swaps necessary to transform one sequence into the other. LongestCommonSubsequenceDistanceLongestCommonSubsequenceDistance is a form of EditDistance, where the edit operations are limited to deletions and insertions (i.e., no replacements or changes), and where the cost of an edit operation is simply 1.