Let X and Y be any two strings of finite length. The problem of transforming X to Y using the edit operations of substitution, deletion, and insertion has been extensively studied in the literature. The problem can be solved in quadratic time if the edit operations are extended to include the operation of transposition of adjacent characters, and is NP-complete if the characters can be edited repeatedly. In this paper we consider the problem of transforming X to Y when the set of edit operations is extended to include the squashing and expansion operations. Whereas in the squashing operation two (or more) contiguous characters of X can be transformed into a single character of Y, in the expansion operation a single character in X may be expanded into two or more contiguous characters of Y. These operations are typically found in the recognition of cursive script. A quadratic time solution to the problem has been presented. This solution is optimal for the infinite-alphabet case. The strategy to compute the sequence of edit operations is also presented.

Additional Metadata
Persistent URL dx.doi.org/10.1016/0020-0255(94)00110-W
Journal Information Sciences
Oommen, J. (1995). String alignment with substitution, insertion, deletion, squashing, and expansion operations. Information Sciences, 83(1-2), 89–107. doi:10.1016/0020-0255(94)00110-W