Interface EditDistance<R>
-
- Type Parameters:
R- The type of similarity score unit used by this EditDistance.
- All Superinterfaces:
SimilarityScore<R>
- All Known Implementing Classes:
CosineDistance,HammingDistance,JaccardDistance,JaroWinklerDistance,LevenshteinDetailedDistance,LevenshteinDistance,LongestCommonSubsequenceDistance
public interface EditDistance<R> extends SimilarityScore<R>
Interface for Edit Distances.An edit distance is a formal metric on the Kleene closure (
X<sup>*</sup>) over an alphabet (X). Note, that a metric on a setSis a functiond: [S * S] -> [0, INFINITY)such that the following hold forx,y,zin the setS:d(x,y) >= 0, non-negativity or separation axiomd(x,y) == 0, if and only if,x == yd(x,y) == d(y,x), symmetry, andd(x,z) <= d(x,y) + d(y,z), the triangle inequality
This is a BiFunction<CharSequence, CharSequence, R>. The
applymethod accepts a pair ofCharSequenceparameters and returns anRtype similarity score.- Since:
- 1.0
-
-
Method Summary
All Methods Instance Methods Abstract Methods Modifier and Type Method Description Rapply(java.lang.CharSequence left, java.lang.CharSequence right)Compares two CharSequences.
-
-
-
Method Detail
-
apply
R apply(java.lang.CharSequence left, java.lang.CharSequence right)
Compares two CharSequences.- Specified by:
applyin interfaceSimilarityScore<R>- Parameters:
left- the first CharSequenceright- the second CharSequence- Returns:
- The similarity score between two CharSequences
-
-