Golang : Levenshtein distance example

Continue from previous tutorial on fuzzy string search. This is a short example on Levenshtein distance with https://github.com/renstrom/fuzzysearch package. If you ever need to build a parser to parse natural language - Levenshtein distance will be handy. It also helps in spell checkers, correction systems for optical character recognition, and software to assist natural language translation.

Here you go!

 package main

 import (
 "fmt"
 "github.com/renstrom/fuzzysearch/fuzzy"
 )

 func main() {

 input := []string{"example", "help", "assistance", "existence"}

 rankMatches := fuzzy.RankFind("ex", input)

 for _, rank := range rankMatches {
 fmt.Println("Source : ", rank.Source, " Word :", rank.Target, " Distance : ", rank.Distance)
 }

 }

References :

https://en.wikipedia.org/wiki/Levenshtein_distance

https://github.com/renstrom/fuzzysearch