levenshtein
Go implementation to calculate Levenshtein Distance. (by agnivade)
willf/bloom
Go package implementing Bloom filters, used by many important systems (by willf)
| levenshtein | willf/bloom | |
|---|---|---|
| 2 | 3 | |
| 470 | 2,786 | |
| 0.6% | 0.6% | |
| 3.2 | 4.9 | |
| 3 months ago | 3 days ago | |
| Go | Go | |
| MIT License | BSD 2-clause "Simplified" 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.
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
willf/bloom
Posts with mentions or reviews of willf/bloom.
We have used some of these posts to build our list of alternatives
and similar projects. The last one was on 2025-09-12.
-
I Built a Bloom Filter Data Structure Simulator
bits and blooms (go)
-
willf/bloom VS bloom_cpp - a user suggested alternative
2 projects | 17 Mar 2023
-
There are 87 bloom filter crates. Strategies for choosing one?
I also have a lot of sympathy for the casual user that has a bloom-filter-shaped hole in their program that all of these filters will fill, and having reduced this part of their task to a well-known solved problem, just want to plug in a random thing & move on, with the possibility of revisiting the selection later if bloomfiltering shows up in the profiler.
What are some alternatives?
When comparing levenshtein and willf/bloom you can also consider the following projects:
gods - GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
go-adaptive-radix-tree - Adaptive Radix Trees implemented in Go
ttlcache - An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
mafsa
go-geoindex - Go native library for fast point tracking and K-Nearest queries
blooming-bella - A simple implementation of Bloom Filters using murmur3, Super Fast Hash and marvin32 hashing algorithms.