pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
Calculates edit distance using Damerau-Levenshtein algorithm
Category on NSString that calculates the Damerau-Levenshtein distance
Fast string edit distance computation, using the Damerau-Levenshtein algorithm.
Get text similarity level with Damerau-Levenshtein distance
Damerau - Levenstein distance function for node
JavaScript implementation of the Damerau-Levenshtein edit distance algorithm
Rust edit distance routines accelerated using SIMD. Supports fast Hamming, Levenshtein, restricted Damerau-Levenshtein, etc. distance calculations and string search.
Python implementaion of optimal string alignment algorithm of SparseDamerauLevenshteinAutomaton for string fuzzy match.
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
Go implementation to calculate Levenshtein Distance.
Fastest levenshtein implementation in Go.
翻译 - Go中最快的levenshtein实现。
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
Fast implementation of the edit distance(Levenshtein distance)
Javascript implementation of the L-diggity.
Similarity or Distance Metrics, e.g. Levenshtein, for Java
The fastest implementation of Levenshtein distance in JS/TS.
Efficient Javascript implementation of Levenshtein algorithm with locale-specific collator support.
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🦭
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
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距离更好。