Research on Language and Computation

, Volume 6, Issue 2, pp 139–162

Computing Partition Functions of PCFGs


DOI: 10.1007/s11168-008-9052-8

Cite this article as:
Nederhof, MJ. & Satta, G. Res on Lang and Comput (2008) 6: 139. doi:10.1007/s11168-008-9052-8


We investigate the problem of computing the partition function of a probabilistic context-free grammar, and consider a number of applicable methods. Particular attention is devoted to PCFGs that result from the intersection of another PCFG and a finite automaton. We report experiments involving the Wall Street Journal corpus.


Equation solving Formal grammars Statistical NLP WSJ corpus 

Copyright information

© Springer Science+Business Media B.V. 2008

Authors and Affiliations

  1. 1.School of Computer ScienceUniversity of St AndrewsNorth Haugh, St AndrewsScotland, UK
  2. 2.Department of Information EngineeringUniversity of PaduaPadovaItaly

Personalised recommendations