dvirsky / levenshteinLinks
sparse levenshtein automaton in go
☆24Updated 5 years ago
Alternatives and similar repositories for levenshtein
Users that are interested in levenshtein are comparing it to the libraries listed below
Sorting:
- Package mafsa implements Minimal Acyclic Finite State Automata in Go, essentially a high-speed, memory-efficient, Unicode-friendly set of…☆295Updated 6 years ago
- High Performance Porter2 Stemmer☆47Updated 5 years ago
- Cluster analysis library for Golang☆94Updated 5 years ago
- Ngram index for golang☆114Updated 9 years ago
- Bloom-filter based search index☆125Updated 3 years ago
- Go translation of MetroHash☆113Updated 9 months ago
- package lingo provides the data structures and algorithms required for natural language processing☆158Updated 2 years ago
- A Go library for performing Unicode Text Segmentation as described in Unicode Standard Annex #29☆88Updated 2 years ago
- Fast integer map for uint32-to-uint32☆32Updated 3 months ago
- A radix sorting library for Go (golang)☆53Updated 2 years ago
- Bleve Extensions☆46Updated last year
- P-Square Algorithm in Go☆36Updated 3 years ago
- dmmclust is a package for clustering short texts, based on Yin and Wang (2014)☆26Updated 7 years ago
- Minimal Perfect Hashing for Go☆190Updated last year
- Directed Acyclic Word Graph implementation in Go, with fuzzy search of words in the graph.☆31Updated 11 years ago
- Fast Longest Common Substring in Go☆47Updated 9 months ago
- shoco is a compressor for small text strings. [Not maintained].