Package | Description |
---|---|
info.debatty.java.stringsimilarity |
Modifier and Type | Class and Description |
---|---|
class |
Jaccard
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 |
Levenshtein
The Levenshtein distance between two words is the minimum number of
single-character edits (insertions, deletions or substitutions) required to
change one word into the other.
|
class |
MetricLCS
Distance metric based on Longest Common Subsequence, from the notes "An
LCS-based string metric" by Daniel Bakkelund.
|
Copyright © 2015. All rights reserved.