java-string-similarity - 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

---

Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity...

levenshtein-distance cosine-similarity string-distance damerau-levenshtein distance distance-measure jaro-winkler similarity-measures shingles algorithm jvm

go-edlib - Golang string comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc

•    Go

---

Golang string comparison and edit distance algorithms library featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...

unicode algorithms edit-distance levenshtein jaro-winkler levenshtein-distance similarity-measures string-distance cosine string-matching damerau-levenshtein lcs lcs-distance hamming string-comparison golang-string-comparison edit-distance-algorithms

StringDistances.jl - String Distances

•    Julia

---

The function compare returns a similarity score between two strings. The function always returns a score between 0 and 1, with a value of 0 being completely different and a value of 1 being completely similar. Q-gram distances compare the set of all substrings of length q in each string.

string-distance levenshtein-distance similarity-score edit-distances winkler qgram-distance fuzzywuzzy

stringosim - String similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity

•    Go

---

The plan for this package is to have Go implementation of different string distance/similarity functions, like Levenshtein (normalized, weighted, Damerau), Jaro-Winkler, Jaccard index, Euclidean distance, Hamming distance... Work in progress...

jaro-winkler cosine-distance jaccard levenshtein string-distance comparison jaro-distance distance

affinegap - :triangular_ruler: A Cython implementation of the affine gap string distance

•    Python

---

Help us fix the problem as quickly as possible by following Mozilla's guidelines for reporting bugs. Copyright (c) 2016 Forest Gregg and Dedupeio. Released under the MIT License.

string-distance levenshtein-distance cython

cadmium - Natural Language Processing (NLP) library for Crystal

•    Crystal

---

Cadmium is a Natrual Language Processing (NLP) library for Crystal. Included are classes and modules for tokenizing, inflecting, stemming, and creating n-grams with much more to come. It's still in early development, but tests are being written as I go so hopefully it will be somewhat stable.

string-distance stemmer inflector sentiment-analysis phonetics transliterator nlp tf-idf

levenshtein - Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix

•    Go

---

This package implements distance and similarity metrics for strings, based on the Levenshtein measure, in Go. v1.2.1 Stable: Guaranteed no breaking changes to the API in future v1.x releases. Probably safe to use in production, though provided on "AS IS" basis.

levenshtein levenshtein-distance similarity-metric common-prefix-bonus winkler string-pairs string-distance string-similarity edit-costs awesome-go

Quickenshtein - Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support

•    CSharp

---

Quickenshtein gets its speed and memory efficiency from a number of different optimizations. To get the most performance out of the library, you will need .NET Core 3 or higher as this has support for hardware intrinsics. Quickenshtein takes advantage of the following hardware intrinsics. On any recent x86 system, you will likely have these available.

edit-distance simd levenshtein levenshtein-distance threading string-distance hardware-intrinsics

strutil - Golang metrics for calculating string similarity and other string utility functions

•    Go

---

strutil provides string metrics for calculating string similarity as well as other string utility functions. Full documentation can be found at: https://pkg.go.dev/github.com/adrg/strutil. The package defines the StringMetric interface, which is implemented by all the string metrics. The interface is used with the Similarity function, which calculates the similarity between the specified strings, using the provided string metric.

string smith-waterman levenshtein jaro-winkler string-metrics string-distance jaccard-similarity jaccard string-matching string-similarity hamming-distance jaro n-gram jaccard-index overlap-coefficient dice-coefficient smith-waterman-gotoh sorensen-dice n-gram-intersection strutil

TySug - A project around helping to prevent typing typos

•    Go

---

TySug is collection of packages, together they form a keyboard layout aware alternative word suggester. It can be used as both a library and a webservice. The primary supported use-case is to help with spelling mistakes against short popular word lists (e.g. domain names). Which is useful in helping to prevent typos in e.g. e-mail addresses, detect spam, phishing (Typosquatting), etc.

docker toml keyboard cors webservice library algorithm keyboard-layout typing jaro-winkler words typo string-distance suggestions spelling-errors jaro