- All Implemented Interfaces:
- StringDistance, Serializable
public class Damerau
extends Object
implements StringDistance
Implementation of Damerau-Levenshtein distance, computed as the
minimum number of operations needed to transform one string into the other,
where an operation is defined as an insertion, deletion, or substitution of a
single character, or a transposition of two adjacent characters.
This is not to be confused with the optimal string alignment distance, which
is an extension where no substring can be edited more than once.
Also, Damerau-Levenshting does not respect triangle inequality, and is thus
not a metric distance.
- Author:
- Thibault Debatty
- See Also:
- Serialized Form