Go implementation to calculate Levenshtein Distance.
-
Updated
Jul 1, 2024 - Go
Go implementation to calculate Levenshtein Distance.
String metrics library written in Go.
Levenshtein implementation for Golang
API for name similarity check
Removes most frequent words (stop words) from a text content. Based on a Curated list of language statistics.
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.
SPB subway simulator
A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.
go-autocomplete-trie is a data structure for text auto completion that allows for fuzzy matching and configurable levenshtein distance limits
Levenshtein distance of two text files
In-memory fuzzy search library on strings as measured by a Levenshtein edit distance.
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
Helps finding the same or very similar file names in a directory.
Port of SeatGeek's fuzzywuzzy
Fuzzster - fuzzy matching web application
Go calculate Levenshtein Distance.
Go fuzzy matching tool using Levenshtein distance calculation
levenstein string distance
fast weighted levenshtein distance library in Golang
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."