Synchronous context-free grammars and optimal linear parsing strategies - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Journal Articles Journal of Computer and System Sciences Year : 2015

Synchronous context-free grammars and optimal linear parsing strategies

Abstract

Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata [1] and [2], are unlike context-free grammars in that they do not have a binary normal form. In general, parsing with SCFGs takes space and time polynomial in the length of the input strings, but with the degree of the polynomial depending on the permutations of the SCFG rules. We consider linear parsing strategies, which add one nonterminal at a time. We show that for a given input permutation, the problems of finding the linear parsing strategy with the minimum space and time complexity are both NP-hard.

Dates and versions

hal-01249108 , version 1 (30-12-2015)

Identifiers

Cite

Pierluigi Crescenzi, Daniel Gildea, Andrea Marino, Gianluca Rossi, Giorgio Satta. Synchronous context-free grammars and optimal linear parsing strategies. Journal of Computer and System Sciences, 2015, 81 (7), pp.1333-1356. ⟨10.1016/j.jcss.2015.04.003⟩. ⟨hal-01249108⟩

Collections

INRIA INRIA2
72 View
0 Download

Altmetric

Share

Gmail Facebook X LinkedIn More