Fast implementation of the edit distance(Levenshtein distance)
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
Similarity or Distance Metrics, e.g. Levenshtein, for Java
Go implementation to calculate Levenshtein Distance.
Lightweight, super fast C/C++ (& Python) library for sequence alignment using edit (Levenshtein) distance.
The fastest implementation of Levenshtein distance in JS/TS.
Rapid fuzzy string matching in C++ using the Levenshtein Distance
Finds degree of similarity between two strings, based on Dice's Coefficient, which is mostly better than Levenshtein distance.
翻译 - 根据Dice系数找出两个字符串之间的相似度，该相似度通常比Levenshtein距离更好。
Calculates edit distance using Damerau-Levenshtein algorithm
The Levenshtein Python C extension module contains functions for fast computation of Levenshtein distance and string similarity
Category on NSString that calculates the Damerau-Levenshtein distance
The most efficient JS implementation calculating the Levenshtein distance, i.e. the difference between two strings.
Making the quickest and most memory efficient implementation of Levenshtein Distance with SIMD and Threading support
General Levenshtein algorithm and k-bounded Levenshtein distance in linear time and constant space. Implementation in C as UDFs for MySQL🐬 and MariaDB🦭
pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
#算法刷题#A Trie implementation in Golang meant for auto-completion use cases. Supports Levenshtein distance search.
Find a needle (a document or record) in a haystack using string similarity and (optionally) regular expression rules. Uses Dice's Coefficient (aka Pair Similiarity) and Levenshtein Distance internally...