This repository was archived by the owner on Feb 20, 2025. It is now read-only.

Commits

History for

Commits on May 31, 2017

Commits on Mar 1, 2017

LongestCommonSubsequence: no need to initialize int[] with zero, it has a zero already anyway. There's a tiny speed increase by removing the loops, but micro-benchmarking is another topic. Anyway, …
fabiankessler
committed

Commits on Feb 2, 2017

Add qGram.distance(profile1, profile2). Fix issue #32
tdebatty
committed

Commits on Jan 26, 2017

Reproduce issue #31
tdebatty
committed

Commits on Jan 20, 2017

Commits on Jan 19, 2017

Commits on Dec 14, 2016

Fix issue #27
tdebatty
committed

Commits on Dec 12, 2016

Commits on Dec 8, 2016

Added Sift4 algorithm as mentioned in issue #25 but basic test fails
tdebatty
committed

Commits on Nov 23, 2016

avoid spurious containsKey calls
JPMoresmau
committed

Commits on Oct 20, 2016

Added test for ngram similarity
tdebatty
committed

Commits on Oct 11, 2016

Return ngram distance instead of similarity
Benjamin Han
committed

Commits on Sep 26, 2016

Cleaned code (shingle/profile based algorithms)
tdebatty
committed

Commits on Sep 8, 2016

Commits on Sep 7, 2016

Commits on Aug 22, 2016

Prevent divide by zero errors.
Emmett Underhill
committed

Commits on Aug 3, 2016

cosine similarity returns 0 if one of the strings is shorter than k
tdebatty
committed

Commits on Jul 18, 2016

code clean
tdebatty
committed