String similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity...
-
Updated
Sep 22, 2017 - Go
String similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity...
This package allow use strings operations to generic sequence
Comparison among four spelling correction methods. n-gram, Levenshtein, Jaro, Jaro_winkler
Collection of string metric algorithms in OCaml
Calculate text distance (similarity) in Golang - Experimental implementation
String Similarity Algorithms
An Implementation of Jaro Distance Algorithm by Matthew A. Jaro
String Comparision in C#.NET
A text similarity metric library, e.g. from edit distance's (Levenshtein, Gotoh, Jaro, etc) to other metrics, (e.g Soundex, Chapman). This library is compiled based on the .NET standard with a lot of useful extension methods.
A fuzzy matching string distance library for Scala and Java that includes Levenshtein distance, Jaro distance, Jaro-Winkler distance, Dice coefficient, N-Gram similarity, Cosine similarity, Jaccard similarity, Longest common subsequence, Hamming distance, and more..
Matching records by linking entities using string and data matching
Cython extension modules for Levenshtein-distance, Jaro-Winkler-distance, Damerau-Levenshtein-distance, Hamming-distance
String similarity library for Kotlin
Calculate various string metrics efficiently in Haskell
Add a description, image, and links to the jaro-distance topic page so that developers can more easily learn about it.
To associate your repository with the jaro-distance topic, visit your repo's landing page and select "manage topics."