Prefix probabilities for linear context-free rewriting systems
MJ Nederhof, G Satta - Journal of Logic and Computation, 2014 - academic.oup.com
Journal of Logic and Computation, 2014•academic.oup.com
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.
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.
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.
Oxford University PressShowing the best result for this search. See all results