Abstract
It is already known that parallel multiple context-free grammar (PMCFG) [1] is an instance of the equivalent formalisms simple literal movement grammar (sLMG) [2, 3] and range concatenation grammar (RCG) [4, 5]. In this paper we show that by adding the single operation of intersection, borrowed from conjunctive grammar [6], PMCFG becomes equivalent to sLMG and RCG. As a corollary we get that PMCFG with intersection describe exactly the class of languages recognizable in polynomial time.
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
Seki, H., Matsumara, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science 88, 191–229 (1991)
Groenink, A.: Mild context-sensitivity and tuple-based generalizations of context-free grammar. Linguistics and Philosophy 20, 607–636 (1997)
Groenink, A.: Surface without Structure — Word order and tractability issues in natural language analysis. PhD thesis, Utrecht University (1997)
Boullier, P.: A cubic-time extension of context-free grammars. Grammars 3, 111–131 (2000)
Boullier, P.: Range concatenation grammars. In: 6th International Workshop on Parsing Technologies, Trento, Italy, pp. 53–64 (2000)
Okhotin, A.: Conjunctive grammars. Journal of Automata, Languages and Combinatorics 6, 519–535 (2001)
Pollard, C.: Generalised Phrase Structure Grammars, Head Grammars and Natural Language. PhD thesis, Stanford University (1984)
Weir, D.: Characterizing Mildly Context-Sensitive Grammar Formalisms. PhD thesis, University of Pennsylvania, Philadelphia, PA (1988)
Becker, T.: HyTAG: A New Type of Tree Adjoining Grammars. PhD thesis, Universität des Saarlandes (1994)
Chiang, D.: Constraints on strong generative power. In: 39th Meeting of the Association for Computational Linguistics, pp. 124–131 (2001)
Ljunglöf, P.: Expressivity and Complexity of the Grammatical Framework. PhD thesis, Göteborg University (2004)
Kasami, T., Seki, H., Fujii, M.: Generalized context-free grammars and multiple context-free grammars. IEICE Transactions J71-D-I, 758–765 (1988)
Bertsch, E., Nederhof, M.J.: On the complexity of some extensions of RCG parsing. In: 7th International Workshop on Parsing Technologies, pp. 66–77 (2001)
Hopcroft, J., Ullman, J.: Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, Reading (1979)
Ginsburg, S.: Algebraic and Automata-Theoretic Properties of Formal Languages. North-Holland/Elsevier, Amsterdam (1975)
Chiang, D.: Evaluating Grammar Formalisms for Applications to Natural Language Processing and Biological Sequence Analysis. PhD thesis, University of Pennsylvania (2004)
Satta, G.: Recognition of linear context-free rewriting systems. In: 30th Meeting of the Association for Computational Linguistics, Newark, Delaware, pp. 89–95 (1992)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ljunglöf, P. (2005). A Polynomial Time Extension of Parallel Multiple Context-Free Grammar. In: Blache, P., Stabler, E., Busquets, J., Moot, R. (eds) Logical Aspects of Computational Linguistics. LACL 2005. Lecture Notes in Computer Science(), vol 3492. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11422532_12
Download citation
DOI: https://doi.org/10.1007/11422532_12
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-25783-7
Online ISBN: 978-3-540-31953-5
eBook Packages: Computer ScienceComputer Science (R0)