📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
-
Updated
Jul 16, 2024 - Python
📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
🦀📏 Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support.
An efficient data structure for fast string similarity searches
Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.
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
String.Search is a simple library to implement a full text search with given patterns.
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 hydration/dehydration in-browser and server-side.
Comparison of a few algorithms for computing Damerau–Levenshtein distance
A simple NodeJS (NPM) module for weighted Damerau–Levenshtein distance.
🧸 Tiny optimal string alignment distance library
A parameterizable Damerau Levenshtein aligner in Java.
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 to create diff tools.
AntiPlagiat for Tinkoff '23
edit distance algos: levenshtien, damerau, and hamming code
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.
Calculate the Damerau–Levenshtein distance between strings.
Add a description, image, and links to the damerau-levenshtein-distance topic page so that developers can more easily learn about it.
To associate your repository with the damerau-levenshtein-distance topic, visit your repo's landing page and select "manage topics."