levenshtein

Documentation

Overview

Package levenshtein includes the levenshtein distance algorithm plus additional helper functions. The algorithm is taken from https://en.wikibooks.org/wiki/Algorithm_Implementation/Strings/Levenshtein_distance#Go.

Index

• func Distance(a, b string, caseSensitive bool) int
• func MinString[S ~[]E, E any](x S, fn func(a E) string, s string, caseSensitive bool) (rv string)

Functions

func Distance

func Distance(a, b string, caseSensitive bool) int

Distance returns the Lewenshtein distance.

func MinString

func MinString[S ~[]E, E any](x S, fn func(a E) string, s string, caseSensitive bool) (rv string)

MinString returns the string attribute determined by fn out of x with the minimal Lewenshtein distance to s.