Efficiently Computing Edit Distance to Dyck Language


Given a string σ over alphabet Σ and a grammar G defined over the same alphabet, how many minimum number of repairs: insertions, deletions and substitutions are required to map σ into a valid member of G ? We investigate this basic question in this paper for DYCK(s). DYCK(s) is a fundamental context free grammar representing the language of well-balanced… (More)


1 Figure or Table

Slides referencing similar topics