Prefix Probability for Probabilistic Synchronous Context-Free Grammars

Mark Jan Nederhof; Giorgio  Satta

Prefix Probability for Probabilistic Synchronous Context-Free Grammars

School of Computer Science

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

Abstract

We present a method for the computation of prefix probabilities for synchronous context-free grammars. Our framework is fairly general and relies on the combination of a simple, novel grammar transformation and standard techniques to bring grammars into normal forms.

Original language	English
Title of host publication	Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics
Subtitle of host publication	Human Language Technologies, Portland, Oregon, June 19-24 , 2011.
Editors	Dekang Lin, Yuji Matsumoto, Rada Mihalcea
Publisher	Association for Computational Linguistics
Pages	460–469
Number of pages	10
ISBN (Print)	978-1-932432-87-9
Publication status	Published - 2011
Event	49th Annual Meeting of the Association for Computational Linguistics - Portland, Oregon, United States Duration: 19 Jun 2011 → 24 Jun 2011

Conference

Conference	49th Annual Meeting of the Association for Computational Linguistics
Country/Territory	United States
City	Portland, Oregon
Period	19/06/11 → 24/06/11

Keywords

parsing algorithms
Natural language processing

Cite this

Nederhof, M. J., & Satta, G. (2011). Prefix Probability for Probabilistic Synchronous Context-Free Grammars. In D. Lin, Y. Matsumoto, & R. Mihalcea (Eds.), Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Portland, Oregon, June 19-24 , 2011. (pp. 460–469). Association for Computational Linguistics.

Nederhof, Mark Jan ; Satta, Giorgio . / Prefix Probability for Probabilistic Synchronous Context-Free Grammars. Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Portland, Oregon, June 19-24 , 2011.. editor / Dekang Lin ; Yuji Matsumoto ; Rada Mihalcea. Association for Computational Linguistics, 2011. pp. 460–469

@inproceedings{c9d057a485ab421396ef6ce3713a13b9,

title = "Prefix Probability for Probabilistic Synchronous Context-Free Grammars",

abstract = "We present a method for the computation of prefix probabilities for synchronous context-free grammars. Our framework is fairly general and relies on the combination of a simple, novel grammar transformation and standard techniques to bring grammars into normal forms.",

keywords = "parsing algorithms, Natural language processing",

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

year = "2011",

language = "English",

isbn = "978-1-932432-87-9",

pages = "460–469",

editor = "Dekang Lin and Yuji Matsumoto and Rada Mihalcea",

booktitle = "Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics",

publisher = "Association for Computational Linguistics",

note = "49th Annual Meeting of the Association for Computational Linguistics ; Conference date: 19-06-2011 Through 24-06-2011",

}

Nederhof, MJ & Satta, G 2011, Prefix Probability for Probabilistic Synchronous Context-Free Grammars. in D Lin, Y Matsumoto & R Mihalcea (eds), Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Portland, Oregon, June 19-24 , 2011.. Association for Computational Linguistics, pp. 460–469, 49th Annual Meeting of the Association for Computational Linguistics, Portland, Oregon, United States, 19/06/11.

Prefix Probability for Probabilistic Synchronous Context-Free Grammars. / Nederhof, Mark Jan; Satta, Giorgio .
Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, Portland, Oregon, June 19-24 , 2011.. ed. / Dekang Lin; Yuji Matsumoto; Rada Mihalcea. Association for Computational Linguistics, 2011. p. 460–469.

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

TY - GEN

T1 - Prefix Probability for Probabilistic Synchronous Context-Free Grammars

AU - Nederhof, Mark Jan

AU - Satta, Giorgio

PY - 2011

Y1 - 2011

N2 - We present a method for the computation of prefix probabilities for synchronous context-free grammars. Our framework is fairly general and relies on the combination of a simple, novel grammar transformation and standard techniques to bring grammars into normal forms.

AB - We present a method for the computation of prefix probabilities for synchronous context-free grammars. Our framework is fairly general and relies on the combination of a simple, novel grammar transformation and standard techniques to bring grammars into normal forms.

KW - parsing algorithms

KW - Natural language processing

UR - https://www.aclweb.org/anthology/P/P11/P11-1047.pdf

UR - http://aclweb.org/anthology//P/P11/

M3 - Conference contribution

SN - 978-1-932432-87-9

SP - 460

EP - 469

BT - Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics

A2 - Lin, Dekang

A2 - Matsumoto, Yuji

A2 - Mihalcea, Rada

PB - Association for Computational Linguistics

T2 - 49th Annual Meeting of the Association for Computational Linguistics

Y2 - 19 June 2011 through 24 June 2011

ER -

Prefix Probability for Probabilistic Synchronous Context-Free Grammars

Abstract

Conference

Keywords

Other files and links

Fingerprint

Cite this