The undecidability of the unrestricted modified edit distance

✍ Scribed by Vitus J. Leung

• Book ID: 104326211
• Publisher: Elsevier Science
• Year: 1997
• Tongue: English
• Weight: 704 KB
• Volume: 180
• Category: Article
• ISSN: 0304-3975
• DOI: 10.1016/s0304-3975(96)00187-9

✦ Synopsis

We define the unrestricted modified edit distance based on the modified edit distance defined by Galil and Giancarlo (1989) where the cost of substring deletions and insertions are contextsensitive and the cost of character substitutions are context-free. The modified edit distance is the minimum cost of converting a string X to a string Y where the sequence of edit operations has the property that all substring deletions precede all character substitutions and all character substitutions precede all substring insertions. Note that the modified edit distance does not satisfy the triangle inequality. We show that the problem of finding the unrestricted modified edit distance which is the minimum cost over all edit sequences (without these constraints) of converting X to Y is undecidable.