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