The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
Javascript implementation of the L-diggity.
Go implementation to calculate Levenshtein Distance.
Efficient Javascript implementation of Levenshtein algorithm with locale-specific collator support.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
Fast string edit distance computation, using the Damerau-Levenshtein algorithm.
The fastest implementation of Levenshtein distance in JS/TS.
Fast implementation of the edit distance(Levenshtein distance)
pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
Weighted Levenshtein library
Fastest levenshtein implementation in Go.
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
Calculates edit distance using Damerau-Levenshtein algorithm
Similarity or Distance Metrics, e.g. Levenshtein, for Java
#算法刷题#📚 String comparison and edit distance algorithms library, featuring : Levenshtein, LCS, Hamming, Damerau levenshtein (OSA and Adjacent transpositions algorithms), Jaro-Winkler, Cosine, etc...
#算法刷题#Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.
Rapid fuzzy string matching in C++ using the Levenshtein Distance
General Levenshtein algorithm and k-bounded Levenshtein distance in linear time and constant space. Implementation in C as UDFs for MySQL🐬 and MariaDB🦭
🎯 String metrics and phonetic algorithms for Scala (e.g. Dice/Sorensen, Hamming, Jaccard, Jaro, Jaro-Winkler, Levenshtein, Metaphone, N-Gram, NYSIIS, Overlap, Ratcliff/Obershelp, Refined NYSIIS, ...