Package de.calcom.cclib.text
Class PseudoDamerauLevenshtein
java.lang.Object
de.calcom.cclib.text.PseudoDamerauLevenshtein
Pseudo-Damerau-Levenshtein (aka "Optimal String Distance")
implementation which allows some non-adjacent transpositions(?)
Computes the edit distance with insertions/deletions/substitutions/transpositions.
Optionally the edit distance of a semi-global alignment is computed which
allows the search term to be shifted free-of-cost (i.e. dist("file", "a file is")==0).
Some properties are explained in the unit test,
.
TODO: use unicode code points instead of chars !!
invalid reference
org.freeplane.features.filter.EditDistanceStringMatchingStrategiesTest
-
Nested Class Summary
Nested ClassesModifier and TypeClassDescriptionclass
static enum
-
Constructor Summary
Constructors -
Method Summary
-
Constructor Details
-
PseudoDamerauLevenshtein
public PseudoDamerauLevenshtein()
-
-
Method Details
-
distance
public int distance() -
computeAlignments
-
matchProb
public float matchProb() -
init
-