C D G I J K L M N P Q S T U V W

C

CharacterSubstitutionInterface - Interface in info.debatty.java.stringsimilarity

Used to indicate the cost of character substitution.

Cosine - Class in info.debatty.java.stringsimilarity

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

Implements Cosine Similarity between strings.

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

cosineSimilarity(StringProfile) - Method in class info.debatty.java.stringsimilarity.StringProfile

cosineSimilarity(SparseIntegerVector) - Method in class info.debatty.java.utils.SparseIntegerVector

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

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

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 interface info.debatty.java.stringsimilarity.interfaces.MetricStringDistance

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

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

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

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

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

dotProduct(SparseIntegerVector) - Method in class info.debatty.java.utils.SparseIntegerVector

dotProduct(double[]) - Method in class info.debatty.java.utils.SparseIntegerVector

G

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

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

Compute and returns the profile of string s The profiles of different strings can be used to compute cosine similarity or qgram distance.

getSet(String) - 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

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

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

info.debatty.java.utils - package info.debatty.java.utils

intersection(SparseBooleanVector) - Method in class info.debatty.java.utils.SparseBooleanVector

intersection(SparseIntegerVector) - Method in class info.debatty.java.utils.SparseIntegerVector

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

jaccard(SparseBooleanVector) - Method in class info.debatty.java.utils.SparseBooleanVector

Computes and return the Jaccard index with other SparseVector.

jaccard(SparseIntegerVector) - Method in class info.debatty.java.utils.SparseIntegerVector

Computes and return the Jaccard index with other SparseVector.

jaccardSimilarity(StringSet) - Method in class info.debatty.java.stringsimilarity.StringSet

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

keys - Variable in class info.debatty.java.utils.SparseBooleanVector

Indicates the positions that hold the value "true"

keys - Variable in class info.debatty.java.utils.SparseIntegerVector

KShingling - Class in info.debatty.java.stringsimilarity

k-shingling is the operation of transforming a string (or text document) into a set of n-grams, which can be used to measure the similarity between two strings or documents.

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

k-shingling is the operation of transforming a string (or text document) into a set of n-grams, which can be used to measure the similarity between two strings or documents.

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.examples.PrecomputedCosine

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(String[]) - Static method in class info.debatty.java.stringsimilarity.NGram

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

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

MetricStringDistance - Interface in info.debatty.java.stringsimilarity.interfaces

String distances that implement this interface are metrics, which means: d(x, y) ≥ 0 (non-negativity, or separation axiom) d(x, y) = 0 if and only if x = y (identity, or coincidence axiom) d(x, y) = d(y, x) (symmetry) d(x, z) ≤ d(x, y) + d(y, z) (triangle inequality).

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²))

norm() - Method in class info.debatty.java.utils.SparseIntegerVector

Compute and return the L2 norm of the vector

NormalizedLevenshtein - Class in info.debatty.java.stringsimilarity

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

NormalizedStringDistance - Interface in info.debatty.java.stringsimilarity.interfaces

Normalized string similarities return a similarity between 0.0 and 1.0.

NormalizedStringSimilarity - Interface in info.debatty.java.stringsimilarity.interfaces

P

PrecomputedCosine - Class in info.debatty.java.stringsimilarity.examples

Example of computing cosine similarity with pre-computed profiles

PrecomputedCosine() - Constructor for class info.debatty.java.stringsimilarity.examples.PrecomputedCosine

Q

QGram - Class in info.debatty.java.stringsimilarity

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

Q-gram similarity and distance.

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

qgram(SparseIntegerVector) - Method in class info.debatty.java.utils.SparseIntegerVector

Compute and return the qgram similarity with other vector.

qgramDistance(StringProfile) - Method in class info.debatty.java.stringsimilarity.StringProfile

S

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

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

Compute and return a measure of similarity between 2 strings.

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

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

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

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

size() - Method in class info.debatty.java.utils.SparseBooleanVector

Return the number of (non-zero) elements in this vector.

size - Variable in class info.debatty.java.utils.SparseIntegerVector

size() - Method in class info.debatty.java.utils.SparseIntegerVector

Return the number of (non-zero) elements in this vector.

SorensenDice - Class in info.debatty.java.stringsimilarity

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

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

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

sorensenDiceSimilarity(StringSet) - Method in class info.debatty.java.stringsimilarity.StringSet

SparseBooleanVector - Class in info.debatty.java.utils

SparseBooleanVector(int) - Constructor for class info.debatty.java.utils.SparseBooleanVector

SparseBooleanVector() - Constructor for class info.debatty.java.utils.SparseBooleanVector

SparseBooleanVector(HashMap<Integer, Integer>) - Constructor for class info.debatty.java.utils.SparseBooleanVector

SparseBooleanVector(boolean[]) - Constructor for class info.debatty.java.utils.SparseBooleanVector

SparseIntegerVector - Class in info.debatty.java.utils

Sparse vector of int, implemented using two arrays

SparseIntegerVector(int) - Constructor for class info.debatty.java.utils.SparseIntegerVector

SparseIntegerVector() - Constructor for class info.debatty.java.utils.SparseIntegerVector

SparseIntegerVector(HashMap<Integer, Integer>) - Constructor for class info.debatty.java.utils.SparseIntegerVector

SparseIntegerVector(int[]) - Constructor for class info.debatty.java.utils.SparseIntegerVector

StringDistance - Interface in info.debatty.java.stringsimilarity.interfaces

StringProfile - Class in info.debatty.java.stringsimilarity

Profile of a string, computed using shingling.

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

StringSet - Class in info.debatty.java.stringsimilarity

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

StringSimilarity - Interface in info.debatty.java.stringsimilarity.interfaces

T

toString() - Method in class info.debatty.java.utils.SparseBooleanVector

toString() - Method in class info.debatty.java.utils.SparseIntegerVector

U

union(SparseBooleanVector) - Method in class info.debatty.java.utils.SparseBooleanVector

union(SparseIntegerVector) - Method in class info.debatty.java.utils.SparseIntegerVector

V

values - Variable in class info.debatty.java.utils.SparseIntegerVector

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

C D G I J K L M N P Q S T U V W