Parsing directed acyclic graphs with range concatenation grammars

Authors:
Pierre Boullier;Benoît Sagot
Affiliations:
INRIA Paris-Rocquencourt & Universitéé Paris, Le Chesnay Cedex, France;INRIA Paris-Rocquencourt & Universitéé Paris, Le Chesnay Cedex, France
Venue:
IWPT '09 Proceedings of the 11th International Conference on Parsing Technologies
Year:
2009

Citing 4
Cited 0

Characterizing structural descriptions produced by various grammatical formalisms

ACL '87 Proceedings of the 25th annual meeting on Association for Computational Linguistics
Guided parsing of range concatenation languages

ACL '01 Proceedings of the 39th Annual Meeting on Association for Computational Linguistics
Range concatenation grammars

New developments in parsing technology
Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Introduction to Automata Theory, Languages, and Computation (3rd Edition)

Quantified Score

Hi-index	0.00

Visualization

Abstract

Range Concatenation Grammars (RCGs) are a syntactic formalism which possesses many attractive properties. It is more powerful than Linear Context-Free Rewriting Systems, though this power is not reached to the detriment of efficiency since its sentences can always be parsed in polynomial time. If the input, instead of a string, is a Directed Acyclic Graph (DAG), only simple RCGs can still be parsed in polynomial time. For non-linear RCGs, this polynomial parsing time cannot be guaranteed anymore. In this paper, we show how the standard parsing algorithm can be adapted for parsing DAGs with RCGs, both in the linear (simple) and in the non-linear case.