Levenshtein distance of two text files
-
Updated
Jan 19, 2023 - Go
Levenshtein distance of two text files
🤖 Messenger chatbot using the Levenshtein distance algorithm for pattern matching. Easily configurable with yaml files. Use mux and yaml.v2.
A clean golang calculator for Leveshtein Distance (using the techniques of Clean Code).
Levenshtein algorithm with zero dependencies
Go calculate Levenshtein Distance.
Levenshtein implementation for Golang
levenstein string distance
🎯 Levenshtein distance implemented in Go
fast weighted levenshtein distance library in Golang
Levenshtein based and phrase accepting phonetic algorithm written in Golang.
Levenshtein implements the Levenshtein (edit distance and diff) algorithm for golang
Calcualte levenshtein distance with golang
Detect plagiarism of Github repositories in someone else's code
This repo has been migrated to https://code.larus.se/lmas/Damerau-Levenshtein
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
String similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity...
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."