Show simple item record

Files in this item


Item metadata

dc.contributor.authorNederhof, Mark Jan
dc.contributor.authorSatta, Giorgio
dc.identifier.citationNederhof , 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/07/11 .en
dc.identifier.otherPURE: 17730864
dc.identifier.otherPURE UUID: 88f03224-b6d4-4c17-b337-577045553bc6
dc.identifier.otherScopus: 80053281466
dc.identifier.otherORCID: /0000-0002-1845-6829/work/46002705
dc.description.abstractThe 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.
dc.publisherAssociation for Computational Linguistics
dc.relation.ispartofProceedings of the ACL Conference on Empirical Methods in Natural Language Processing (EMNLP 2011)en
dc.rightsThis is the author's version of this paper. The published version (c) 2011 The Association for Computational Linguistics is available at
dc.subjectParsing algorithmsen
dc.subjectNatural language processingen
dc.subjectQA75 Electronic computers. Computer scienceen
dc.titleComputation of infix probabilities for probabilistic context-free grammarsen
dc.typeConference itemen
dc.contributor.institutionUniversity of St Andrews. School of Computer Scienceen

This item appears in the following Collection(s)

Show simple item record