Uses of Interface
info.debatty.java.stringsimilarity.interfaces.MetricStringDistance
Packages that use MetricStringDistance
-
Uses of MetricStringDistance in info.debatty.java.stringsimilarity
Classes in info.debatty.java.stringsimilarity that implement MetricStringDistanceModifier and TypeClassDescriptionclass
Implementation of Damerau-Levenshtein distance with transposition (also sometimes calls unrestricted Damerau-Levenshtein distance).class
Each input string is converted into a set of n-grams, the Jaccard index is then computed as |V1 inter V2| / |V1 union V2|.class
The Levenshtein distance between two words is the minimum number of single-character edits (insertions, deletions or substitutions) required to change one string into the other.class
Distance metric based on Longest Common Subsequence, from the notes "An LCS-based string metric" by Daniel Bakkelund.