Abstract
We define an algebraic structure, Paired Complete Idempotent Semirings (pcis), which are appropriate for defining a denotational semantics for multiple context-free grammars of dimension 2 (2-mcfg). We demonstrate that homomorphisms of this structure will induce well-behaved morphisms of the grammar, and generalize the syntactic concept lattice from context-free grammars to the 2-mcfg case. We show that this lattice is the unique minimal structure that will interpret the grammar faithfully and that therefore 2-mcfgs without mergeable nonterminals will have nonterminals that correspond to elements of this structure.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Clark, A.: Learning context free grammars with the syntactic concept lattice. In: Sempere, J.M., García, P. (eds.) ICGI 2010. LNCS, vol. 6339, pp. 38–51. Springer, Heidelberg (2010)
Clark, A.: The syntactic concept lattice: Another algebraic theory of the context-free languages? Journal of Logic and Computation (2013)
Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order. Cambridge University Press (2002)
Eilenberg, S.: Automata, languages, and machines. Academic Press (1974)
Ginsburg, S., Rice, H.G.: Two families of languages related to ALGOL. Journal of the ACM (JACM) 9(3), 350–371 (1962)
Groenink, A.: Surface without structure: Word Order and Tractability Issues. Ph.D. thesis, University of Utrecht (1997)
Morrill, G.: Categorial grammar: Logical syntax, semantics and processing. Oxford University Press (2011)
Pereira, F.C.N., Shieber, S.M.: The semantics of grammar formalisms seen as computer languages. In: Proceedings of the 10th International Conference on Computational Linguistics and 22nd Annual Meeting on Association for Computational Linguistics, pp. 123–129. Association for Computational Linguistics (1984)
Salvati, S.: MIX is a 2-MCFL and the word problem in ℤ2 is solved by a third-order collapsible pushdown automaton. Technical Report Inria-00564552, version 1, INRIA (2011)
Seki, H., Matsumura, T., Fujii, M., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science 88(2), 191–229 (1991)
Yoshinaka, R.: Efficient learning of multiple context-free languages with multidimensional substitutability from positive data. Theoretical Computer Science 412(19), 1821–1831 (2011)
Yoshinaka, R.: Integration of the dual approaches in the distributional learning of context-free grammars. In: Dediu, A.-H., Martín-Vide, C. (eds.) LATA 2012. LNCS, vol. 7183, pp. 538–550. Springer, Heidelberg (2012)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2014 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Clark, A., Yoshinaka, R. (2014). An Algebraic Approach to Multiple Context-Free Grammars. In: Asher, N., Soloviev, S. (eds) Logical Aspects of Computational Linguistics. LACL 2014. Lecture Notes in Computer Science, vol 8535. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-43742-1_5
Download citation
DOI: https://doi.org/10.1007/978-3-662-43742-1_5
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-43741-4
Online ISBN: 978-3-662-43742-1
eBook Packages: Computer ScienceComputer Science (R0)