pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
-
Updated
Sep 8, 2025 - Python
pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
Cython implementation of true Damerau-Levenshtein algorithm.
To evaluate machine translation, they use several methods, some of which we fully implemented
CPP codes for some popular algorithms
Levenshtein implements the Levenshtein (edit distance and diff) algorithm for golang
Qwerty-JaroβWinkler distance is a tweak on top of jaro winkler edit distance where we try to consider distance between keys in keyboard while calculating number of matches.
Generalized edit distance command line tool
Auto Suggestion Using Levenshtein Algorithm(Edit Distance)
Sniffer, KeyLogger, Clipboard listener, USB scanner with ADS support; Computes Levenshtein minimum edit-distance between two strings
Novel algorithm to generate shortest edit script.
Spell Checking and Correcting using a HashTable Implementation and the Edit Distance Algorithm in C
Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment
XDP is a tool in Java 8 which compares XML documents (Structure and Content), returns the similarity, provides a diff file which can be used to patch the 1st XML producing the 2nd.
Implementations of most algorithms learnt in the course UE18CS311
Bio informatics course materials for NEUB students.
INF103 DΓΆnem Sonu Projesi
Finding edit distance between a correct and an incorrect string
Academy
Created modified Levenshtein distance algorithms, to match strings by deletion and capitalization only and does not allow replacement or insertion of characters
Add a description, image, and links to the edit-distance-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the edit-distance-algorithm topic, visit your repo's landing page and select "manage topics."