Prefix probabilities for linear context-free rewriting systems

Mark Jan Nederhof, Giorgio Satta

Research output: Contribution to journalArticlepeer-review

1 Citation (Scopus)

Abstract

We present a novel method for the computation of so-called prefix probabilities for linear context-free rewriting systems. Our technique streamlines previous procedures to compute prefix probabilities for probabilistic context-free grammars, probabilistic synchronous context-free grammars and probabilistic 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
Pages (from-to)331-350
Number of pages33
JournalJournal of Logic and Computation
Volume24
Issue number2
Early online date23 Jan 2013
DOIs
Publication statusPublished - Apr 2014

Keywords

  • Linear context-free rewriting systems
  • Language models
  • Grammar transformations
  • Probablistic grammars
  • Prefix probability

Fingerprint

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

Cite this