The edit-distance between two strings is the smallest number of operations required to transform one string into the other. The edit-distance problem for two languages is to find a pair of strings, each of which is from different language, with the minimum edit-distance. We consider the edit-distance problem for a regular language and a context-free language and present an efficient algorithm that finds an optimal alignment of two strings, each of which is from different language. Moreover, we design a faster algorithm for the edit-distance problem that only finds the minimum number of operations of the optimal alignment.
|Title of host publication||Developments in Language Theory - 16th International Conference, DLT 2012, Proceedings|
|Number of pages||12|
|Publication status||Published - 2012|
|Event||16th International Conference on Developments in Language Theory, DLT 2012 - Taipei, Taiwan, Province of China|
Duration: 2012 Aug 14 → 2012 Aug 17
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Other||16th International Conference on Developments in Language Theory, DLT 2012|
|Country/Territory||Taiwan, Province of China|
|Period||12/8/14 → 12/8/17|
Bibliographical noteFunding Information:
Han and Ko were supported by the Basic Science Research Program through NRF funded by MEST (2010-0009168). Salomaa was supported by the Natural Sciences and Engineering Research Council of Canada Grant OGP0147224.
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Computer Science(all)