Popularity

6.0

Growing

Activity

4.8

Stars 391

Watchers 9

Forks 30

Last Commit 3 months ago

Programming language: Go

License: MIT License

Tags: Data Structures

Latest version: v1.0.3

levenshtein alternatives and similar packages

Based on the "Data Structures" category.
Alternatively, view levenshtein alternatives based on common mentions on social networks and blogs.

gods

9.8 4.7 levenshtein VS gods

GoDS (Go Data Structures) - Sets, Lists, Stacks, Maps, Trees, Queues, and much more
go-datastructures

9.4 7.3 levenshtein VS go-datastructures

A collection of useful, performant, and threadsafe Go datastructures.

InfluxDB high-performance time series database

Collect, organize, and act on massive volumes of high-resolution data to power real-time intelligent systems.

Promo influxdata.com

golang-set

8.8 4.8 levenshtein VS golang-set

A simple, battle-tested and generic set type for the Go language. Trusted by Docker, 1Password, Ethereum and Hashicorp.
gota

8.6 0.0 levenshtein VS gota

Gota: DataFrames and data wrangling in Go (Golang)
FSM for Go

8.5 2.9 levenshtein VS FSM for Go

Finite State Machine for Go
roaring

8.4 8.3 levenshtein VS roaring

Roaring bitmaps in Go (golang), used by InfluxDB, Bleve, DataDog
gocache

8.3 6.8 levenshtein VS gocache

☔️ A complete Go cache library that brings you multiple ways of managing your caches
willf/bloom

8.3 4.1 levenshtein VS willf/bloom

Go package implementing Bloom filters, used by Milvus and Beego.
boomfilters

7.8 0.0 levenshtein VS boomfilters

Probabilistic data structures for processing continuous, unbounded streams.
bitset

7.7 8.2 levenshtein VS bitset

Go package implementing bitsets
cuckoofilter

7.4 2.1 levenshtein VS cuckoofilter

Cuckoo Filter: Practically Better Than Bloom
gostl

7.4 4.7 levenshtein VS gostl

Data structure and algorithm library for go, designed to provide functions similar to C++ STL
hyperloglog

7.2 7.1 levenshtein VS hyperloglog

HyperLogLog with lots of sugar (Sparse, LogLog-Beta bias correction and TailCut space reduction) brought to you by Axiom
algorithms

7.1 0.0 levenshtein VS algorithms

CLRS study. Codes are written with golang.
trie

7.0 4.3 levenshtein VS trie

Data structure and relevant algorithms for extremely fast prefix/fuzzy string searching.
merkletree

6.7 0.0 levenshtein VS merkletree

A Merkle Tree implementation written in Go.
ttlcache

6.5 6.4 levenshtein VS ttlcache

