A go-kit based microservice for the Levenshtein distance algorithm
-
Updated
Mar 23, 2016 - Lua
A go-kit based microservice for the Levenshtein distance algorithm
Get the degree of resemblance between two strings
Fast(ish) string similarity for one vs many comparisons.
Utils for node project
C# version of calculating the Damerau Levenshtein Distance. Code is based on the Wikipedia article.
🐍 Python implementations of common string distance and similarity algorithms
String similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity...
program that prints the longest substring in which the letters occur in alphabetical order
Algorithm for the derivation of the top-K string alignments, based on the Levenshtein distance.
A Mata-based Stata command to calculate Levenshtein edit distance.
Course for ANDAN Summer School about strings and texts in R
Detects similarities between strings & generates similarity hash
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
String distances in rust
A python implementation of a variety of text/string distance and similarity metrics. No GPL!
CRF Edit Distance
To associate your repository with the string-distance topic, visit your repo's landing page and select "manage topics."