Alfredo Braunstein wrote: > (and by the way, this seems roughly > similar to what you get with string edit distance in which insets are > symbols of an extended alphabet with cost of substitution recursively > defined as edit distance, using plain Levenshtein algorithm)
...and this is esentially Selkov's algorithm in [Sel77] A/
