Computation of infix probabilities for probabilistic context-free grammars

Mark Jan Nederhof; Giorgio  Satta

Computation of infix probabilities for probabilistic context-free grammars

School of Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

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 language	English
Title of host publication	Proceedings of the ACL Conference on Empirical Methods in Natural Language Processing (EMNLP 2011)
Place of Publication	Stroudsburg, PA
Publisher	Association for Computational Linguistics
Pages	1213-1221
Number of pages	9
ISBN (Print)	978-1-937284-11-4, 19937284-11-5
Publication status	Published - Jul 2011
Event	2011 Conference on Empirical Methods on Natural Language Processing - Edinburgh, United Kingdom Duration: 27 Jul 2011 → 29 Jul 2011

Conference

Conference	2011 Conference on Empirical Methods on Natural Language Processing
Abbreviated title	EMNLP 2011
Country/Territory	United Kingdom
City	Edinburgh
Period	27/07/11 → 29/07/11

Keywords

Parsing algorithms
Natural language processing

Access to Document

2011a
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/
Accepted author manuscript, 167 KB

Cite this

@inproceedings{88f03224b6d44c17b337577045553bc6,

title = "Computation of infix probabilities for probabilistic context-free grammars",

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.",

keywords = "Parsing algorithms, Natural language processing",

author = "Nederhof, {Mark Jan} and Giorgio Satta",

year = "2011",

month = jul,

language = "English",

isbn = "978-1-937284-11-4",

pages = "1213--1221",

booktitle = "Proceedings of the ACL Conference on Empirical Methods in Natural Language Processing (EMNLP 2011)",

publisher = "Association for Computational Linguistics",

note = "2011 Conference on Empirical Methods on Natural Language Processing, EMNLP 2011 ; Conference date: 27-07-2011 Through 29-07-2011",

}

Nederhof, MJ & 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.

Computation of infix probabilities for probabilistic context-free grammars. / Nederhof, Mark Jan; Satta, Giorgio .
Proceedings of the ACL Conference on Empirical Methods in Natural Language Processing (EMNLP 2011). Stroudsburg, PA: Association for Computational Linguistics, 2011. p. 1213-1221.

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

TY - GEN

T1 - Computation of infix probabilities for probabilistic context-free grammars

AU - Nederhof, Mark Jan

AU - Satta, Giorgio

PY - 2011/7

Y1 - 2011/7

N2 - 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.

AB - 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.

KW - Parsing algorithms

KW - Natural language processing

UR - http://aclweb.org/anthology-new/D/D11/D11-1112.pdf

M3 - Conference contribution

SN - 978-1-937284-11-4

SN - 19937284-11-5

SP - 1213

EP - 1221

BT - Proceedings of the ACL Conference on Empirical Methods in Natural Language Processing (EMNLP 2011)

PB - Association for Computational Linguistics

CY - Stroudsburg, PA

T2 - 2011 Conference on Empirical Methods on Natural Language Processing

Y2 - 27 July 2011 through 29 July 2011

ER -

Computation of infix probabilities for probabilistic context-free grammars

Abstract

Conference

Keywords

Access to Document

Other files and links

Fingerprint

Cite this