levenshtein

agext/levenshtein

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

  • levenshtein
  • levenshtein-distance
  • similarity-metric
  • common-prefix-bonus
  • winkler
  • string-pairs
  • string-distance
  • string-similarity

More in Text Analysis

bleveby blevesearch

Modern text indexing library for go.

github.com/blevesearch/bleve/v2Go 1.25+ 28 dependenciesv2.6.1updated 19d ago

11.2k

trieby derekparker

Trie implementation in Go.

github.com/derekparker/trie/v3Go 1.26+ No dependencies v3.2.1updated 17d ago

795

go-edlibby hbollon

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

github.com/hbollon/go-edlibGo 1.13+ No dependencies v1.7.0updated 9mo ago

607

levenshteinby agnivade

Implementation to calculate levenshtein distance in Go.

github.com/agnivade/levenshteinGo 1.21+ 2 dependenciesupdated 16d ago

481

go-adaptive-radix-treeby plar

Go implementation of Adaptive Radix Tree.

github.com/plar/go-adaptive-radix-tree/v2Go 1.18+ 1 dependencyv2.0.4updated 11mo ago

413

ptrieby viant

An implementation of prefix tree.

github.com/viant/ptrieGo 1.21+ 3 dependenciesv1.0.1updated 2y ago

46

radixtreeby gammazero

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

github.com/gammazero/radixtreeGo 1.26+ No dependencies v0.5.0updated 15d ago

41

mspmby BlackRabbitt

Multi-String Pattern Matching Algorithm for information retrieval.

updated 8y ago

29
All 10 in Text Analysis
Esc

Type to search every entry. ↑↓ to move, Enter to open.