Fast statistical parsing with parallel Multiple Context-Free Grammars

14th Conference of the European Chapter of the Association for Computational Linguistics 2014, EACL 2014

Volumn , Issue , 2014, Pages 368-376

  Angelov, Krasimir ^a   Ljunglöf, Peter ^a  

^a CHALMERS UNIVERSITY OF TECHNOLOGY   (Sweden)

Author keywords

[No Author keywords available]

Indexed keywords

HEURISTIC ALGORITHMS; LINGUISTICS;

IT SUPPORTS; NON LINEAR; PARALLEL MULTIPLE CONTEXT-FREE GRAMMARS; PARSING ALGORITHM; SEARCH HEURISTICS; STATISTICAL PARSING; STATISTICAL RANKING; SUBOPTIMAL SOLUTION;

CONTEXT FREE GRAMMARS;

EID: 84905475440     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/v1/e14-1039     Document Type: Conference Paper

References (24)

1. Krasimir Angelov. 2009. Incremental parsing with parallel multiple context-free grammars. In Proceedings of EACL 2009, the 12th Conference of the European Chapter of the Association for Computational Linguistics, Athens, Greece.
2. Krasimir Angelov. 2011. The Mechanics of the Grammatical Framework. Ph.D. Thesis, Chalmers University of Technology, Gothenburg, Sweden.
3. Sabine Brants, Stefanie Dipper, Silvia Hansen, Wolfgang Lezius, and George Smith. 2002. The TIGER treebank. In Proceedings of TLT 2002, the 1st Workshop on Treebanks and Linguistic Theories, Sozopol, Bulgaria.
4. Hakan Burden and Peter Ljunglof. 2005. Parsing linear context-free rewriting systems. In Proceedings of IWPT 2005, the 9th International Workshop on Parsing Technologies, Vancouver, Canada.
5. Michael Collins. 2003. Head-driven statistical models for natural language parsing. Computational Linguistics, 29(4):589-637.
6. Jay Earley. 1970. An efficient context-free parsing algorithm. Communications of the ACM, 13(2):94- 102.
7. Peter Hart, Nils Nilsson, and Bertram Raphael. 1968. A formal basis for the heuristic determination of minimum cost paths. IEEE Transactions of Systems Science and Cybernetics, 4(2):100-107.
8. Laura Kallmeyer and Wolfgang Maier. 2009. An incremental Earley parser for simple range concatenation grammar. In Proceedings of IWPT 2009, the 11th International Conference on Parsing Technologies, Paris, France.
9. Laura Kallmeyer and Wolfgang Maier. 2013. Datadriven parsing using probabilistic linear contextfree rewriting systems. Computational Linguistics, 39(1):87-119.
10. Laura Kallmeyer. 2010. Parsing Beyond Context-Free Grammars. Springer.
11. Makoto Kanazawa. 2008. A prefix-correct Earley recognizer for multiple context-free grammars. In Proceedings of TAG+9, the 9th International Workshop on Tree Adjoining Grammar and Related Formalisms, Tubingen, Germany.
12. Yuki Kato, Hiroyuki Seki, and Tadao Kasami. 2006. Stochastic multiple context-free grammar for RNA pseudoknot modeling. In Proceedings of TAGRF 2006, the 8th International Workshop on Tree Adjoining Grammar and Related Formalisms, Sydney, Australia.
13. Dan Klein and Christopher D. Manning. 2003. A parsing: fast exact Viterbi parse selection. In Proceedings of HLT-NAACL 2003, the Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics, Edmonton, Canada.
14. Peter Ljunglof. 2012. Practical parsing of parallel multiple context-free grammars. In Proceedings of TAG+11, the 11th International Workshop on Tree Adjoining Grammar and Related Formalisms, Paris, France.
15. Wolfgang Maier, Miriam Kaeshammer, and Laura Kallmeyer. 2012. PLCFRS parsing revisited: Restricting the fan-out to two. In Proceedings of TAG+11, the 11th International Workshop on Tree Adjoining Grammar and Related Formalisms, Paris, France.
16. Wolfgang Maier. 2010. Direct parsing of discontinuous constituents in German. In Proceedings of SPRML 2010, the 1st Workshop on Statistical Parsing of Morphologically-Rich Languages, Los Angeles, California.
17. Wolfgang Maier. 2013. LCFRS binarization and debinarization for directional parsing. In Proceedings of IWPT 2013, the 13th International Conference on Parsing Technologies, Nara, Japan.
18. Mitchell P. Marcus, Mary Ann Marcinkiewicz, and Beatrice Santorini. 1993. Building a large annotated corpus of English: The Penn Treebank. Computational Linguistics, 19:313-330.
19. Roger Mitton. 1986. A partial dictionary of English in computer-usable form. Literary & Linguistic Computing, 1(4):214-215.
20. Mark-Jan Nederhof. 2003. Weighted deductive parsing and Knuth's algorithm. Computational Linguistics, 29(1):135-143.
21. Aarne Ranta. 2009. The GF resource grammar library. Linguistic Issues in Language Technology, 2(2).
22. Aarne Ranta. 2011. Grammatical Framework: Programming with Multilingual Grammars. CSLI Publications, Stanford.
23. Hiroyuki Seki, Takashi Matsumura, Mamoru Fujii, and Tadao Kasami. 1991. On multiple contextfree grammars. Theoretical Computer Science, 88(2):191-229.
24. Andreas Stolcke. 1995. An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics, 21(2):165-201.