Prefix probabilities for linear context-free rewriting systems

Mark Jan Nederhof, Giorgio Satta

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

4 Downloads (Pure)

Abstract

We present a novel method for the computation of prefix probabilities for linear
context-free rewriting systems. Our approach streamlines previous procedures to
compute prefix probabilities for context-free grammars, synchronous context-free grammars and tree adjoining grammars. In addition, the methodology is general enough to be used for a wider range of problems involving, for example, several prefixes.
Original languageEnglish
Title of host publicationProceedings of the 12th International Conference on Parsing Technologies (IWPT 2011)
Place of PublicationStroudsburg, PA
PublisherAssociation for Computational Linguistics
Pages151–162
Number of pages12
ISBN (Print)978-1-932432-04-6
Publication statusPublished - 5 Oct 2011
Event12th International Conference on Parsing Technologies - Dublin, Ireland
Duration: 5 Oct 20107 Oct 2010

Conference

Conference12th International Conference on Parsing Technologies
Country/TerritoryIreland
CityDublin
Period5/10/107/10/10

Keywords

  • Parsing algorithms
  • Natural language processing

Fingerprint

Dive into the research topics of 'Prefix probabilities for linear context-free rewriting systems'. Together they form a unique fingerprint.

Cite this