Text Analysis

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

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

An implementation of prefix tree

Adaptive radix tree (prefix-tree or compact-trie)

Multi-String Pattern Matching Algorithm for information retrieval

Tools for parse JSON-like logs for collecting unique fields and events