Ecosyste.ms: Awesome
An open API service indexing awesome lists of open source software.
https://github.com/agnivade/levenshtein
Go implementation to calculate Levenshtein Distance.
https://github.com/agnivade/levenshtein
golang levenshtein levenshtein-distance
Last synced: 6 days ago
JSON representation
Go implementation to calculate Levenshtein Distance.
- Host: GitHub
- URL: https://github.com/agnivade/levenshtein
- Owner: agnivade
- License: mit
- Created: 2014-07-30T14:03:55.000Z (over 10 years ago)
- Default Branch: master
- Last Pushed: 2024-09-24T15:27:23.000Z (about 1 month ago)
- Last Synced: 2024-10-29T19:59:43.303Z (6 days ago)
- Topics: golang, levenshtein, levenshtein-distance
- Language: Go
- Homepage:
- Size: 2.53 MB
- Stars: 356
- Watchers: 9
- Forks: 28
- Open Issues: 3
-
Metadata Files:
- Readme: README.md
- License: License.txt
Awesome Lists containing this project
- awesome-go - levenshtein - Implementation to calculate levenshtein distance in Go. (Data Structures and Algorithms / Text Analysis)
- awesome-go - levenshtein - Implementation to calculate levenshtein distance in Go. (Data Structures and Algorithms / Text Analysis)
- awesome-go - levenshtein - Go implementation to calculate Levenshtein Distance. - ★ 33 (Data Structures)
- awesome-go-extra - levenshtein - 07-30T14:03:55Z|2022-08-08T05:44:58Z| (Generators / Text Analysis)
- Awesome-Korean-Speech-Recognition - Go levenshitein
README
levenshtein  [](https://goreportcard.com/report/github.com/agnivade/levenshtein) [](https://pkg.go.dev/github.com/agnivade/levenshtein)
===========
[Go](http://golang.org) package to calculate the [Levenshtein Distance](http://en.wikipedia.org/wiki/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
-------
```go
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%
```