#算法刷题#📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
翻译 - 计算序列之间的距离。 30+算法，纯python实现，通用接口，可选的外部库使用。
🦀📏 Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support.
Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.
An efficient data structure for fast string similarity searches
Sequence clustering using k-means with dynamic time warping (DTW) and Damerau-Levenshtein distance as similarity measures
Cython implementation of true Damerau-Levenshtein algorithm.
This repo has been migrated to https://code.larus.se/lmas/Damerau-Levenshtein
NPM package that calculates synchronously or asynchronously the Damerau-Levenshtein distance between strings
#搜索#A highly efficient, isomorphic, full-featured, multilingual text search engine library, providing full-text search, fuzzy matching, phonetic scoring, document indexing and more, with micro JSON state ...
String.Search is a simple library to implement a full text search with given patterns.
Comparison of a few algorithms for computing Damerau–Levenshtein distance
🧸 Tiny optimal string alignment distance library
A simple NodeJS (NPM) module for weighted Damerau–Levenshtein distance.
IEnumerableCorrelater knows to compare two IEnumerables or strings. It returns the distance between them, and returns two arrays which represent their "best match". IEnumerableCorrelater can be used t...
A parameterizable Damerau Levenshtein aligner in Java.
edit distance algos: levenshtien, damerau, and hamming code
AntiPlagiat for Tinkoff '23
Calculate the Damerau–Levenshtein distance between strings.
Cython extension modules for Levenshtein-distance, Jaro-Winkler-distance, Damerau-Levenshtein-distance, Hamming-distance
#自然语言处理#This repository implements a brute-force spellchecker utilizing the Damerau-Levenshtein edit distance.