Calculates minimum edit distance between two words using Levenshtien and confusion cost matrix
-
Updated
Jan 31, 2020 - Python
Calculates minimum edit distance between two words using Levenshtien and confusion cost matrix
The repo is about implementation of Wagner-Fischer algorithm for calculating Levenshtein distance between two strings.
Minimum Edit Distance (MED) Calculator
Academy
It is an enhanced version of the minimum edit distance algorithm with dynamic programming.
Simple English words spell checker for auto completing task using Shakespeare's corpus.
A new metric for evaluating end-to-end speech recognition and disfluency removal systems
Add a description, image, and links to the minimum-edit-distance topic page so that developers can more easily learn about it.
To associate your repository with the minimum-edit-distance topic, visit your repo's landing page and select "manage topics."