API for name similarity check
-
Updated
Oct 6, 2023 - Go
API for name similarity check
Levenshtein distance of two text files
Levenshtein algorithm with zero dependencies
Go calculate Levenshtein Distance.
This is a Go package that provides a function to calculate the Levenshtein distance between two strings. The Levenshtein distance is a measure of the difference between two strings, defined as the minimum number of single-character edits (insertions, deletions, or substitutions) required to transform one string into the other.
Helps finding the same or very similar file names in a directory.
A fuzzy match library exposed by rest endpoint written in GoLang
Calcualte levenshtein distance with golang
levenstein string distance
fast weighted levenshtein distance library in Golang
Levenshtein implementation for Golang
Go fuzzy matching tool using Levenshtein distance calculation
Fuzzster - fuzzy matching web application
String metrics libary for Go lang. (e.g. Dice/Sorensen, Hamming, Jaro, Jaro-Winkler, Levenshtein)
🎯 Levenshtein distance implemented in Go
Fast string metric algorithms written in go
In-memory fuzzy search library on strings as measured by a Levenshtein edit distance.
Add a description, image, and links to the levenshtein-distance topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein-distance topic, visit your repo's landing page and select "manage topics."