Computation of infix probabilities for probabilistic context-free grammars

Mark Jan Nederhof, Giorgio Satta

Research output: Chapter in Book/Report/Conference proceedingConference contribution

8 Citations (Scopus)
4 Downloads (Pure)

Abstract

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.
Original languageEnglish
Title of host publicationProceedings of the ACL Conference on Empirical Methods in Natural Language Processing (EMNLP 2011)
Place of PublicationStroudsburg, PA
PublisherAssociation for Computational Linguistics
Pages1213-1221
Number of pages9
ISBN (Print)978-1-937284-11-4, 19937284-11-5
Publication statusPublished - Jul 2011
Event2011 Conference on Empirical Methods on Natural Language Processing - Edinburgh, United Kingdom
Duration: 27 Jul 201129 Jul 2011

Conference

Conference2011 Conference on Empirical Methods on Natural Language Processing
Abbreviated titleEMNLP 2011
Country/TerritoryUnited Kingdom
CityEdinburgh
Period27/07/1129/07/11

Keywords

  • Parsing algorithms
  • Natural language processing

Fingerprint

Dive into the research topics of 'Computation of infix probabilities for probabilistic context-free grammars'. Together they form a unique fingerprint.

Cite this