Uses of Interface
info.debatty.java.stringsimilarity.StringSimilarityInterface

Uses of StringSimilarityInterface in info.debatty.java.stringsimilarity

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

Modifier and Type	Class and Description
class	Cosine Implements Cosine Similarity.
class	Damerau Implementation of Damerau-Levenshtein distance, computed as the minimum number of operations needed to transform one string into the other, where an operation is defined as an insertion, deletion, or substitution of a single character, or a transposition of two adjacent characters.
class	Jaccard
class	JaroWinkler
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	LongestCommonSubsequence The longest common subsequence (LCS) problem consists in finding the longest subsequence common to two (or more) sequences.
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	QGram
class	SorensenDice
class	WeightedLevenshtein Implementation of Levenshtein that allows to define different weights for different character substitutions.