Parsing CFGs and PCFGs with a Chomsky-Schützenberger Representation

  • Mans Hulden
Part of the Lecture Notes in Computer Science book series (LNCS, volume 6562)


We present a parsing algorithm for arbitrary context-free and probabilistic context-free grammars based on a representation of such grammars as a combination of a regular grammar and a grammar of balanced parentheses, similar to the representation used in the Chomsky-Schützenberger theorem. The basic algorithm has the same worst-case complexity as the popular CKY and Earley parsing algorithms frequently employed in natural language processing tasks.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. Charniak, E.: Statistical parsing with a context-free grammar and word statistics. In: Proceedings of the 14th National Conference on Artificial Intelligence, pp. 598–603 (1997)Google Scholar
  2. Chomsky, N., Schützenberger, M.-P.: The algebraic theory of context-free languages. In: Braffort, P., Hirschberg, D. (eds.) Computer Programming and Formal Systems, pp. 118–161. North Holland, Amsterdam (1963)CrossRefGoogle Scholar
  3. Earley, J.: An efficient context-free parsing algorithm. PhD thesis, Carnegie-Mellon University, Pittsburgh, Pa (1968)Google Scholar
  4. Eisner, J.: Bilexical grammars and a cubic-time probabilistic parser. In: Proceedings of the 1997 International Workshop on Parsing Technologies (1997)Google Scholar
  5. Hulden, M.: Foma: a finite-state compiler and library. In: Proceedings of EACL 2009, pp. 29–32 (2009)Google Scholar
  6. Kozen, D.C.: Automata and Computability. Springer, Heidelberg (1997)CrossRefzbMATHGoogle Scholar
  7. Salomaa, A.: Formal Languages. Academic Press, New York (1973)zbMATHGoogle Scholar
  8. Younger, D.H.: Recognition and parsing of context-free languages in time n 3. Information and Control 10, 189–208 (1967)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2011

Authors and Affiliations

  • Mans Hulden
    • 1
  1. 1.Language TechnologyUniversity of HelsinkiFinland

Personalised recommendations