hilbert
Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves. (by google)
levenshtein
Go implementation to calculate Levenshtein Distance. (by agnivade)
| hilbert | levenshtein | |
|---|---|---|
| - | 2 | |
| 274 | 371 | |
| - | 2.2% | |
| 0.0 | 5.1 | |
| over 2 years ago | about 1 month ago | |
| Go | Go | |
| Apache License 2.0 | MIT License |
The number of mentions indicates the total number of mentions that we've tracked plus the number of user suggested alternatives.
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.
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.
hilbert
Posts with mentions or reviews of hilbert.
We have used some of these posts to build our list of alternatives
and similar projects.
We haven't tracked posts mentioning hilbert yet.
Tracking mentions began in Dec 2020.
levenshtein
Posts with mentions or reviews of levenshtein.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2022-04-07.
- 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
What are some alternatives?
When comparing hilbert and levenshtein you can also consider the following projects:
willf/bloom - Go package implementing Bloom filters, used by Milvus and Beego.
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
encoding - Integer Compression Libraries for Go
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
bit - Bitset data structure
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
algorithms - CLRS study. Codes are written with golang.
count-min-log - Go implementation of Count-Min-Log
bloom - Bloom filters implemented in Go.
go-geoindex - Go native library for fast point tracking and K-Nearest queries