A new metric for evaluating end-to-end speech recognition and disfluency removal systems
-
Updated
Mar 7, 2021 - Python
A new metric for evaluating end-to-end speech recognition and disfluency removal systems
The repo is about implementation of Wagner-Fischer algorithm for calculating Levenshtein distance between two strings.
Academy
Calculates minimum edit distance between two words using Levenshtien and confusion cost matrix
It is an enhanced version of the minimum edit distance algorithm with dynamic programming.
Minimum Edit Distance (MED) Calculator
Simple English words spell checker for auto completing task using Shakespeare's corpus.
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."