There are 3 repositories under damerau-levenshtein topic.
đ Compute distance between sequences. 30+ algorithms, pure python implementation, common interface, optional external libs usage.
Implementation of various string similarity and distance algorithms: Levenshtein, Jaro-winkler, n-Gram, Q-Gram, Jaccard index, Longest Common Subsequence edit distance, cosine similarity ...
Python port of SymSpell: 1 million times faster spelling correction & fuzzy search through Symmetric Delete spelling correction algorithm
A .NET port of java-string-similarity
đŚđ Rust library to compare strings (or any sequences). 25+ algorithms, pure Rust, common interface, Unicode support.
pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
Ruby gem (native extension in Rust) providing implementations of various string metrics
SymSpellCompound: compound aware automatic spelling correction
Java port of SymSpell: 1 million times faster through Symmetric Delete spelling correction algorithm
Get text similarity level with Damerau-Levenshtein distance
Fast edit distance Python extension written in Cython/C++. Supports Levenshtein distance and Damerau Optimal String Alignment (OSA) distance.
Efficient String Comparison Functions and Fuzzy String Matching
String metrics function in golang (levenshtein, damerau-levenshtein, jaro, jaro-winkler and additionally bk-tree) for autocorrect
Cython implementation of true Damerau-Levenshtein algorithm.
This project Orchid-Fst implements a fast text string dictionary search data structure: Finite state transducer (short for FST) in c++ language.This FST C++ open source project has much significant advantages.
Library of tools for fuzzy matching.
LinSpell spelling correction algorithm implementation using Swift and Objective-C
A collection of string comparisons algorithms
Comparison of a few algorithms for computing DamerauâLevenshtein distance
Kotlin multiplatform library offering various algorithms to measure string similarity and distance
Represent large sets and maps compactly with finite state transducers.
passwordsim lets you search for passwords similar to your specified password in any passwords dataset. The similarity metric used is the Damerau-Levenshtein distance.
CS 276 - Programming Assignment 2
A simple NodeJS (NPM) module for weighted DamerauâLevenshtein distance.