Fig. 2From: String correction using the Damerau-Levenshtein distanceDL trace recurrence. a substitution b insertion c deletion d translate A[k:i] to B[l:j] where (a k,b j) and (b l,a i) form a transposition opportunityBack to article page