questions to Torsten Timm about his paper

[Torsten]

two strings share common base if, and only if, there is at least 1 letter the same.

This is only a problem for very short words, with only one or two characters. For words with at least 3 letters an edit distance of two also means that they must share one character.

If two strings have more letters in common that is better and if these letters appear on the same position, they even have a higher match.

If you count the common elements in common or if you count the differences are only two ways to measure the same.