Algorithm will measure the minimum number of single-character edits (insertions, deletions or substitutions) required to change one word into the other resulting in integer weight of strings "simmilarity".
Increasing fidelity of search algorithms, e.g if I search for "Mony Lawndaring", and I want system to bring back results for "Money Laundering".
import "github.com/jancajthaml-go/levenstein"
levenstein.Distance("aba", "bba")
- 48 B/op
- 1 allocs/op
verify your performance by running make benchmark