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 fuzzy string matching implementation of the well known Python's fuzzywuzzy algorithm. Fuzzy search for Java
A Java library for computation on permutations and sequences
String trie that supports wildcard search
Algorithm for the derivation of the top-K string alignments, based on the Levenshtein distance.
Example programs for the JavaPermutationTools (JPT) library
Created a search engine with functionalities such as counting the frequency of words using Boyer Moore, Brute Force Algorithm, Web Page Ranking using Quicksort Algorithm, spell checking and suggestion using Edit Distance algorithm and Java, HTML to TEXT converter using Jsoup converter
Add a description, image, and links to the string-distance topic page so that developers can more easily learn about it.
To associate your repository with the string-distance topic, visit your repo's landing page and select "manage topics."