There are 0 repository under edit-distance-algorithm topic.
pyxDamerauLevenshtein implements the Damerau-Levenshtein (DL) edit distance algorithm for Python in Cython for high performance.
To evaluate machine translation, they use several methods, some of which we fully implemented
Cython implementation of true Damerau-Levenshtein algorithm.
A package for parsing Vietnamese address
Have you ever wondered about how the Autocorrect features work on the keyboard of a Smartphone? Now almost every smartphone brand regardless of its price provides an autocorrect feature in their keyboards today.
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.
Auto Suggestion Using Levenshtein Algorithm(Edit Distance)
Generalized edit distance command line tool
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
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
Created various Information Retrival Algorithms from scratch in python
INF103 Dönem Sonu Projesi
Created modified Levenshtein distance algorithms, to match strings by deletion and capitalization only and does not allow replacement or insertion of characters
Editing distance algorithm realisation
Assignments completed during the course Theory of Computation
Edit distance algorithm implemented using C++ to calculate edit distance between two words and alignment.
This repo contains different university projects made by me, Alessio Mana and Fabrizio Sanino for our Algorithm and Data Structure Exam done in Turin in June 2021.
Implementing Edit Distance in C
This program takes an input and outputs a list of similarly spelled words based on edit distance using the Dynamic Edit Distance algorithm.
Comparing edit distance with n-grams
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.
Spell Checker using a Hash Table
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.
This is a problem which is asked to solve in my Data Structure & Algorithm Lab.
Dynamic programming solution to the "Edit Distance" problem.