public class LevenshteinDistance extends Object implements EditDistance<Integer>
This is the number of changes needed to change one sequence into another, where each change is a single character modification (deletion, insertion or substitution).
This code has been adapted from Apache Commons Lang 3.3.
This returns the default instance that uses a version of the algorithm that does not use a threshold parameter.
- See Also:
public LevenshteinDistance(Integer threshold)
If the threshold is not null, distance calculations will be limited to a maximum length. If the threshold is null, the unlimited version of the algorithm will be used.
threshold- If this is null then distances calculations will not be limited. This may not be negative.
Find the Levenshtein distance between two Strings.
A higher score indicates a greater distance.
The previous implementation of the Levenshtein distance algorithm was from http://www.merriampark.com/ld.htm
Chas Emerick has written an implementation in Java, which avoids an OutOfMemoryError which can occur when my Java implementation is used with very large strings.
This implementation of the Levenshtein distance algorithm is from http://www.merriampark.com/ldjava.htm
distance.apply(null, *) = IllegalArgumentException distance.apply(*, null) = IllegalArgumentException distance.apply("","") = 0 distance.apply("","a") = 1 distance.apply("aaapppp", "") = 7 distance.apply("frog", "fog") = 1 distance.apply("fly", "ant") = 3 distance.apply("elephant", "hippo") = 7 distance.apply("hippo", "elephant") = 7 distance.apply("hippo", "zzzzzzzz") = 8 distance.apply("hello", "hallo") = 1
- Specified by:
- Specified by:
left- the first string, must not be null
right- the second string, must not be null
- result distance, or -1
IllegalArgumentException- if either String input
public static LevenshteinDistance getDefaultInstance()Gets the default instance.
- The default instance
public Integer getThreshold()Gets the distance threshold.
- The distance threshold