Prefix probabilities for linear context-free rewriting systems
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.
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 . conference
Publication
Proceedings of the 12th International Conference on Parsing Technologies (IWPT 2011)
Type
Conference item
Rights
(c) 2011 Association for Computational Linguistics, available from http://aclweb.org/anthology/W/W11/#2900
Collections
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.