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

A

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

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

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

Add a k-shingle s to the list of possible shingles

B

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

Compute and return the boolean vector representation of string s.

C

CharacterSubstitutionInterface - Interface in info.debatty.java.stringsimilarity

Used to indicate the cost of character substitution.

Cosine - Class in info.debatty.java.stringsimilarity

Implements Cosine Similarity.

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

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

cost(char, char) - Method in interface info.debatty.java.stringsimilarity.CharacterSubstitutionInterface

countOccurences(String, String) - Static method in class info.debatty.java.stringsimilarity.KShingling

D

Damerau - Class in info.debatty.java.stringsimilarity

Implementation of Damerau-Levenshtein distance, computed as the minimum number of operations needed to transform one string into the other, where an operation is defined as an insertion, deletion, or substitution of a single character, or a transposition of two adjacent characters.

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

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

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

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

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

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 class info.debatty.java.stringsimilarity.SorensenDice

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

Generally, distance = 1 - similarity.

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

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 (insertions, deletions or substitutions) required to change one word into the other.

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

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

dotProduct(int[], int[]) - Static method in class info.debatty.java.stringsimilarity.Cosine

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

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

Compute the boolean representation of string s, returned as a set of position integers.

J

Jaccard - Class in info.debatty.java.stringsimilarity

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

The strings are first transformed into sets of k-shingles (sequences of k characters), then Jaccard index is computed as |A inter B| / |A union B|.

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

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.Cosine

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

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

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 - Class in info.debatty.java.stringsimilarity

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

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

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

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

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

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

min(int, int, int, int) - Static method in class info.debatty.java.stringsimilarity.Damerau

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

norm(int[]) - Static method in class info.debatty.java.stringsimilarity.Cosine

Compute the norm L2 : sqrt(Sum_i( v_i^2))

P

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

Extract all k-singles from sting s and add them to the list of possible shingles

printArray(boolean[]) - Static method in class info.debatty.java.stringsimilarity.KShingling

printArray(int[]) - Static method in class info.debatty.java.stringsimilarity.KShingling

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

Compute and return the profile of s, as defined by Ukkonen "Approximate string-matching with q-grams and maximal matches".

Q

QGram - Class in info.debatty.java.stringsimilarity

Q-gram similarity and distance.

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) - Method in class info.debatty.java.stringsimilarity.Cosine

Computes the cosine similarity of s1 and s2.

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

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

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 class info.debatty.java.stringsimilarity.SorensenDice

Compute Sorensen-Dice coefficient 2 |A inter B| / (|A| + |B|).

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

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

SorensenDice - Class in info.debatty.java.stringsimilarity

Sorensen-Dice coefficien, aka Sørensen index, Dice's coefficient or Czekanowski's binary (non-quantitative) index.

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

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

StringSimilarityInterface - Interface in info.debatty.java.stringsimilarity

W

WeightedLevenshtein - Class in info.debatty.java.stringsimilarity

Implementation of Levenshtein that allows to define different weights for different character substitutions.

WeightedLevenshtein(CharacterSubstitutionInterface) - Constructor for class info.debatty.java.stringsimilarity.WeightedLevenshtein

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