|
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/2437
| Title: | Prefix probabilities for linear context-free rewriting systems |
| Authors: | Nederhof, Mark Jan
Satta, Giorgio |
| Keywords: | Parsing algorithms
Natural language processing
QA75 Electronic computers. Computer science |
| Issue Date: | 5-Oct-2011 |
| 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-7 October .
conference |
| 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. |
| Version: | Postprint |
| URI: | http://hdl.handle.net/10023/2437
http://aclweb.org/anthology/W/W11/W11-2919.pdf |
| ISBN: | 978-1-932432-04-6 |
| Type: | Conference item |
| Rights: | (c) 2011 Association for Computational Linguistics, available from http://aclweb.org/anthology/W/W11/#2900 |
| Publisher: | Association for Computational Linguistics |
| 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.
|
