An incremental Earley parser for simple range concatenation grammar

Proceedings of the 11th International Conference on Parsing Technologies, IWPT 2009

Volumn , Issue , 2009, Pages 61-64

  Kallmeyer, Laura ^a   Maier, Wolfgang ^a  

^a UNIVERSITY OF TÜBINGEN   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

CONTEXT-FREE; RANGE CONCATENATION GRAMMARS; REWRITING SYSTEMS; SIMPLE++;

EID: 85119360516     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (10)

1. Pierre Boullier. 1998. Proposal for a natural language processing syntactic backbone. Rapport de Recherche RR-3342, INRIA.
2. Håkan Burden and Peter Ljunglöf. 2005. Parsing linear context-free rewriting systems. In Proceedings of IWPT 2005.
3. Liang Huang and David Chiang. 2005. Better k-best parsing. In Proceedings of IWPT 2005.
4. Yuki Kato, Hiroyuki Seki, and Tadao Kasami. 2006. Stochastic multiple context-free grammar for RNA pseudoknot modeling. In Proceedings of TAG+8.
5. Dan Klein and Christopher D. Manning. 2003. A* Parsing: Fast Exact Viterbi Parse Selection. In Proceedings of HLT-NAACL.
6. Marco Kuhlmann and Giorgio Satta. 2009. Treebank grammar techniques for non-projective dependency parsing. In Proceedings of EACL.
7. Wolfgang Maier and Anders Søgaard. 2008. Tree-banks and mild context-sensitivity. In Proceedings of Formal Grammar 2008.
8. Hiroyuki Seki, Takahashi Matsumura, Mamoru Fujii, and Tadao Kasami. 1991. On multiple context-free grammars. Theoretical Computer Science.
9. K. Vijay-Shanker, David Weir, and Aravind Joshi. 1987. Characterising structural descriptions used by various formalisms. In Proceedings of ACL.
10. Eric Villemonte de la Clergerie. 2002. Parsing mildly context-sensitive languages with thread automata. In Proceedings of COLING.