Computation of infix probabilities for probabilistic context-free grammars
MetadataShow full item record
The notion of infix probability has been introduced in the literature as a generalization of the notion of prefix (or initial substring) probability, motivated by applications in speech recognition and word error correction. For the case where a probabilistic context-free grammar is used as language model, methods for the computation of infix probabilities have been presented in the literature, based on various simplifying assumptions. Here we present a solution that applies to the problem in its full generality.
Nederhof , M J & Satta , G 2011 , ' Computation of infix probabilities for probabilistic context-free grammars ' . in Proceedings of the ACL Conference on Empirical Methods in Natural Language Processing (EMNLP 2011) . Association for Computational Linguistics , Stroudsburg, PA , pp. 1213-1221 , 2011 Conference on Empirical Methods on Natural Language Processing , Edinburgh , United Kingdom , 27-29 July .conference
Proceedings of the ACL Conference on Empirical Methods in Natural Language Processing (EMNLP 2011)
This is the author's version of this paper. The published version (c) 2011 The Association for Computational Linguistics is available at http://aclweb.org/anthology-new/D/D11/
Items in the St Andrews Research Repository are protected by copyright, with all rights reserved, unless otherwise indicated.