Abstract
We present Range Concatenation Grammars, a syntactic formalism which possesses many attractive features, among which we emphasize here generative capacity and closure properties. For example, Range Concatenation Grammars have stronger generative capacity than Linear Context-Free Rewriting Systems, although this power is not to the detriment of efficiency, since the generated languages can always be parsed in polynomial time. Range Concatenation Languages are closed under both intersection and complementation, and these closure properties suggest novel ways to describe some linguistic phenomena. We also present a parsing algorithm which is the basis for our current prototype implementation.
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.
References
Becker T., Rambow O., and Niv M. (1992). The Derivational Generative Power of Formal Systems or Scrambling is Beyond LCFRS. In Technical Report, IRCS-92-38, Institute for Research in Cognitive Science, University of Pennsylvania, Philadelphia, PA.
Bertsch E. and Nederhof M.-J. (2001). On the Complexity of Some Extensions of RCG Parsing. In Proceedings of the Seventh International Workshop on Parsing Technologies (IWPT-2001), Beijing, China, pages 66–77.
Boullier P. (1998). Proposal for a Natural Language Processing Syntactic Backbone. In Research Report, RR-3342, at http://www.inria.fr/RRRT/RR-3342.html, INRIA-Rocquencourt, France, 41 pages.
Boullier P. (1999a). Chinese Numbers, MIX, Scrambling, and Range Concatenation Grammars. In Proceedings of the 9th Conference of the European Chapter of the Association for Computational Linguistics (EACL’99), Bergen, Norway, pages 53–60. See also Research Report No 3614 at http://www.inria.fr/RRRT/RR-3614.html, INRIA-Rocquencourt, France, Jan. 1999, 14 pages.
Boullier P. (1999b). On TAG Parsing. In 6ème conférence annuelle sur le Traitement Automatique des Langues Naturelles (TALN’99), Cargése, Corsica, France, pages 75–84. Also in Traitement Automatique des Langues, Vol. 41, No. 3 (2000), pages 759–793. See also Research Report No 3668 at http://www.inria.fr/RRRT/RR-3668.html, INRIA-Rocquencourt, France, Apr. 1999, 39 pages.
Boullier P. (1999c). On Multicomponent TAG Parsing. In 6ème conférence annuelle sur le Traitement Automatique des Langues Naturelles (TALN’99), Cargése, Corse, France, pages 321–326. See also Research Report No 3668 at http://www.inria.fr/RRRT/RR-3668.html, INRIA-Rocquencourt, France, Apr. ] 999, 39 pages.
Boullier P. (1999d). A Cubic Time Extension of Context-Free Grammars. In Sixth Meeting on Mathematics of Language (MOL6), University of Central Florida, Orlando, Florida, USA, pages 37–50. Also in Grammars, Vol. 3, Nos. 2-3 (2000), pages 111–131. See also Research Report No 3611 at http://www.inria.fr/RRRT/RR-3611.html, INRIA-Rocquencourt, France, Jan. 1999, 28 pages.
Boullier P. (2003). Counting with Range Concatenation Grammars. In Theoretical Computer Science, Vol. 293, No. 2, pages 391–16, Elsevier Science Publishers, Amsterdam.
Groenink A. (1997). Surface without Structure Word Order and Tractability in Natural Language Analysis. PhD thesis, Utrecht University, The Netherlands.
Joshi A. (1985). How Much Context-Sensitivity is Necessary for Characterizing Structural Descriptions — Tree Adjoining Grammars. In Natural Language Parsing — Theoretical, Computational and Psychological Perspective, pages 206–250, D. Dowty, L. Karttunen, and A. Zwicky, editors, Cambridge University Press, New-York, NY.
Lang B. (1994). Recognition Can Be Harder Than Parsing. In Computational Intelligenc, Vol. 10, No. 4, pages 486–94.
Radzinski D. (1991). Chinese Number-Names, Tree Adjoining Languages, and Mild Context-Sensitivity. In Computational Linguistics, Vol. 17, No. 3, pages 277–299.
Rounds W. (1988). LFP: A Logic for Linguistic Descriptions and an Analysis of its Complexity. In Computational Linguistics, Vol. 14, No. 4, pages 1–9.
Shieber S. (1985). Evidence Against the Context-Freeness of Natural Language. In Linguistics and Philosophy, Vol. 8, pages 333–343.
Vijay-Shanker K., Weir D. and Joshi A. (1987). Characterizing Structural Descriptions Produced by Various Grammatical Formalisms. In Proceedings of the 25th Meeting of the Association for Computational Linguistics, Stanford University, CA, pages 104–111.
Weir D. (1988). Characterizing Mildly Context-Sensitive Grammar Formalisms. PhD thesis, University of Pennsylvania, Philadelphia, PA.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Kluwer Academic Publishers
About this chapter
Cite this chapter
Boullier, P. (2004). Range Concatenation Grammars. In: Bunt, H., Carroll, J., Satta, G. (eds) New Developments in Parsing Technology. Text, Speech and Language Technology, vol 23. Springer, Dordrecht. https://doi.org/10.1007/1-4020-2295-6_13
Download citation
DOI: https://doi.org/10.1007/1-4020-2295-6_13
Publisher Name: Springer, Dordrecht
Print ISBN: 978-1-4020-2293-7
Online ISBN: 978-1-4020-2295-1
eBook Packages: Humanities, Social Sciences and Law