Show simple item record

Files in this item

Thumbnail

Item metadata

dc.contributor.authorNederhof, Mark Jan
dc.contributor.authorSatta, Giorgio
dc.date.accessioned2011-01-06T14:37:02Z
dc.date.available2011-01-06T14:37:02Z
dc.date.issued2008-10
dc.identifier.citationNederhof , M J & Satta , G 2008 , ' Computing partition functions of PCFGs ' , Research on Language and Computation , vol. 6 , no. 2 , pp. 139-162 . https://doi.org/10.1007/s11168-008-9052-8en
dc.identifier.issn1570-7075
dc.identifier.otherPURE: 5095023
dc.identifier.otherPURE UUID: a02ac0b5-fc90-4a2b-ae0e-d45cd3854a4d
dc.identifier.otherScopus: 55649094871
dc.identifier.otherORCID: /0000-0002-1845-6829/work/46002716
dc.identifier.urihttp://hdl.handle.net/10023/1659
dc.descriptionAcknowledgement provided in erratum at DOI:10.1007/s11168-009-9062-1en
dc.description.abstractWe 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.
dc.format.extent24
dc.language.isoeng
dc.relation.ispartofResearch on Language and Computationen
dc.rightsThis is an author version of the article. The original publication is available at www.springerlink.comen
dc.subjectEquation solvingen
dc.subjectFormal grammarsen
dc.subjectStatistical NLPen
dc.subjectWSJ corpusen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.subject.lccQA75en
dc.titleComputing partition functions of PCFGsen
dc.typeJournal articleen
dc.description.versionPostprinten
dc.contributor.institutionUniversity of St Andrews.School of Computer Scienceen
dc.identifier.doihttps://doi.org/10.1007/s11168-008-9052-8
dc.description.statusPeer revieweden


This item appears in the following Collection(s)

Show simple item record