📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...

Golang library for fuzzy matching within a set of strings 📃

Go implementation to calculate Levenshtein Distance.

Go metrics for calculating string similarity and other string utility functions

Removes most frequent words (stop words) from a text content. Based on a Curated list of language statistics.

Levenshtein distance and similarity metrics with customizable edit costs and Winkler-like bonus for common prefix.

String similarity functions, String distance's, Jaccard, Levenshtein, Hamming, Jaro-Winkler, Q-grams, N-grams, LCS - Longest Common Subsequence, Cosine similarity...

Detect plagiarism of Github repositories in someone else's code

go-autocomplete-trie is a data structure for text auto completion that allows for fuzzy matching and configurable levenshtein distance limits

This repo has been migrated to https://code.larus.se/lmas/Damerau-Levenshtein

🤖 Messenger chatbot using the Levenshtein distance algorithm for pattern matching. Easily configurable with yaml files. Use mux and yaml.v2.

Levenshtein implements the Levenshtein (edit distance and diff) algorithm for golang

SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm

Levenshtein based and phrase accepting phonetic algorithm written in Golang.

🎯 Levenshtein distance implemented in Go

Fuzzy Search Algorithms

Levenshtein implementation for Golang

levenstein string distance

fast weighted levenshtein distance library in Golang

Levenshtein distance of two text files