Golang · Text Analysis

Text Analysis

• blevesearch/bleve on GitHub, opens in a new tab

  11.2Kstars

  Modern text indexing library for go.

  Go·Apache License 2.0·active·4 days ago

• derekparker/trie on GitHub, opens in a new tab

  790stars

  Trie implementation in Go.

  Go·MIT License·active·3 weeks ago

• hbollon/go-edlib on GitHub, opens in a new tab

  604stars

  Go string comparison and edit distance algorithms library (Levenshtein, LCS, Hamming, Damerau levenshtein, Jaro-Winkler, etc.) compatible with Unicode.

  Go·MIT License·steady·6 months ago

• agnivade/levenshtein on GitHub, opens in a new tab

  473stars

  Implementation to calculate levenshtein distance in Go.

  Go·MIT License·steady·6 months ago

• plar/go-adaptive-radix-tree on GitHub, opens in a new tab

  412stars

  Go implementation of Adaptive Radix Tree.

  Go·MIT License·steady·9 months ago

• agext/levenshtein on GitHub, opens in a new tab

  92stars

  Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.

  Go·Apache License 2.0·dormant·6 years ago

• viant/ptrie on GitHub, opens in a new tab

  46stars

  An implementation of prefix tree.

  Go·Apache License 2.0·slowing·2 years ago

• gammazero/radixtree on GitHub, opens in a new tab

  41stars

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

  Go·MIT License·active·2 months ago

• BlackRabbitt/mspm on GitHub, opens in a new tab

  29stars

  Multi-String Pattern Matching Algorithm for information retrieval.

  Go·BSD 3-Clause "New" or "Revised" License·dormant·8 years ago

• MonaxGT/parsefields on GitHub, opens in a new tab

  9stars

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

  Go·Apache License 2.0·dormant·7 years ago