📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
-
Updated
Jul 3, 2022 - Go
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
Go metrics for calculating string similarity and other string utility functions
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
String similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity...
Beda is a golang library for detecting how similar a two string
A project around helping to prevent typing typos. TySug (Typo Suggestions) suggests alternative words with respect to keyboard layouts
This repository is a mirror. Do not post issues or PRs here.
levenstein string distance
compute the Levenshtein distance between two strings in Go
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."