Abstract
Kanazawa [6,7] proposes to view recognition algorithms for Multiple Context-Free Grammars (MCFGs) as Datalog program transformations. He illustrates this view by transforming a Datalog program implementing CYK recognizers for MCFGs into programs that implement prefix-correct recognizers for MCFGs. We enhance his results in three different directions: (i) we present an extension of Datalog so as to build parsers instead of recognizers; (ii) we adapt his program transformations to extended Datalog programs that construct prefix-correct parsers for Parallel Multiple Context-Free Grammars (PMCFGs); (iii) we propose another program transformation for extended Datalog programs that produces left-corner parsers for PMCFGs.
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
Angelov, K.: Incremental parsing with parallel multiple context-free grammars. In: EACL, pp. 69–76 (2009)
Boullier, P.: Range concatenation grammars. In: Proceedings of the Sixth International Workshop on Parsing Technologies, pp. 53–64 (February 2000)
Colmerauer, A.: Metamorphosis grammars. In: Bolc, L. (ed.) Natural Language Communication with Computers. LNCS, vol. 63, pp. 133–188. Springer, Heidelberg (1978)
Demers, A.J.: Generalized left corner parsing. In: Proceedings of the 4th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages, pp. 170–182. ACM, New York (1977), http://doi.acm.org/10.1145/512950.512966
Earley, J.: An efficient context-free parsing algorithm. Commun. ACM 13(2), 94–102 (1970)
Kanazawa, M.: Parsing and generation as Datalog queries. In: Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics, pp. 176–183. Association for Computational Linguistics, Prague (2007)
Kanazawa, M.: A prefix-correct Earley recognizer for multiple context-free grammars. In: TAG+9, Proceedings of the Ninth International Workshop on Tree Adjoining Grammars and Related Frameworks, Tubingen, Germany (June 2008)
Kanazawa, M.: Parsing and generation as Datalog query evaluation (2012) (under review), http://research.nii.ac.jp/~kanazawa/publications/pagadqe.pdf
Kobele, G.M.: Generating Copies: An investigation into structural identity in language and grammar. Ph.D. thesis, UCLA (2006)
Ljunglöf, P.: Expressivity and complexity of the Grammatical Framework. Citeseer (2004)
Ljunglöf, P.: A polynomial time extension of parallel multiple context-free grammar. In: Blache, P., Stabler, E.P., Busquets, J.V., Moot, R. (eds.) LACL 2005. LNCS (LNAI), vol. 3492, pp. 177–188. Springer, Heidelberg (2005)
Ljunglöf, P.: Practical parsing of parallel multiple context-free grammars. In: TAG+11, 11th International Workshop on Tree Adjoining Grammar and Related Formalisms, Paris, France (2012)
Michaelis, J., Kracht, M.: Semilinearity as a syntactic invariant. In: Retoré, C. (ed.) LACL 1996. LNCS (LNAI), vol. 1328, pp. 329–345. Springer, Heidelberg (1997)
Nederhof, M.J.: Generalized left-corner parsing. In: Sixth Conference of the European Chapter of the Association for Computational Linguistics, Proceedings of the Conference, pp. 305–314 (1993)
Pereira, F.C., Shieber, S.M.: Prolog and Natural-Language Analysis. CSLI Lecture Notes Series, vol. 10. Center for the Study of Language and Information (1987), http://mtome.com/Publications/PNLA/pnla.html
Seki, H., Matsamura, T., Mamoru, F., Kasami, T.: On multiple context-free grammars. Theoretical Computer Science 88(2), 191–229 (1991)
Shieber, S.: Evidence against the context-freeness of natural language. Linguistics and Philosophy 8, 333–343 (1985), http://dx.doi.org/10.1007/BF00630917
Sikkel, K.: Parsing schemata - a framework for specification and analysis of parsing algorithms. Springer (1997)
Ullman, J.D.: Bottom-up beats top-down for datalog. In: Proceedings of the Eighth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 140–149. ACM (1989)
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
Ball, A., Bourreau, P., Kien, É., Salvati, S. (2014). Building PMCFG Parsers as Datalog Program Transformations. 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_1
Download citation
DOI: https://doi.org/10.1007/978-3-662-43742-1_1
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)