@@ -62,7 +62,7 @@ is being calculated based on three previously possible transformations.
6262
6363To explain this further let’s draw the following matrix:
6464
65- ![ Levenshtein Matrix] ( https://cdn-images-1.medium.com/max/1600/1*2d46ug_PL5LfeqztckoYGw.jpeg )
65+ ![ Levenshtein Matrix] ( https://cdn-images-1.medium.com/max/1600/1*aTunSUoy0BJyYBVn4tWGrA.png )
6666
6767- Cell` (0:1) ` contains red number 1. It means that we need 1 operation to
6868transform` M ` to an empty string. And it is by deleting` M ` . This is why this number is red.
@@ -89,11 +89,11 @@ letters in `i`'s row and `j`'s column.
8989
9090You may clearly see the recursive nature of the problem.
9191
92- ![ Levenshtein Matrix] ( https://cdn-images-1.medium.com/max/2000 /1*JdHQ5TeKiDlE-iKK1s_2vw.jpeg )
92+ ![ Levenshtein Matrix] ( https://cdn-images-1.medium.com/max/1600 /1*w8UB4DSvBnAK6mBXRGQDjw.png )
9393
9494Let's draw a decision graph for this problem.
9595
96- ![ Minimum Edit Distance Decision Graph] ( https://cdn-images-1.medium.com/max/1600/1*SGwYUpXH9H1xUeTvJk0e7Q.jpeg )
96+ ![ Minimum Edit Distance Decision Graph] ( https://cdn-images-1.medium.com/max/1600/1*8jD0qvr5B9PwRFM_9z7q9A.png )
9797
9898You may see a number of overlapping sub-problems on the picture that are marked
9999with red. Also there is no way to reduce the number of operations and make it
@@ -106,7 +106,7 @@ bottom-up direction) is being applied here.
106106Applying this principle further we may solve more complicated cases like
107107with` Saturday → Sunday ` transformation.
108108
109- ![ Levenshtein distance] ( https://cdn-images-1.medium.com/max/1600/1*fPEHiImYLKxSTUhrGbYq3g.jpeg )
109+ ![ Levenshtein distance] ( https://cdn-images-1.medium.com/max/1600/1*geMdmZcdU1bZbHIoh6KO3Q.png )
110110
111111##References
112112