mirror of
https://github.com/vbatts/go-mtree.git
synced 2024-11-17 14:18:39 +00:00
20 lines
687 B
Go
20 lines
687 B
Go
|
/*
|
||
|
|
Package smetrics provides a bunch of algorithms for calculating
|
||
|
|
the distance between strings.
|
||
|
|
|
||
|
|
There are implementations for calculating the popular Levenshtein
|
||
|
|
distance (aka Edit Distance or Wagner-Fischer), as well as the Jaro
|
||
|
|
distance, the Jaro-Winkler distance, and more.
|
||
|
|
|
||
|
|
For the Levenshtein distance, you can use the functions WagnerFischer()
|
||
|
|
and Ukkonen(). Read the documentation on these functions.
|
||
|
|
|
||
|
|
For the Jaro and Jaro-Winkler algorithms, check the functions
|
||
|
|
Jaro() and JaroWinkler(). Read the documentation on these functions.
|
||
|
|
|
||
|
|
For the Soundex algorithm, check the function Soundex().
|
||
|
|
|
||
|
|
For the Hamming distance algorithm, check the function Hamming().
|
||
|
|
*/
|
||
|
|
package smetrics
|