Abstract
In this chapter, we turn to Range Concatenation Grammars (RCGs) (Boullier, 1998a; Boullier, 1999b; Boullier, 2000b), the most powerful formalism treated in this book.
In the previous chapter, we have already seen simple RCG, a syntactic variant of LCFRS. As already mentioned, in a simple RCG, we can understand non-terminals as predicates that are satisfied by all the string tuples that are in their yields. A rewriting rule (clause) with left-hand side predicate A is then the specification of a sufficient condition for a string tuple to satisfy the predicate A.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Kracht, Marcus. 2003. The Mathematics of Language. Number 63 in Studies in Generative Grammar. Mouton de Gruyter, Berlin.
Lichte, Timm. 2007. An MCTAG with Tuples for Coherent Constructions in German. In Proceedings of the 12th Conference on Formal Grammar 2007, Dublin, Ireland.
Kallmeyer, Laura. 2005. Tree-local multicomponent tree adjoining grammars with shared nodes. Computational Linguistics, 31(2):187–225.
Seki, Hiroyuki, Takahashi Matsumura, Mamoru Fujii, and Tadao Kasami. 1991. On multiple context-free grammars. Theoretical Computer Science, 88(2):191–229.
Groenink, Annius Victor. 1996. Mild context-sensitivity and tuple-based generalizations of context-free grammar. Report CS-R9634, Centrum voor Wiskunde en Informatica, Amsterdam.
Kallmeyer, Laura, Wolfgang Maier, and Yannick Parmentier. 2009b. Un algorithme ďanalyse de type Earley pour grammaires à concaténation ďintervalles. In Actes de la 16ème conférence sur le Traitement Automatique des Langues Naturelles (TALN 2009), Senlis, France.
Joshi, Aravind K. 1985. Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural descriptions? In D. Dowty, L. Karttunen, and A. Zwicky, editors, Natural Language Parsing. Cambridge University Press, pages 206–250.
Søgaard, Anders. 2008. Range concatenation grammars for translation. In Proceedings of the 22nd International Conference on Computational Linguistics, Manchester, England.
Radzinski, Daniel. 1991. Chinese number-names, tree adjoining languages, and mild context-sensitivity. Computational Linguistics, 17:277–299.
Ljunglöf, Peter. 2005. A polynomial time extension of parallel Multiple Context-Free Grammar. In Logical Aspects of Computational Linguistics, volume 3492 of Lecture Notes in Computer Science. Springer, Berlin/Heidelberg, pages 177–188.
Sagot, Benoît. 2005. Linguistic facts as predicates over ranges of the sentence. In Proceedings of LACL 05, number 3492 in Lecture Notes in Computer Science, pages 271–286, Bordeaux, France. Springer.
Author information
Authors and Affiliations
Corresponding author
Rights and permissions
Copyright information
© 2010 Springer Berlin Heidelberg
About this chapter
Cite this chapter
Kallmeyer, L. (2010). Range Concatenation Grammars. In: Parsing Beyond Context-Free Grammars. Cognitive Technologies, vol 0. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14846-0_8
Download citation
DOI: https://doi.org/10.1007/978-3-642-14846-0_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-14845-3
Online ISBN: 978-3-642-14846-0
eBook Packages: Computer ScienceComputer Science (R0)