For each character l, substitution distance is equally distributed over all other characters and the deletion operation (l → ).
the initial probability for a character match was set to 90%, and the remaining 10% was equally distributed over the other 26 possible substitutions.