DISCONTINUED. An in-memory cache with item expiration and generics [Moved to: https://github.com/jellydator/ttlcache]
go-geoindex

6.4 0.0 levenshtein VS go-geoindex

Go native library for fast point tracking and K-Nearest queries
go-adaptive-radix-tree

6.1 7.2 levenshtein VS go-adaptive-radix-tree

Adaptive Radix Trees implemented in Go
goconcurrentqueue

6.1 0.0 levenshtein VS goconcurrentqueue

Go concurrent-safe, goroutine-safe, thread-safe queue
conjungo

6.0 1.3 levenshtein VS conjungo

DISCONTINUED. A small flexible merge library in go
mafsa

6.0 0.0 levenshtein VS mafsa

DISCONTINUED. MA-FSA implementation with Minimal Perfect Hashing
Bloomfilter

6.0 0.0 levenshtein VS Bloomfilter

DISCONTINUED. Face-meltingly fast, thread-safe, marshalable, unionable, probability- and optimal-size-calculating Bloom filter in go
hilbert

5.9 0.0 levenshtein VS hilbert

DISCONTINUED. Go package for mapping values to and from space-filling curves, such as Hilbert and Peano curves.
goskiplist

5.7 0.0 levenshtein VS goskiplist

A skip list implementation in Go
cuckoo-filter

5.6 0.0 levenshtein VS cuckoo-filter

Cuckoo Filter go implement, better than Bloom Filter, configurable and space optimized 布谷鸟过滤器的Go实现，优于布隆过滤器，可以定制化过滤器参数，并进行了空间优化
bitmap

5.6 4.3 levenshtein VS bitmap

Simple dense bitmap index in Go with binary operators
binpacker

5.4 0.0 levenshtein VS binpacker

A binary stream packer and unpacker
bit

5.0 0.0 levenshtein VS bit

Bitset data structure
iter

4.9 0.0 levenshtein VS iter

Go implementation of C++ STL iterators and algorithms.
deque

4.8 3.4 levenshtein VS deque

A highly optimized double-ended queue
bloom

4.7 0.0 levenshtein VS bloom

Bloom filters implemented in Go.
remember-go

4.5 0.0 levenshtein VS remember-go

Cache Slow Database Queries
encoding

4.5 0.0 levenshtein VS encoding

Integer Compression Libraries for Go
go-rquad

4.4 0.0 levenshtein VS go-rquad

:pushpin: State of the art point location and neighbour finding algorithms for region quadtrees, in Go
ring

4.4 0.0 levenshtein VS ring

Package ring provides a high performance and thread safe Go implementation of a bloom filter.
memlog

4.2 5.2 levenshtein VS memlog

A Kafka log inspired in-memory and append-only data structure
skiplist

4.2 0.0 levenshtein VS skiplist

skiplist for golang
go-mcache

4.1 0.0 levenshtein VS go-mcache

Fast in-memory key:value store/cache with TTL
crunch

4.0 0.0 levenshtein VS crunch

take bytes out of things easily ✨🍪
cmap

3.8 3.7 levenshtein VS cmap

a thread-safe concurrent map for go
nan

3.8 3.0 levenshtein VS nan

Zero allocation Nullable structures in one library with handy conversion functions, marshallers and unmarshallers
set

3.7 0.0 levenshtein VS set

A simple Set data structure implementation in Go (Golang) using LinkedHashMap.
timedmap

3.5 6.2 levenshtein VS timedmap

A thread safe map which has expiring key-value pairs.
go-tuple

3.5 3.2 levenshtein VS go-tuple

Go 1.18+ generic tuple
hide

3.4 0.0 levenshtein VS hide

A Go type to prevent internal numeric IDs from being exposed to clients using HashIDs and JSON.
goset

3.3 0.0 levenshtein VS goset

Set is a useful collection but there is no built-in implementation in Go lang.
ptrie

3.2 4.5 levenshtein VS ptrie

A prefix tree implementation in go
count-min-log

3.2 2.1 levenshtein VS count-min-log

Go implementation of Count-Min-Log
treemap

3.2 1.8 levenshtein VS treemap

Generic sorted map for Go with red-black tree under the hood

Do you think we are missing an alternative of levenshtein or a related project?

Add another 'Data Structures' Package

Popular Comparisons

README

levenshtein

Go package to calculate the Levenshtein Distance

The library is fully capable of working with non-ascii strings. But the strings are not normalized. That is left as a user-dependant use case. Please normalize the strings before passing it to the library if you have such a requirement.

https://blog.golang.org/normalization

Limitation

As a performance optimization, the library can handle strings only up to 65536 characters (runes). If you need to handle strings larger than that, please pin to version 1.0.3.

Install

go get github.com/agnivade/levenshtein

Example

package main

import (
    "fmt"
    "github.com/agnivade/levenshtein"
)

func main() {
    s1 := "kitten"
    s2 := "sitting"
    distance := levenshtein.ComputeDistance(s1, s2)
    fmt.Printf("The distance between %s and %s is %d.\n", s1, s2, distance)
    // Output:
    // The distance between kitten and sitting is 3.
}

Benchmarks

name              time/op
Simple/ASCII-4     330ns ± 2%
Simple/French-4    617ns ± 2%
Simple/Nordic-4   1.16µs ± 4%
Simple/Tibetan-4  1.05µs ± 1%

name              alloc/op
Simple/ASCII-4     96.0B ± 0%
Simple/French-4     128B ± 0%
Simple/Nordic-4     192B ± 0%
Simple/Tibetan-4    144B ± 0%

name              allocs/op
Simple/ASCII-4      1.00 ± 0%
Simple/French-4     1.00 ± 0%
Simple/Nordic-4     1.00 ± 0%
Simple/Tibetan-4    1.00 ± 0%

Comparisons with other libraries

name                     time/op
Leven/ASCII/agniva-4      353ns ± 1%
Leven/ASCII/arbovm-4      485ns ± 1%
Leven/ASCII/dgryski-4     395ns ± 0%
Leven/French/agniva-4     648ns ± 1%
Leven/French/arbovm-4     791ns ± 0%
Leven/French/dgryski-4    682ns ± 0%
Leven/Nordic/agniva-4    1.28µs ± 1%
Leven/Nordic/arbovm-4    1.52µs ± 1%
Leven/Nordic/dgryski-4   1.32µs ± 1%
Leven/Tibetan/agniva-4   1.12µs ± 1%
Leven/Tibetan/arbovm-4   1.31µs ± 0%
Leven/Tibetan/dgryski-4  1.16µs ± 0%