Awesome Go
456
Stars
30
Forks
MIT
License
Go
Language
2025-05-19
Last Update
4
Open Issues
golang
levenshtein
levenshtein-distance
Related in Text Analysis
- bleve - Modern text indexing library for go.
- go-adaptive-radix-tree - Go implementation of Adaptive Radix Tree.
- go-edlib - Go string comparison and edit distance algorithms library (Levenshtein, LCS, Hamming, Damerau levenshtein, Jaro-Winkler, etc.) compatible with Unicode.
- levenshtein - Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
- mspm - Multi-String Pattern Matching Algorithm for information retrieval.
- parsefields - Tools for parse JSON-like logs for collecting unique fields and events.
- ptrie - An implementation of prefix tree.
- trie - Trie implementation in Go.
- graphlib - Topological sort lib,Sorting and pruning of DAG graphs.
- hashsplit - Split byte streams into chunks, and arrange chunks into trees, with boundaries determined by content, not position.