Find the n-closests matches of a term within any whitespace-separated wordlist

Just another Damerau Levenshtein distance implementation, made in TypeScript

Spell checking using Damerau–Levenshtein distance

String Similarity Algorithms

Damerau–Levenshtein distance is a string metric for measuring the edit distance between two sequences. Informally, the Damerau–Levenshtein distance between two words is the minimum number of operations (consisting of insertions, deletions or substitutions of a single character, or transposition of two adjacent characters) required to change one …

Yeah it's GPL

Unordered collection of c++ pieces of code

Spell checker in C based on bk-tree and levenshtein distance

AntiPlagiat for Tinkoff '23

edit distance algos: levenshtien, damerau, and hamming code

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.

A set of assorted helper functions, extensions and classes in .NET Standard

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.

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

🧸 Tiny optimal string alignment distance library

Comparison of a few algorithms for computing Damerau–Levenshtein distance