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

Cython implementation of true Damerau-Levenshtein algorithm.

A package for parsing Vietnamese address

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

Academy

Python scripts used to calculate 3 basic similarity measures, suitable for ad hoc information retrieval systems: Levenshtein Edit Distance, Jaccard, and a Term-Document matrix.

Script for calculating the edit distance between two strings. We compare two approaches in terms of computational time: linear storage and quadratic storage.

English auto-correct using edit distance algorithm. Edit distance is a dynamic programming based algorithm. Words with edit distance value 1 closest to entered word is chosen from the dictionary of 1000 words and then displayed.

An implementation of a spell checker that uses a corpus file to compute word probabilities and suggests corrections for misspelled words by applying edit operations like delete, swap, replace, and insert.

Comparing edit distance with n-grams

This program takes an input and outputs a list of similarly spelled words based on edit distance using the Dynamic Edit Distance algorithm.

Accelerating Levenshtein Edit Distance Using GPU and PyCUDA