[Golang] BK-tree Data Structure Implementation

Go implementation of BK-tree data structure used for approximate string matching in a dictionary. The distance metric here is Levenshtein distance, the minimum number of single-character edits (insertions, deletions or substitutions) required to change one string into the other.

 read more »

[Golang] Levenshtein Distance Recursive Implementation

Recursive implementation of Levenshtein distance algorithm in Go programming language. Levenshtein distance (LD) is a measure of the similarity between two strings, the minimum number of single-character edits (insertions, deletions or substitutions) required to change one string into the other.

 read more »