📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
-
Updated
Jul 3, 2022 - Go
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
Go implementation to calculate Levenshtein Distance.
String metrics library written in Go.
Removes most frequent words (stop words) from a text content. Based on a Curated list of language statistics.
Port of SeatGeek's fuzzywuzzy
A Trie implementation in Go meant for auto-completion use cases. Supports Levenshtein distance search.
Calculate text distance (similarity) in Golang - Experimental implementation
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
go-autocomplete-trie is a data structure for text auto completion that allows for fuzzy matching and configurable levenshtein distance limits
🤖 Messenger chatbot using the Levenshtein distance algorithm for pattern matching. Easily configurable with yaml files. Use mux and yaml.v2.
Sequence alignment algorithms
Golang quick levenstein distance measure
SPB subway simulator
In-memory fuzzy search library on strings as measured by a Levenshtein edit distance.
Weighted Leveshtein Distance and its extended interfaces written in Go.
Substring matching made easy
🎯 Levenshtein distance implemented in Go
Fast string metric algorithms written in go
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."