questions to Torsten Timm about his paper

[Torsten]

The algorithm is explained in this video You are not allowed to view links. Register or Login to view.


Here you can find an online demo of the basic Levenshtein-algorithm:
You are not allowed to view links. Register or Login to view.

I have already given some examples:

Example 1)
'chol' comared to 'chor' 
If you replace 'l' in 'chol' with 'r' you get 'chor'. You only need to replace one glyph. Therefore the edit distance is one.

Example 2)
 'chol' compared to 'chlor'. It is possible do replace 'l' with 'r' and to add a 'l' ( 'chol' -> 'chor' -> 'chlor'). Therefore the  edit distance is two in this case.