Computing the edit-distance between a regular language and a context-free language

Yo Sub Han, Sang Ki Ko, Kai Salomaa

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

7 Scopus citations

Abstract

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.

Original languageEnglish
Title of host publicationDevelopments in Language Theory - 16th International Conference, DLT 2012, Proceedings
Pages85-96
Number of pages12
DOIs
StatePublished - 2012
Event16th International Conference on Developments in Language Theory, DLT 2012 - Taipei, Taiwan, Province of China
Duration: 14 Aug 201217 Aug 2012

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7410 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference16th International Conference on Developments in Language Theory, DLT 2012
Country/TerritoryTaiwan, Province of China
CityTaipei
Period14/08/1217/08/12

Keywords

  • Context-free language
  • Edit-distance
  • Levenshtein distance
  • Regular language

Fingerprint

Dive into the research topics of 'Computing the edit-distance between a regular language and a context-free language'. Together they form a unique fingerprint.

Cite this