|author||Kilian Evang <firstname.lastname@example.org>||Sun Dec 08 22:16:05 2019|
|committer||Kilian Evang <email@example.com>||Sun Dec 08 22:16:05 2019|
Bugfix: init values in matrix depend on cost The first row/column of the Levenshtein matrix must contain the column/row indexes *multiplied by insertion/deletion cost*. This last part had been forgotten, working fine in the common case when insertion and deletion cost are 1 but breaking otherwise. Fixes #12.
An implementation of the Levenshtein algorithm in Go. Provides edit distances, edit scripts and ratios for strings (slices of runes).
$ go get github.com/texttheater/golang-levenshtein/levenshtein
The documentation can be viewed online here: https://godoc.org/github.com/texttheater/golang-levenshtein/levenshtein
For a package that is similar but more generic and provides more control, check out Daniël de Kok’s editdistance.