Uses of Package
info.debatty.java.stringsimilarity
Packages that use info.debatty.java.stringsimilarity
-
Classes in info.debatty.java.stringsimilarity used by info.debatty.java.stringsimilarityClassDescriptionAs an adjunct to CharacterSubstitutionInterface, this interface allows you to specify the cost of deletion or insertion of a character.Used to indicate the cost of character substitution.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.The longest common subsequence (LCS) problem consists in finding the longest subsequence common to two (or more) sequences.Abstract class for string similarities that rely on set operations (like cosine similarity or jaccard index).