Computing partition functions of PCFGs

Mark Jan Nederhof; Giorgio  Satta

doi:10.1007/s11168-008-9052-8

Computing partition functions of PCFGs

Mark Jan Nederhof, Giorgio Satta

School of Computer Science

Research output: Contribution to journal › Article › peer-review

22 Citations (Scopus)

2 Downloads (Pure)

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 ﬁnite automaton. We report experiments involving the Wall Street Journal corpus.

Original language	English
Pages (from-to)	139-162
Number of pages	24
Journal	Research on Language and Computation
Volume	6
Issue number	2
DOIs	https://doi.org/10.1007/s11168-008-9052-8
Publication status	Published - Oct 2008

Keywords

Equation solving
Formal grammars
Statistical NLP
WSJ corpus

Access to Document

10.1007/s11168-008-9052-8

Open Access version in Research@StAndrews:FullText
This is an author version of the article. The original publication is available at www.springerlink.com
Accepted author manuscript, 246 KB

Cite this

@article{a02ac0b5fc904a2bae0ed45cd3854a4d,

title = "Computing partition functions of PCFGs",

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 ﬁnite automaton. We report experiments involving the Wall Street Journal corpus.",

keywords = "Equation solving, Formal grammars, Statistical NLP, WSJ corpus",

author = "Nederhof, {Mark Jan} and Giorgio Satta",

note = "Acknowledgement provided in erratum at DOI:10.1007/s11168-009-9062-1",

year = "2008",

month = oct,

doi = "10.1007/s11168-008-9052-8",

language = "English",

volume = "6",

pages = "139--162",

journal = "Research on Language and Computation",

issn = "1570-7075",

publisher = "Kluwer Academic Publishers",

number = "2",

}

TY - JOUR

T1 - Computing partition functions of PCFGs

AU - Nederhof, Mark Jan

AU - Satta, Giorgio

N1 - Acknowledgement provided in erratum at DOI:10.1007/s11168-009-9062-1

PY - 2008/10

Y1 - 2008/10

N2 - 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.

AB - 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.

KW - Equation solving

KW - Formal grammars

KW - Statistical NLP

KW - WSJ corpus

U2 - 10.1007/s11168-008-9052-8

DO - 10.1007/s11168-008-9052-8

M3 - Article

SN - 1570-7075

VL - 6

SP - 139

EP - 162

JO - Research on Language and Computation

JF - Research on Language and Computation

IS - 2

ER -

Computing partition functions of PCFGs

Abstract

Keywords

Access to Document

Fingerprint

Cite this