Incremental parsing with Parallel Multiple Context-Free Grammars

EACL 2009 - 12th Conference of the European Chapter of the Association for Computational Linguistics, Proceedings

Volumn , Issue , 2009, Pages 69-76

  Angelov, Krasimir ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

LINGUISTICS; POLYNOMIAL APPROXIMATION;

INCREMENTAL PARSING; PARALLEL MULTIPLE CONTEXT-FREE GRAMMARS; PARSING ALGORITHM; POLYNOMIAL-TIME; TOPDOWN; WORD PREDICTION;

CONTEXT FREE GRAMMARS;

EID: 84864916727     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1609067.1609074     Document Type: Conference Paper

References (11)

1. Håkan Burden and Peter Ljunglöf. 2005. Parsing linear context-free rewriting systems. In Proceedings of the Ninth International Workshop on Parsing Technologies (IWPT), pages 11-17, October.
2. Jay Earley. 1970. An efficient context-free parsing algorithm. Commun. ACM, 13(2): 94-102.
3. Aravind Joshi and Yves Schabes. 1997. Tree-adjoining grammars. In Grzegorz Rozenberg and Arto Salomaa, editors, Handbook of Formal Languages. Vol 3: Beyond Words, chapter 2, pages 69-123. Springer-Verlag, Berlin/Heidelberg/New York.
4. Peter Ljunglöf. 2004. Expressivity and Complexity of the Grammatical Framework. Ph.D. thesis, Department of Computer Science, Gothenburg University and Chalmers University of Technology, November.
5. Ryuichi Nakanishi, Keita Takada, and Hiroyuki Seki. 1997. An Efficient Recognition Algorithm for Multiple ContextFree Languages. In Fifth Meeting on Mathematics of Language. The Association for Mathematics of Language, August.
6. Aarne Ranta. 2004. Grammatical Framework: A Type-Theoretical Grammar Formalism. Journal of Functional Programming, 14(2): 145-189, March.
7. Aarne Ranta. 2008. GF Resource Grammar Library. digitalgrammars.com/gf/ lib/.
8. Hiroyuki Seki and Yuki Kato. 2008. On the Generative Power of Multiple Context-Free Grammars and Macro Grammars. IEICE-Transactions on Info and Systems, E91-D(2): 209-221.
9. Hiroyuki Seki, Takashi Matsumura, Mamoru Fujii, and Tadao Kasami. 1991. On multiple context-free grammars. Theoretical Computer Science, 88(2): 191-229, October.
10. Hiroyuki Seki, Ryuichi Nakanishi, Yuichi Kaji, Sachiko Ando, and Tadao Kasami. 1993. Parallel Multiple Context-Free Grammars, Finite-State Translation Systems, and Polynomial-Time Recognizable Subclasses of Lexical-Functional Grammars. In 31st Annual Meeting of the Association for Computational Linguistics, pages 130-140. Ohio State University, Association for Computational Linguistics, June.
11. Stuart M. Shieber, Yves Schabes, and Fernando C. N. Pereira. 1995. Principles and Implementation of Deductive Parsing. Journal of Logic Programming, 24 (1&2): 3-36.