There are 0 repository under minimum-edit-distance topic.
This Repository Contains Solution to the Assignments of the Natural Language Processing Specialization from Deeplearning.ai on Coursera Taught by Younes Bensouda Mourri, Łukasz Kaiser, Eddy Shyu
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.
Lightweight and typesafe strings in Scala
Academy
It is an enhanced version of the minimum edit distance algorithm with dynamic programming.
Calculates minimum edit distance between two words using Levenshtien and confusion cost matrix
Simple English words spell checker for auto completing task using Shakespeare's corpus.
COMP 8730 Assignment 1
a jupyter notebook that computes for the levenshtein or minimum edit distance of 2 strings
Algoritmos de programación dinámica
Utilize Minimum Edit distance to compute top-k auto-correct recommendation and evaluate the same using success in top-k method using pytrec_eval.