Data Structures and Algorithms / Text Analysis

10 packages

Packages (10)

bleve

Modern text indexing library for go.

11,022 701

trie

Trie implementation in Go.

789 115

go-edlib

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

597 28

levenshtein

Implementation to calculate levenshtein distance in Go.

468 29

levenshtein

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

90 8

ptrie

An implementation of prefix tree.

46 11

radixtree

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

39 8

mspm

Multi-String Pattern Matching Algorithm for information retrieval.

28 4

parsefields

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

7 1