Parsing MCFG, LCFRS and Simple RCG

Part of the Cognitive Technologies book series (COGTECH, volume 0)


In this section, we present different non-directional bottom-up parsing algorithms for MCFG. The algorithms are described in (Seki et al., 1991; Ljunglöf, 2004; Burden and Ljunglöf, 2005).


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

  1. Kuno, Susumu 1965. The predictive analyzer and a path elimination technique. Communications of the ACM, 8(7):453–462, July. 53–462, July.CrossRefGoogle Scholar
  2. Kracht, Marcus. 2003. The Mathematics of Language. Number 63 in Studies in Generative Grammar. Mouton de Gruyter, Berlin.Google Scholar
  3. Langer, Hagen. 1998. Experimente mit verallgemeinerten Lookahead-Algorithmen. In Bernhard Schröder, Winfried Lenders, Wolfgang Hess, and Thomas Portele, editors, Computers, linguistics and phonetics between language and speech / KONVENS 98, pages 69–82, Bonn.Google Scholar
  4. Kanazawa, Makoto. 2008. A Prefix-Correct Earley Recognizer for Multiple Context-Free Grammars. In Proceedings of the Ninth International Workshop on Tree Adjoining Grammars and Related Formalisms (TAG+9), pages 49–56, Tübingen, June.Google Scholar
  5. Seki, Hiroyuki, Takahashi Matsumura, Mamoru Fujii, and Tadao Kasami. 1991. On multiple context-free grammars. Theoretical Computer Science, 88(2):191–229.CrossRefGoogle Scholar
  6. Villemonte de la Clergerie, Éric. 2002. Parsing mildly context-sensitive languages with thread automata. In Proceedings of COLING’02, August.Google Scholar
  7. Ljunglöf, Peter. 2004. Expressivity and Complexity of the Grammatical Framework. Ph.D. thesis, Department of Computer Science, Gothenburg University and Chalmers University of Technology, November.Google Scholar
  8. Kallmeyer, Laura, Wolfgang Maier, and Yannick Parmentier. 2009b. Un algorithme ďanalyse de type Earley pour grammaires à concaténation ďintervalles. In Actes de la 16ème conférence sur le Traitement Automatique des Langues Naturelles (TALN 2009), Senlis, France.Google Scholar
  9. Søgaard, Anders. 2008. Range concatenation grammars for translation. In Proceedings of the 22nd International Conference on Computational Linguistics, Manchester, England.Google Scholar
  10. Klein, Dan and Christopher D. Manning. 2003. A* Parsing: Fast exact Viterbi parse selection. In HLT-NAACL.Google Scholar
  11. Ljunglöf, Peter. 2005. A polynomial time extension of parallel Multiple Context-Free Grammar. In Logical Aspects of Computational Linguistics, volume 3492 of Lecture Notes in Computer Science. Springer, Berlin/Heidelberg, pages 177–188.Google Scholar

Copyright information

© Springer Berlin Heidelberg 2010

Authors and Affiliations

  1. 1.SFB 833Universität TübingenTübingenGermany

Personalised recommendations