Class Sift4
java.lang.Object
info.debatty.java.stringsimilarity.experimental.Sift4
- All Implemented Interfaces:
StringDistance
,Serializable
Sift4 - a general purpose string distance algorithm inspired by JaroWinkler
and Longest Common Subsequence.
Original JavaScript algorithm by siderite, java port by Nathan Fischer 2016.
https://siderite.dev/blog/super-fast-and-accurate-string-distance.html
https://blackdoor.github.io/blog/sift4-java/
- See Also:
-
Field Summary
FieldsModifier and TypeFieldDescriptionprivate static final int
private int
-
Constructor Summary
Constructors -
Method Summary
Modifier and TypeMethodDescriptionfinal double
Sift4 - a general purpose string distance algorithm inspired by JaroWinkler and Longest Common Subsequence.final void
setMaxOffset
(int max_offset) Set the maximum distance to search for character transposition.
-
Field Details
-
DEFAULT_MAX_OFFSET
private static final int DEFAULT_MAX_OFFSET- See Also:
-
max_offset
private int max_offset
-
-
Constructor Details
-
Sift4
public Sift4()
-
-
Method Details
-
setMaxOffset
public final void setMaxOffset(int max_offset) Set the maximum distance to search for character transposition. Compute cost of algorithm is O(n . max_offset)- Parameters:
max_offset
-
-
distance
Sift4 - a general purpose string distance algorithm inspired by JaroWinkler and Longest Common Subsequence. Original JavaScript algorithm by siderite, java port by Nathan Fischer 2016. https://siderite.dev/blog/super-fast-and-accurate-string-distance.html https://blackdoor.github.io/blog/sift4-java/- Specified by:
distance
in interfaceStringDistance
- Parameters:
s1
-s2
-- Returns:
-