damerau-levenshtein-distance
Here are 32 public repositories matching this topic...
Language:All
Sort:Most stars
📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
- Updated
Apr 18, 2025 - Python
🦀📏 Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support.
- Updated
Nov 19, 2024 - Rust
Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.
- Updated
Sep 6, 2021 - C
An efficient data structure for fast string similarity searches
- Updated
Feb 8, 2021 - Python
Sequence clustering using k-means with dynamic time warping (DTW) and Damerau-Levenshtein distance as similarity measures
- Updated
Aug 16, 2022 - Python
Cython implementation of true Damerau-Levenshtein algorithm.
- Updated
Nov 29, 2023 - Python
This repo has been migrated tohttps://code.larus.se/lmas/Damerau-Levenshtein
- Updated
Jul 21, 2023 - Go
NPM package that calculates synchronously or asynchronously the Damerau-Levenshtein distance between strings
- Updated
Mar 4, 2023 - JavaScript
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.
- Updated
Jul 21, 2023 - TypeScript
Comparison of a few algorithms for computing Damerau–Levenshtein distance
- Updated
Sep 3, 2024 - Shell
String.Search is a simple library to implement a full text search with given patterns.
- Updated
Jun 5, 2020 - C#
🧸 Tiny optimal string alignment distance library
- Updated
Jul 7, 2025 - Scala
A simple NodeJS (NPM) module for weighted Damerau–Levenshtein distance.
- Updated
Dec 30, 2022 - JavaScript
A parameterizable Damerau Levenshtein aligner in Java.
- Updated
Jul 16, 2022 - 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.
- Updated
Nov 7, 2021 - C#
AntiPlagiat for Tinkoff '23
- Updated
Jan 7, 2023 - Python
edit distance algos: levenshtien, damerau, and hamming code
- Updated
Nov 29, 2021 - Rust
Cython extension modules for Levenshtein-distance, Jaro-Winkler-distance, Damerau-Levenshtein-distance, Hamming-distance
- Updated
Jul 31, 2022 - Python
Calculate the Damerau–Levenshtein distance between strings.
- Updated
Feb 1, 2021 - TypeScript
Raku package of fast Demerau-Levenshtein distance functions based on C code via NativeCall.
- Updated
Sep 11, 2024 - Raku
Improve this page
Add a description, image, and links to thedamerau-levenshtein-distance topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with thedamerau-levenshtein-distance topic, visit your repo's landing page and select "manage topics."