COMPUTATION / HANDS-ON LEARNING
Edit Distance Studio
Transform one word into another using insertion deletion and substitution; compare move count with exact Levenshtein optimum and inspect the dynamic programming matrix.
Transform one word into another using insertion deletion and substitution; compare move count with exact Levenshtein optimum and inspect the dynamic programming matrix.