pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.

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

A package for parsing Vietnamese address

To evaluate machine translation, they use several methods, some of which we fully implemented

Cython implementation of true Damerau-Levenshtein algorithm.

CPP codes for some popular algorithms

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.

Levenshtein implements the Levenshtein (edit distance and diff) algorithm for golang

Edit distance algorithms inc. Jaro, Damerau-Levenshtein, and Optimal Alignment

Spell Checking and Correcting using a HashTable Implementation and the Edit Distance Algorithm in C

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.

Academy

INF103 Dönem Sonu Projesi

Editing distance algorithm realisation