https://github.com/eskriett/strmet
Fast string metric algorithms written in go
https://github.com/eskriett/strmet
damerau-levenshtein go golang levenshtein-distance string-metrics
Last synced: 11 months ago
JSON representation
Fast string metric algorithms written in go
- Host: GitHub
- URL: https://github.com/eskriett/strmet
- Owner: eskriett
- License: mit
- Created: 2019-02-02T20:40:04.000Z (over 7 years ago)
- Default Branch: master
- Last Pushed: 2020-01-26T10:42:47.000Z (over 6 years ago)
- Last Synced: 2025-02-03T14:50:14.568Z (over 1 year ago)
- Topics: damerau-levenshtein, go, golang, levenshtein-distance, string-metrics
- Language: Go
- Size: 14.6 KB
- Stars: 2
- Watchers: 1
- Forks: 1
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
- License: LICENSE
Awesome Lists containing this project
README
# strmet
[](https://godoc.org/github.com/eskriett/strmet)
[](https://travis-ci.org/eskriett/strmet)
[](https://goreportcard.com/report/github.com/eskriett/strmet)
Fast and memory efficient string metric algorithms.
Available algorithms:
* [Levenshtein distance](https://en.wikipedia.org/wiki/Levenshtein_distance)
* [Damerau–Levenshtein distance](https://en.wikipedia.org/wiki/Damerau%E2%80%93Levenshtein_distance)
## Example
```go
package main
import (
"fmt"
"github.com/eskriett/strmet"
)
func main() {
s1 := "baseball"
s2 := "football"
fmt.Printf("The Levenshtein distance between %s and %s is %d\n",
s1, s2, strmet.Levenshtein(s1, s2, 10))
// -> The Levenshtein distance between baseball and football is 4
s1 = "salt"
s2 = "slat"
fmt.Printf("The Damerau–Levenshtein distance between %s and %s is %d\n",
s1, s2, strmet.DamerauLevenshtein(s1, s2, 10))
// -> The Damerau–Levenshtein distance between salt and slat is 1
}
```