Computing partition functions of PCFGs
MetadataShow full item record
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 ﬁnite automaton. We report experiments involving the Wall Street Journal corpus.
Nederhof , M J & Satta , G 2008 , ' Computing partition functions of PCFGs ' Research on Language and Computation , vol 6 , no. 2 , pp. 139-162 . DOI: 10.1007/s11168-008-9052-8
Research on Language and Computation
This is an author version of the article. The original publication is available at www.springerlink.com
Acknowledgement provided in erratum at DOI:10.1007/s11168-009-9062-1
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.