Computing partition functions of PCFGs

Mark Jan Nederhof, Giorgio Satta

Research output: Contribution to journalArticlepeer-review

16 Citations (Scopus)

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.
Original languageEnglish
Pages (from-to)139-162
Number of pages24
JournalResearch on Language and Computation
Volume6
Issue number2
DOIs
Publication statusPublished - Oct 2008

Keywords

  • Equation solving
  • Formal grammars
  • Statistical NLP
  • WSJ corpus

Fingerprint

Dive into the research topics of 'Computing partition functions of PCFGs'. Together they form a unique fingerprint.

Cite this