Cody

# Problem 93. Calculate the Levenshtein distance between two strings

Solution 2095719

Submitted on 17 Jan 2020
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### Test Suite

Test Status Code Input and Output
1   Pass
s1 = 'kitten'; s2 = 'sitting'; d_correct = 3; assert(isequal(levenshtein(s1,s2),d_correct))

2   Fail
s1 = 'Saturday'; s2 = 'Sunday'; d_correct = 3; assert(isequal(levenshtein(s1,s2),d_correct))

Index exceeds the number of array elements (6). Error in levenshtein (line 12) sz=[s3(1:i) blanks(lendiff) s3(i+1:end)]; Error in Test2 (line 4) assert(isequal(levenshtein(s1,s2),d_correct))

3   Fail
s1 = 'MATLAB rocks!'; s2 = 'MathWorks'; d_correct = 9; assert(isequal(levenshtein(s1,s2),d_correct))

Index exceeds the number of array elements (9). Error in levenshtein (line 12) sz=[s3(1:i) blanks(lendiff) s3(i+1:end)]; Error in Test3 (line 4) assert(isequal(levenshtein(s1,s2),d_correct))

4   Fail
s1 = 'Four score and seven years ago'; s2 = 'Eighty seven years before today'; d_correct = 25; assert(isequal(levenshtein(s1,s2),d_correct))

Assertion failed.

5   Fail
s1 = 'Row row row your boat'; s2 = 'Gently down the stream'; d_correct = 18; assert(isequal(levenshtein(s1,s2),d_correct))

Assertion failed.

6   Pass
s1 = 'ninety-nine bottles of beer on the wall'; s2 = 'eighty-six bottles of beer on the wall'; d_correct = 6; assert(isequal(levenshtein(s1,s2),d_correct))

7   Fail
s1 = 'these are the times that try men''s souls'; s2 = 'soulwise, these are trying times'; d_correct = 27; assert(isequal(levenshtein(s1,s2),d_correct))

Index exceeds the number of array elements (32). Error in levenshtein (line 12) sz=[s3(1:i) blanks(lendiff) s3(i+1:end)]; Error in Test7 (line 4) assert(isequal(levenshtein(s1,s2),d_correct))