Advertisement

Parsing: Preliminaries

Chapter
  • 1k Downloads
Part of the Cognitive Technologies book series (COGTECH, volume 0)

Abstract

There are different means of specifying a parsing algorithm. The most frequently used are a pseudo-code description of the algorithm and deduction rules.

The pseudo-code description has the advantage of being relatively close to the proper implementation. Consequently, implementing an algorithm given in pseudo-code is more or less immediate. However, the pseudo-code specification makes a lot of choices that actually do not belong to the parsing strategy of the algorithm. It introduces data structures and control structures.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Villemonte de la Clergerie, Eric. 2006. Designing tabular parsers for various syntactic formalisms. ESSLLI Lecture Notes.Google Scholar
  2. Gallo, G., G. Longo, S. Nguyen, and S. Pallottino. 1993. Directed Hypergraphs and Applications. Discrete Applied Mathematics, 42:177–201.CrossRefGoogle Scholar
  3. Shieber, Stuart M. 1984. Direct parsing of ID/LP grammars. Linguistics and Philosophy, 7(2):135–154.CrossRefGoogle Scholar
  4. Sikkel, Klaas. 1997. Parsing Schemata. Texts in Theoretical Computer Science. Springer, Berlin, Heidelberg, New York.Google Scholar
  5. Bellman, Richard 1957. Dynamic Programming. Princeton University Press.Google Scholar
  6. McAllester, David 2002. On the complexity analysis of static analyses. Journal of the ACM, 49(4):512–537.CrossRefGoogle Scholar
  7. Barton, G. Edward, Jr. 1985. The computational difficulty of ID/LP parsing. In Proceedings of the 23rd Annual Meeting of the Association for Computational Linguistics, pages 76–81, Chicago.Google Scholar

Copyright information

© Springer Berlin Heidelberg 2010

Authors and Affiliations

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

Personalised recommendations