Files in this item
Prefix probabilities for linear context-free rewriting systems
Item metadata
| dc.contributor.author | Nederhof, Mark Jan | |
| dc.contributor.author | Satta, Giorgio | |
| dc.date.accessioned | 2012-03-15T15:31:06Z | |
| dc.date.available | 2012-03-15T15:31:06Z | |
| dc.date.issued | 2011-10-05 | |
| dc.identifier.citation | Nederhof , M J & Satta , G 2011 , Prefix probabilities for linear context-free rewriting systems . in Proceedings of the 12th International Conference on Parsing Technologies (IWPT 2011) . Association for Computational Linguistics , Stroudsburg, PA , pp. 151–162 , 12th International Conference on Parsing Technologies , Dublin , Ireland , 5/10/10 . | en |
| dc.identifier.citation | conference | en |
| dc.identifier.isbn | 978-1-932432-04-6 | |
| dc.identifier.other | PURE: 17731980 | |
| dc.identifier.other | PURE UUID: 55fa04e8-b33a-4c90-bd00-bb6f698e2b29 | |
| dc.identifier.other | ORCID: /0000-0002-1845-6829/work/46002706 | |
| dc.identifier.uri | https://hdl.handle.net/10023/2437 | |
| dc.description.abstract | We present a novel method for the computation of prefix probabilities for linear context-free rewriting systems. Our approach streamlines previous procedures to compute prefix probabilities for context-free grammars, synchronous context-free grammars and tree adjoining grammars. In addition, the methodology is general enough to be used for a wider range of problems involving, for example, several prefixes. | |
| dc.format.extent | 12 | |
| dc.language.iso | eng | |
| dc.publisher | Association for Computational Linguistics | |
| dc.relation.ispartof | Proceedings of the 12th International Conference on Parsing Technologies (IWPT 2011) | en |
| dc.rights | (c) 2011 Association for Computational Linguistics, available from http://aclweb.org/anthology/W/W11/#2900 | en |
| dc.subject | Parsing algorithms | en |
| dc.subject | Natural language processing | en |
| dc.subject | QA75 Electronic computers. Computer science | en |
| dc.subject.lcc | QA75 | en |
| dc.title | Prefix probabilities for linear context-free rewriting systems | en |
| dc.type | Conference item | en |
| dc.description.version | Postprint | en |
| dc.contributor.institution | University of St Andrews. School of Computer Science | en |
| dc.identifier.url | http://aclweb.org/anthology/W/W11/W11-2919.pdf | en |
This item appears in the following Collection(s)
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.