levenshtein
levenshtein
| levenshtein | levenshtein | |
|---|---|---|
| 2 | 1 | |
| 319 | 9 | |
| - | - | |
| 0.0 | 0.0 | |
| about 1 year ago | over 1 year ago | |
| Go | HTML | |
| MIT License | MIT License |
Stars - the number of stars that a project has on GitHub. Growth - month over month growth in stars.
Activity is a relative number indicating how actively a project is being developed. Recent commits have higher weight than older ones.
For example, an activity of 9.0 indicates that a project is amongst the top 10% of the most actively developed projects that we are tracking.
levenshtein
- Levenshtein Distance
-
find the difference between two strings ?
Wow, the original post has been deleted but replying still as somebody might hear about Levenshtein distance for the first time. https://github.com/agnivade/levenshtein
levenshtein
What are some alternatives?
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
bitset - Go package implementing bitsets
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
willf/bloom - Go package implementing Bloom filters, used by Milvus and Beego.
bloom - Bloom filters implemented in Go.
go-geoindex - Go native library for fast point tracking and K-Nearest queries
conjungo - A small flexible merge library in go
cuckoofilter - Cuckoo Filter: Practically Better Than Bloom
binpacker - A binary stream packer and unpacker
gostl - Data structure and algorithm library for go, designed to provide functions similar to C++ STL
iter - Go implementation of C++ STL iterators and algorithms.