- Damerau - Class in info.debatty.java.stringsimilarity
-
Implementation of Damerau-Levenshtein distance with transposition (also
sometimes calls unrestricted Damerau-Levenshtein distance).
- Damerau() - Constructor for class info.debatty.java.stringsimilarity.Damerau
-
- deletionCost(char) - Method in interface info.debatty.java.stringsimilarity.CharacterInsDelInterface
-
- distance(String, String) - Method in class info.debatty.java.stringsimilarity.Cosine
-
Return 1.0 - similarity.
- distance(String, String) - Method in class info.debatty.java.stringsimilarity.Damerau
-
Compute the distance between strings: the minimum number of operations
needed to transform one string into the other (insertion, deletion,
substitution of a single character, or a transposition of two adjacent
characters).
- distance(String, String) - Method in class info.debatty.java.stringsimilarity.experimental.Sift4
-
Sift4 - a general purpose string distance algorithm inspired by
JaroWinkler and Longest Common Subsequence.
- distance(String, String) - Method in interface info.debatty.java.stringsimilarity.interfaces.MetricStringDistance
-
Compute and return the metric distance.
- distance(String, String) - Method in interface info.debatty.java.stringsimilarity.interfaces.StringDistance
-
Compute and return a measure of distance.
- distance(String, String) - Method in class info.debatty.java.stringsimilarity.Jaccard
-
Distance is computed as 1 - similarity.
- distance(String, String) - Method in class info.debatty.java.stringsimilarity.JaroWinkler
-
Return 1 - similarity.
- distance(String, String) - Method in class info.debatty.java.stringsimilarity.Levenshtein
-
The Levenshtein distance, or edit distance, between two words is the
minimum number of single-character edits (insertions, deletions or
substitutions) required to change one word into the other.
- distance(String, String) - Method in class info.debatty.java.stringsimilarity.LongestCommonSubsequence
-
Return the LCS distance between strings s1 and s2, computed as |s1| +
|s2| - 2 * |LCS(s1, s2)|.
- distance(String, String) - Method in class info.debatty.java.stringsimilarity.MetricLCS
-
Distance metric based on Longest Common Subsequence, computed as
1 - |LCS(s1, s2)| / max(|s1|, |s2|).
- distance(String, String) - Method in class info.debatty.java.stringsimilarity.NGram
-
Compute n-gram distance.
- distance(String, String) - Method in class info.debatty.java.stringsimilarity.NormalizedLevenshtein
-
Compute distance as Levenshtein(s1, s2) / max(|s1|, |s2|).
- distance(String, String) - Method in class info.debatty.java.stringsimilarity.OptimalStringAlignment
-
Compute the distance between strings: the minimum number of operations
needed to transform one string into the other (insertion, deletion,
substitution of a single character, or a transposition of two adjacent
characters) while no substring is edited more than once.
- distance(String, String) - Method in class info.debatty.java.stringsimilarity.QGram
-
The distance between two strings is defined as the L1 norm of the
difference of their profiles (the number of occurence of each k-shingle).
- distance(Map<String, Integer>, Map<String, Integer>) - Method in class info.debatty.java.stringsimilarity.QGram
-
Compute QGram distance using precomputed profiles.
- distance(String, String) - Method in class info.debatty.java.stringsimilarity.SorensenDice
-
Returns 1 - similarity.
- distance(String, String) - Method in class info.debatty.java.stringsimilarity.WeightedLevenshtein
-
Compute Levenshtein distance using provided weights for substitution.
- setMaxOffset(int) - Method in class info.debatty.java.stringsimilarity.experimental.Sift4
-
Set the maximum distance to search for character transposition.
- ShingleBased - Class in info.debatty.java.stringsimilarity
-
Abstract class for string similarities that rely on set operations (like
cosine similarity or jaccard index).
- ShingleBased(int) - Constructor for class info.debatty.java.stringsimilarity.ShingleBased
-
- Sift4 - Class in info.debatty.java.stringsimilarity.experimental
-
Sift4 - a general purpose string distance algorithm inspired by JaroWinkler
and Longest Common Subsequence.
- Sift4() - Constructor for class info.debatty.java.stringsimilarity.experimental.Sift4
-
- similarity(String, String) - Method in class info.debatty.java.stringsimilarity.Cosine
-
Compute the cosine similarity between strings.
- similarity(Map<String, Integer>, Map<String, Integer>) - Method in class info.debatty.java.stringsimilarity.Cosine
- similarity(String, String) - Method in interface info.debatty.java.stringsimilarity.interfaces.StringSimilarity
-
Compute and return a measure of similarity between 2 strings.
- similarity(String, String) - Method in class info.debatty.java.stringsimilarity.Jaccard
-
Compute Jaccard index: |A inter B| / |A union B|.
- similarity(String, String) - Method in class info.debatty.java.stringsimilarity.JaroWinkler
-
Compute Jaro-Winkler similarity.
- similarity(String, String) - Method in class info.debatty.java.stringsimilarity.NormalizedLevenshtein
-
Return 1 - distance.
- similarity(String, String) - Method in class info.debatty.java.stringsimilarity.SorensenDice
-
Similarity is computed as 2 * |A inter B| / (|A| + |B|).
- SorensenDice - Class in info.debatty.java.stringsimilarity
-
Similar to Jaccard index, but this time the similarity is computed as 2 * |V1
inter V2| / (|V1| + |V2|).
- SorensenDice(int) - Constructor for class info.debatty.java.stringsimilarity.SorensenDice
-
Sorensen-Dice coefficient, aka Sørensen index, Dice's coefficient or
Czekanowski's binary (non-quantitative) index.
- SorensenDice() - Constructor for class info.debatty.java.stringsimilarity.SorensenDice
-
Sorensen-Dice coefficient, aka Sørensen index, Dice's coefficient or
Czekanowski's binary (non-quantitative) index.
- StringDistance - Interface in info.debatty.java.stringsimilarity.interfaces
-
- StringSimilarity - Interface in info.debatty.java.stringsimilarity.interfaces
-