Prefix Probability for Probabilistic Synchronous Context-Free Grammars

Mark Jan Nederhof, Giorgio Satta

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

3 Citations (Scopus)

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 languageEnglish
Title of host publicationProceedings of the 49th Annual Meeting of the Association for Computational Linguistics
Subtitle of host publicationHuman Language Technologies, Portland, Oregon, June 19-24 , 2011.
EditorsDekang Lin, Yuji Matsumoto, Rada Mihalcea
PublisherAssociation for Computational Linguistics
Pages460–469
Number of pages10
ISBN (Print)978-1-932432-87-9
Publication statusPublished - 2011
Event49th Annual Meeting of the Association for Computational Linguistics - Portland, Oregon, United States
Duration: 19 Jun 201124 Jun 2011

Conference

Conference49th Annual Meeting of the Association for Computational Linguistics
Country/TerritoryUnited States
CityPortland, Oregon
Period19/06/1124/06/11

Keywords

  • parsing algorithms
  • Natural language processing

Fingerprint

Dive into the research topics of 'Prefix Probability for Probabilistic Synchronous Context-Free Grammars'. Together they form a unique fingerprint.

Cite this