|
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:
http://hdl.handle.net/10023/1659
| 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 . |
| 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 |
| URI: | http://hdl.handle.net/10023/1659 |
| DOI: | http://dx.doi.org/10.1007/s11168-008-9052-8 |
| ISSN: | 1570-7075 |
| Type: | Journal article |
| Rights: | This is an author version of the article. The original publication is available at www.springerlink.com |
| 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.
|
