Suppose each edit (insert, delete, replace) has a cost of one. Then, the maximum edit distance cost between the two strings is equal to the length of the larger string.

Mr. Dubey • 87.94K Points
Coach

Q. Suppose each edit (insert, delete, replace) has a cost of one. Then, the maximum edit distance cost between the two strings is equal to the length of the larger string.

(A) true

(B) false

(D) ---

Correct Answer - Option(A)
Views: 797
Filed under category Design and Analysis of Algorithms

 consider the strings “abcd” and “efghi”. the string “efghi” can be converted to “abcd” by deleting “i” and converting “efgh” to “abcd”. the cost of transformation is 5, which is equal to the length of the larger string.

You must be Logged in to update hint/solution