Golang metrics for calculating string similarity and other string utility functions
-
Updated
Jun 5, 2024 - Go
Golang metrics for calculating string similarity and other string utility functions
Levenshtein implementation for Golang
Detect plagiarism of Github repositories in someone else's code
Calculate the true Damerau–Levenshtein distance of string A and B
Removes most frequent words (stop words) from a text content. Based on a Curated list of language statistics.
go-autocomplete-trie is a data structure for text auto completion that allows for fuzzy matching and configurable levenshtein distance limits
Go implementation to calculate Levenshtein Distance.
Levenshtein distance of two text files
Golang library for fuzzy matching within a set of strings 📃
📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
Go calculate Levenshtein Distance.
levenstein string distance
fast weighted levenshtein distance library in Golang
🎯 Levenshtein distance implemented in Go
Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.
🤖 Messenger chatbot using the Levenshtein distance algorithm for pattern matching. Easily configurable with yaml files. Use mux and yaml.v2.
Calcualte levenshtein distance with golang
Add a description, image, and links to the levenshtein topic page so that developers can more easily learn about it.
To associate your repository with the levenshtein topic, visit your repo's landing page and select "manage topics."