Script for calculating the edit distance between two strings. We compare two approaches in terms of computational time: linear storage and quadratic storage.
-
Updated
Jun 26, 2015 - Python
Script for calculating the edit distance between two strings. We compare two approaches in terms of computational time: linear storage and quadratic storage.
Edit distance algorithm in haskell.
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.
Spell Checking and Correcting using a HashTable Implementation and the Edit Distance Algorithm in C
Edit-distance algorithm for text-processing and scoring for each sentiment (+1, 0, -1).
Sniffer, KeyLogger, Clipboard listener, USB scanner with ADS support; Computes Levenshtein minimum edit-distance between two strings
Generalized edit distance command line tool
Created modified Levenshtein distance algorithms, to match strings by deletion and capitalization only and does not allow replacement or insertion of characters
Compute shortest edit-distance path between two words
Calculates the edit distance between two strings
Created various Information Retrival Algorithms from scratch in python
Finding edit distance between a correct and an incorrect string
This is the edit distance calculated between two strings (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.
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.
In the Edit Distance problem, we need to find the minimum number of edits or operations required to make two strings equal.
Auto Suggestion Using Levenshtein Algorithm(Edit Distance)
단국대학교 알고리즘 과제
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.
Implimentation of the minimum edit distance algorithm for a simple spell checker.
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."