Movatterモバイル変換


[0]ホーム

URL:


Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings
#

damerau-levenshtein-distance

Here are 32 public repositories matching this topic...

📐 Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.

  • UpdatedApr 18, 2025
  • Python

🦀📏 Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support.

  • UpdatedNov 19, 2024
  • Rust
distlib

Distance related functions (Damerau-Levenshtein, Jaro-Winkler , longest common substring & subsequence) implemented as SQLite run-time loadable extension. Any UTF-8 strings are supported.

  • UpdatedSep 6, 2021
  • C

An efficient data structure for fast string similarity searches

  • UpdatedFeb 8, 2021
  • Python

Sequence clustering using k-means with dynamic time warping (DTW) and Damerau-Levenshtein distance as similarity measures

  • UpdatedAug 16, 2022
  • Python

Cython implementation of true Damerau-Levenshtein algorithm.

  • UpdatedNov 29, 2023
  • Python

NPM package that calculates synchronously or asynchronously the Damerau-Levenshtein distance between strings

  • UpdatedMar 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.

  • UpdatedJul 21, 2023
  • TypeScript

Comparison of a few algorithms for computing Damerau–Levenshtein distance

  • UpdatedSep 3, 2024
  • Shell

String.Search is a simple library to implement a full text search with given patterns.

  • UpdatedJun 5, 2020
  • C#

🧸 Tiny optimal string alignment distance library

  • UpdatedJul 7, 2025
  • Scala

A simple NodeJS (NPM) module for weighted Damerau–Levenshtein distance.

  • UpdatedDec 30, 2022
  • JavaScript

A parameterizable Damerau Levenshtein aligner in Java.

  • UpdatedJul 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.

  • UpdatedNov 7, 2021
  • C#

edit distance algos: levenshtien, damerau, and hamming code

  • UpdatedNov 29, 2021
  • Rust

Cython extension modules for Levenshtein-distance, Jaro-Winkler-distance, Damerau-Levenshtein-distance, Hamming-distance

  • UpdatedJul 31, 2022
  • Python

Calculate the Damerau–Levenshtein distance between strings.

  • UpdatedFeb 1, 2021
  • TypeScript

Raku package of fast Demerau-Levenshtein distance functions based on C code via NativeCall.

  • UpdatedSep 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.

Curate this topic

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."

Learn more


[8]ページ先頭

©2009-2025 Movatter.jp