Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
-
Updated
Jun 1, 2022 - Java
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
Java port of SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm
CS 276 - Programming Assignment 2
A parameterizable Damerau Levenshtein aligner in Java.
Add a description, image, and links to the damerau-levenshtein topic page so that developers can more easily learn about it.
To associate your repository with the damerau-levenshtein topic, visit your repo's landing page and select "manage topics."