The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
Javascript implementation of the L-diggity.
Efficient Javascript implementation of Levenshtein algorithm with locale-specific collator support.
Go implementation to calculate Levenshtein Distance.
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Fast string edit distance computation, using the Damerau-Levenshtein algorithm.
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
The fastest implementation of Levenshtein distance in JS/TS.
pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
Fast implementation of the edit distance(Levenshtein distance)
Fastest levenshtein implementation in Go.
翻译 - Go中最快的levenshtein实现。
Calculates edit distance using Damerau-Levenshtein algorithm
Similarity or Distance Metrics, e.g. Levenshtein, for Java
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🦭
Category on NSString that calculates the Damerau-Levenshtein distance
Lightweight, super fast C/C++ (& Python) library for sequence alignment using edit (Levenshtein) distance.
An implementation of the Levenshtein algorithm in Go. Provides edit distances and edit scripts.
Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
翻译 - 根据Dice系数找出两个字符串之间的相似度，该相似度通常比Levenshtein距离更好。
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support