Question: Given two text strings A of length n and B of length m, you want to transform A into B with a minimum number of
Given two text strings A of length n and B of length m, you want to transform A into B with a minimum number of operations of the following types: delete a character from A, insert a character into A, or change some character in A into a new character. The minimal number of such operations required to transform A into B is called the edit distance between A and B. Describe a dynamic programming algorithm (no need to code) to find the edit distance between two strings (10) Using this algorithms find the edit distance from the string sailship to the string sales boy. Show all your steps. (5)
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
