Question: Write a program in python that: 1. Implement the minimum edit distance algorithm, using Levenshtein distance with cost of 1 for insertions or deletions, 2
Write a program in python that: 1. Implement the minimum edit distance algorithm, using Levenshtein distance with cost of 1 for insertions or deletions, 2 for substitutions. Given any pair of words, you should output the following four pieces of information: (a) Minimum edit distance (b) Distance matrix (c) Pointer matrix (d) Alignment2. To test the correctness of your algorithm, you may use input words intention and execution.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
