bleve
Modern text indexing library for go.
10,949
Implementation to calculate levenshtein distance in Go.
Modern text indexing library for go.
Trie implementation in Go.
Go string comparison and edit distance algorithms library (Levenshtein, LCS, Hamming, Damerau levenshtein, Jaro-Winkler, etc.) compatible with Unicode.
Go implementation of Adaptive Radix Tree.
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.