📚 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...
A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.
String metrics function in golang (levenshtein, damerau-levenshtein, jaro, jaro-winkler and additionally bk-tree) for autocorrect
Weighted Leveshtein Distance and its extended interfaces written in Go.
go 语言文本算法, 编辑距离, kmp 和 ac 自动机
Implementations for the Levenshtein Distance algorithm.
Add a description, image, and links to the edit-distance topic page so that developers can more easily learn about it.
To associate your repository with the edit-distance topic, visit your repo's landing page and select "manage topics."