Uses of Interface
info.debatty.java.stringsimilarity.interfaces.NormalizedStringDistance

Packages that use NormalizedStringDistance

Package	Description
info.debatty.java.stringsimilarity

Uses of NormalizedStringDistance in info.debatty.java.stringsimilarity

Classes in info.debatty.java.stringsimilarity that implement NormalizedStringDistance

Modifier and Type	Class and Description
class	Cosine The similarity between the two strings is the cosine of the angle between these two vectors representation.
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	JaroWinkler The Jaro–Winkler distance metric is designed and best suited for short strings such as person names, and to detect typos; it is (roughly) a variation of Damerau-Levenshtein, where the substitution of 2 close characters is considered less important then the substitution of 2 characters that a far from each other.
class	MetricLCS Distance metric based on Longest Common Subsequence, from the notes "An LCS-based string metric" by Daniel Bakkelund.
class	NGram N-Gram Similarity as defined by Kondrak, "N-Gram Similarity and Distance", String Processing and Information Retrieval, Lecture Notes in Computer Science Volume 3772, 2005, pp 115-126.
class	NormalizedLevenshtein This distance is computed as levenshtein distance divided by the length of the longest string.
class	SorensenDice Similar to Jaccard index, but this time the similarity is computed as 2 * |V1 inter V2| / (|V1| + |V2|).