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

Packages that use MetricStringDistance

Package	Description
info.debatty.java.stringsimilarity

Uses of MetricStringDistance in info.debatty.java.stringsimilarity

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

Modifier and Type	Class and Description
class	Jaccard
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.