Crowdly
Add to Chrome
In the recurrence relation for finding the optimal string distance when tran...
✅ The verified answer to this question is available below. Our community-reviewed solutions help you understand the material better.
In the recurrence relation for finding the optimal string distance when transforming the string characters do not match the distance x into the string y. When the d(i,j) equals:
1 + min{ d(i,j−1), d(i−1,j), d(i−1,j−1) } What does the case d(i−1,j−1) correspond to?
✅
❌
❌
❌