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.
Type de document :
Article dans une revue
Journal of Computer and System Sciences (JCSS), Elsevier, 2015, 81 (7), pp.1333-1356. 〈10.1016/j.jcss.2015.04.003〉
Liste complète des métadonnées

https://hal.inria.fr/hal-01249108
Contributeur : Marie-France Sagot <>
Soumis le : mercredi 30 décembre 2015 - 09:46:34
Dernière modification le : jeudi 14 juin 2018 - 10:54:02

Lien texte intégral

Identifiants

Collections

Citation

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 (JCSS), Elsevier, 2015, 81 (7), pp.1333-1356. 〈10.1016/j.jcss.2015.04.003〉. 〈hal-01249108〉

Partager

Métriques

Consultations de la notice

120