A B D G I J K L M N P Q S

A

absoluteDistance(String, String) - Method in class info.debatty.java.stringsimilarity.QGram

add(String) - Method in class info.debatty.java.stringsimilarity.KShingling

B

booleanVectorOf(String) - Method in class info.debatty.java.stringsimilarity.KShingling

D

distance(String, String) - Method in class info.debatty.java.stringsimilarity.JaroWinkler

Distance(String, String) - Static method in class info.debatty.java.stringsimilarity.Levenshtein

distance(String, String) - Method in class info.debatty.java.stringsimilarity.Levenshtein

Distance(String, String) - Static method in class info.debatty.java.stringsimilarity.LongestCommonSubsequence

distance(String, String) - Method in class info.debatty.java.stringsimilarity.LongestCommonSubsequence

distance(String, String) - Method in class info.debatty.java.stringsimilarity.NGram

distance(String, String) - Method in class info.debatty.java.stringsimilarity.QGram

distance(String, String) - Method in interface info.debatty.java.stringsimilarity.StringSimilarityInterface

Generally, distance = 1 - similarity.

distanceAbsolute(String, String) - Method in class info.debatty.java.stringsimilarity.Levenshtein

The Levenshtein distance, or edit distance, between two words is the minimum number of single-character edits (i.e.

distanceAbsolute(String, String) - Method in class info.debatty.java.stringsimilarity.LongestCommonSubsequence

G

getK() - Method in class info.debatty.java.stringsimilarity.KShingling

getThreshold() - Method in class info.debatty.java.stringsimilarity.JaroWinkler

Returns the current value of the threshold used for adding the Winkler bonus.

I

info.debatty.java.stringsimilarity - package info.debatty.java.stringsimilarity

J

JaroWinkler - Class in info.debatty.java.stringsimilarity

JaroWinkler() - Constructor for class info.debatty.java.stringsimilarity.JaroWinkler

JaroWinkler(double) - Constructor for class info.debatty.java.stringsimilarity.JaroWinkler

K

k - Variable in class info.debatty.java.stringsimilarity.KShingling

KShingling - Class in info.debatty.java.stringsimilarity

A k-shingling is a set of unique k-grams, used to measure the similarity of two documents.

KShingling() - Constructor for class info.debatty.java.stringsimilarity.KShingling

KShingling(int) - Constructor for class info.debatty.java.stringsimilarity.KShingling

L

length(String, String) - Method in class info.debatty.java.stringsimilarity.LongestCommonSubsequence

Levenshtein - Class in info.debatty.java.stringsimilarity

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.

Levenshtein() - Constructor for class info.debatty.java.stringsimilarity.Levenshtein

LongestCommonSubsequence - Class in info.debatty.java.stringsimilarity

The longest common subsequence (LCS) problem consists in finding the longest subsequence common to two (or more) sequences.

LongestCommonSubsequence() - Constructor for class info.debatty.java.stringsimilarity.LongestCommonSubsequence

M

main(String[]) - Static method in class info.debatty.java.stringsimilarity.JaroWinkler

main(String[]) - Static method in class info.debatty.java.stringsimilarity.KShingling

main(String[]) - Static method in class info.debatty.java.stringsimilarity.Levenshtein

main(String[]) - Static method in class info.debatty.java.stringsimilarity.LongestCommonSubsequence

main(String[]) - Static method in class info.debatty.java.stringsimilarity.NGram

main(String[]) - Static method in class info.debatty.java.stringsimilarity.QGram

N

NGram - Class in info.debatty.java.stringsimilarity

N-Gram Similarity as defined by Kondrak, "N-Gram Similarity and Distance", String Processing and Information Retrieval, Lecture Notes in Computer Science Volume 3772, 2005, pp 115-126.

NGram(int) - Constructor for class info.debatty.java.stringsimilarity.NGram

NGram() - Constructor for class info.debatty.java.stringsimilarity.NGram

P

parse(String) - Method in class info.debatty.java.stringsimilarity.KShingling

Q

QGram - Class in info.debatty.java.stringsimilarity

QGram similarity is the relative number of n-grams both strings have in common.

QGram(int) - Constructor for class info.debatty.java.stringsimilarity.QGram

QGram() - Constructor for class info.debatty.java.stringsimilarity.QGram

S

setK(int) - Method in class info.debatty.java.stringsimilarity.KShingling

Set the size of k-grams.

setThreshold(double) - Method in class info.debatty.java.stringsimilarity.JaroWinkler

Sets the threshold used to determine when Winkler bonus should be used.

Similarity(String, String) - Static method in class info.debatty.java.stringsimilarity.JaroWinkler

Jaro-Winkler is string edit distance that was developed in the area of record linkage (duplicate detection) (Winkler, 1990).

similarity(String, String) - Method in class info.debatty.java.stringsimilarity.JaroWinkler

similarity(String, String) - Method in class info.debatty.java.stringsimilarity.Levenshtein

similarity(String, String) - Method in class info.debatty.java.stringsimilarity.LongestCommonSubsequence

similarity(String, String) - Method in class info.debatty.java.stringsimilarity.NGram

similarity(String, String) - Method in class info.debatty.java.stringsimilarity.QGram

similarity(String, String) - Method in interface info.debatty.java.stringsimilarity.StringSimilarityInterface

StringSimilarityInterface - Interface in info.debatty.java.stringsimilarity

A B D G I J K L M N P Q S