We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent 4a529b5 commit eeb33dcCopy full SHA for eeb33dc
src/main/java/info/debatty/java/stringsimilarity/experimental/Sift4.java
@@ -30,8 +30,8 @@
30
* Sift4 - a general purpose string distance algorithm inspired by JaroWinkler
31
* and Longest Common Subsequence.
32
* Original JavaScript algorithm by siderite, java port by Nathan Fischer 2016.
33
- * https://siderite.blogspot.com/2014/11/super-fast-and-accurate-string-
34
- * distance.html
+ * https://siderite.dev/blog/super-fast-and-accurate-string-distance.html
+ * https://blackdoor.github.io/blog/sift4-java/
35
*
36
* @author Thibault Debatty
37
*/
@@ -55,8 +55,8 @@ public final void setMaxOffset(final int max_offset) {
55
* JaroWinkler and Longest Common Subsequence.
56
* Original JavaScript algorithm by siderite, java port by Nathan Fischer
57
* 2016.
58
59
60
61
* @param s1
62
* @param s2
AltStyle によって変換されたページ (->オリジナル) / アドレス: モード: デフォルト 音声ブラウザ ルビ付き 配色反転 文字拡大 モバイル
0 commit comments