The University of St Andrews

Research@StAndrews:FullText >
University of St Andrews Research >
University of St Andrews Research >
University of St Andrews Research >

Please use this identifier to cite or link to this item:
This item has been viewed 13 times in the last year. View Statistics

Files in This Item:

File Description SizeFormat
2008d_1.pdf245.57 kBAdobe PDFView/Open
Title: Computing partition functions of PCFGs
Authors: Nederhof, Mark Jan
Satta, Giorgio
Keywords: Equation solving
Formal grammars
Statistical NLP
WSJ corpus
QA75 Electronic computers. Computer science
Issue Date: Oct-2008
Citation: Nederhof , M J & Satta , G 2008 , ' Computing partition functions of PCFGs ' Research on Language and Computation , vol 6 , no. 2 , pp. 139-162 . , 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.
Version: Postprint
Description: Acknowledgement provided in erratum at DOI:10.1007/s11168-009-9062-1
Status: Peer reviewed
ISSN: 1570-7075
Type: Journal article
Rights: This is an author version of the article. The original publication is available at
Appears in Collections:University of St Andrews Research
Computer Science Research

This item is protected by original copyright

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.


DSpace Software Copyright © 2002-2012  Duraspace - Feedback
For help contact: | Copyright for this page belongs to St Andrews University Library | Terms and Conditions (Cookies)