Uses of Interface
org.apache.commons.text.similarity.SimilarityInput

Packages that use SimilarityInput

Package	Description
org.apache.commons.text.similarity	Provides algorithms for string similarity.

Uses of SimilarityInput in org.apache.commons.text.similarity

Classes in org.apache.commons.text.similarity that implement SimilarityInput

Modifier and Type	Class	Description
(package private) final class	SimilarityCharacterInput	Scores the similarity between two CharSequences.

Methods in org.apache.commons.text.similarity that return SimilarityInput

Modifier and Type	Method	Description
static SimilarityInput<Character>	SimilarityInput.input(CharSequence cs)	Creates a new input for a CharSequence.
static <T> SimilarityInput<T>	SimilarityInput.input(Object input)	Creates a new input for a CharSequence or SimilarityInput.

Methods in org.apache.commons.text.similarity with parameters of type SimilarityInput

Modifier and Type	Method	Description
<E> Integer	DamerauLevenshteinDistance.apply(SimilarityInput<E> left, SimilarityInput<E> right)	Computes the Damerau-Levenshtein distance between two inputs.
<E> Integer	HammingDistance.apply(SimilarityInput<E> left, SimilarityInput<E> right)	Computes the Hamming Distance between two strings with the same length.
<E> Double	JaccardDistance.apply(SimilarityInput<E> left, SimilarityInput<E> right)	Computes the Jaccard distance of two set character sequence passed as input.
<E> Double	JaccardSimilarity.apply(SimilarityInput<E> left, SimilarityInput<E> right)	Computes the Jaccard Similarity of two character sequences passed as input.
<E> Double	JaroWinklerDistance.apply(SimilarityInput<E> left, SimilarityInput<E> right)	Computes the Jaro Winkler Distance between two character sequences.
<E> Double	JaroWinklerSimilarity.apply(SimilarityInput<E> left, SimilarityInput<E> right)	Computes the Jaro Winkler Similarity between two character sequences.
<E> LevenshteinResults	LevenshteinDetailedDistance.apply(SimilarityInput<E> left, SimilarityInput<E> right)	Computes the Levenshtein distance between two Strings.
<E> Integer	LevenshteinDistance.apply(SimilarityInput<E> left, SimilarityInput<E> right)	Computes the Levenshtein distance between two inputs.
private static <E> LevenshteinResults	LevenshteinDetailedDistance.findDetailedResults(SimilarityInput<E> left, SimilarityInput<E> right, int[][] matrix, boolean swapped)	Finds count for each of the three [insert, delete, substitute] operations needed.
private static <E> int	DamerauLevenshteinDistance.limitedCompare(SimilarityInput<E> left, SimilarityInput<E> right, int threshold)	Finds the Damerau-Levenshtein distance between two CharSequences if it's less than or equal to a given threshold.
private static <E> LevenshteinResults	LevenshteinDetailedDistance.limitedCompare(SimilarityInput<E> left, SimilarityInput<E> right, int threshold)	Finds the Levenshtein distance between two CharSequences if it's less than or equal to a given threshold.
private static <E> int	LevenshteinDistance.limitedCompare(SimilarityInput<E> left, SimilarityInput<E> right, int threshold)	Finds the Levenshtein distance between two CharSequences if it's less than or equal to a given threshold.
protected static <E> int[]	JaroWinklerSimilarity.matches(SimilarityInput<E> first, SimilarityInput<E> second)	Computes the Jaro-Winkler string matches, half transpositions, prefix array.
private static <E> int	DamerauLevenshteinDistance.unlimitedCompare(SimilarityInput<E> left, SimilarityInput<E> right)	Finds the Damerau-Levenshtein distance between two inputs using optimal string alignment.
private static <E> LevenshteinResults	LevenshteinDetailedDistance.unlimitedCompare(SimilarityInput<E> left, SimilarityInput<E> right)	Finds the Levenshtein distance between two Strings.
private static <E> int	LevenshteinDistance.unlimitedCompare(SimilarityInput<E> left, SimilarityInput<E> right)	Finds the Levenshtein distance between two Strings.