Guided Parsing of Range Concatenation Languages

The theoretical study of the range concatenation grammar [RCG] formalism has revealed many attractive properties which may be used in NLP. In particular, range concatenation languages [RCL] can be parsed in polynomial time and many classical grammatical formalisms can be translated into equivalent RCGs without increasing their worst-case parsing time complexity. For example, after translation into an equivalent RCG, any tree adjoining grammar can be parsed in

• Type: Conference
• Year: 2001
• Where: ACL
• Authors: François Barthélemy, Pierre Boullier, Philippe Deschamp, Eric Villemonte de la Clergerie
• Keywords: ACL 2001, ACL 2007, Equivalent Rcg, Range Concatenation, Rcl Parser