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.

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

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)

Novel algorithm to generate shortest edit script.

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.

Sniffer, KeyLogger, Clipboard listener, USB scanner with ADS support; Computes Levenshtein minimum edit-distance between two strings

Implementations of most algorithms learnt in the course UE18CS311

Bio informatics course materials for NEUB students.

an approximate string matching library written in C++

Editing distance algorithm realisation

Finding edit distance between a correct and an incorrect string

No description provided.

Academy

Created modified Levenshtein distance algorithms, to match strings by deletion and capitalization only and does not allow replacement or insertion of characters

Edit distance algorithm in haskell.

Created various Information Retrival Algorithms from scratch in python

This is a React application for calculating the edit distance between two DNA sequences. The edit distance measures the minimum number of operations (insertions, deletions, and substitutions) required to transform one sequence into another. The app provides various methods to calculate the distance, including bounded and adaptive bounded methods.

INF103 Dönem Sonu Projesi

Spell Checker using a Hash Table

This is a problem which is asked to solve in my Data Structure & Algorithm Lab.

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