levenshtein

package

v1.8.21 Latest Latest Go to latest Published: May 3, 2024 License: Apache-2.0 Imports: 3 Imported by: 0

Details

Valid go.mod file

The Go module system was introduced in Go 1.11 and is the official dependency management solution for Go.
Redistributable license

Redistributable licenses place minimal restrictions on how software can be used, modified, and redistributed.
Tagged version

Modules with tagged versions give importers more predictable builds.
Stable version

When a project reaches major version v1 it is considered stable.
Learn more about best practices

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.

This section is empty.

This section is empty.

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

Distance returns the Lewenshtein distance.

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.

This section is empty.