Research on Language and Computation

, Volume 6, Issue 2, pp 139–162

Computing Partition Functions of PCFGs

Authors

    • School of Computer ScienceUniversity of St Andrews
  • Giorgio Satta
    • Department of Information EngineeringUniversity of Padua
Article

DOI: 10.1007/s11168-008-9052-8

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

Abstract

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.

Keywords

Equation solvingFormal grammarsStatistical NLPWSJ corpus

Copyright information

© Springer Science+Business Media B.V. 2008