📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
damerau-levenshtein-distance 开源项目推荐(30 个)
damerau-levenshtein-distance 话题在 GitHub 上没有填写简介,这里按 Star 数汇总最相关的热门仓库。
热门项目 前 20
按 Star 数排序展示前 20 个 · GitHub 共 30 个仓库用于比较字符串(或任意序列)的 Rust 库。25+ 种算法,纯 Rust,通用接口,支持 Unicode。
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.
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 hydration/dehydration in-browser and server-side.
This repo has been migrated to https://code.larus.se/lmas/Damerau-Levenshtein
Comparison of a few algorithms for computing Damerau–Levenshtein distance
String.Search is a simple library to implement a full text search with given patterns.
🧸 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 to create diff tools.
A parameterizable Damerau Levenshtein aligner in Java.
A set of assorted helper functions, extensions and classes in .NET Standard
Keyboard‑aware Damerau‑Levenshtein for .NET: detects real typos using key proximity and finds the best match fast.
Cython extension modules for Levenshtein-distance, Jaro-Winkler-distance, Damerau-Levenshtein-distance, Hamming-distance
AntiPlagiat for Tinkoff '23
edit distance algos: levenshtien, damerau, and hamming code
Calculate the Damerau–Levenshtein distance between strings.
关于这个话题
- 清单取自 GitHub 话题页并按 Star 数排序,每次展示前 20 个项目;原始页面见 https://github.com/topics/damerau-levenshtein-distance。
- 该话题在 GitHub 上共有 30 个仓库, 本站收录的是其中最热门的 20 个,不是全量列表。
- Star / Fork 每日自动刷新一次,实时数据以 GitHub 为准。
- 当前 20 个项目累计 3982 Star,覆盖 10 种主要语言,数据更新于 2026-11-09。
- 中文介绍来自 GitHub 官方话题说明(github/explore)的机器翻译,可点「查看原文」对照;译文缺失时会先展示原文。