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.
Find string matches between files in < 50 LLOC.
Minimum Edit Distance - Advanced Algorithms Project
Computational Biology Assignments
Global NIPS Paper Implementation Challenge - An Automated System for Essay Scoring of Online Exams in Arabic based on Stemming Techniques and Levenshtein Edit Operations
This is an edit distance word transformation game
This repo contains the Python 3 compatible code for SymSpell algorithm
Minimum Edit Distance (Advance Algorithm Project)- Implementing Dynamic, Greedy, Branch and Bound, K-strip Algo
This is the repository for the code of my Computer Science bachelor's degree final paper.
Implementation of the Optimal Completion Distillation for Sequence Labeling
CRF Edit Distance
An order-optimal code that corrects a single edit in a quaternary alphabet
Code repository with customisable Fuzzy Matching scripts in STATA and Python, especially useful when working with datasets containing Hindi text transliterated to English.
Implementation of Wagner–Fischer algorithm for Levenshtein distance between two strings
Text Matching Based on LCQMC: A Large-scale Chinese Question Matching Corpus
An efficient data structure for fast string similarity searches
Custom TensorFlow2 implementations of forward and backward computation of soft-DTW algorithm in batch mode.
The repo is about implementation of Wagner-Fischer algorithm for calculating Levenshtein distance between two strings.
Add a description, image, and links to the edit-distance topic page so that developers can more easily learn about it.
To associate your repository with the edit-distance topic, visit your repo's landing page and select "manage topics."