We found a match
Your institution may have access to this item. Find your institution then sign in to continue.
- Title
Prefix probabilities for linear context-free rewriting systems.
- Authors
Nederhof, Mark-Jan; Satta, Giorgio
- 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.
- Subjects
PROBABILITY theory; LANGUAGE &; languages; RESEARCH methodology; REWRITING systems (Computer science); COMPARATIVE grammar
- Publication
Journal of Logic & Computation, 2014, Vol 24, Issue 2, p331
- ISSN
0955-792X
- Publication type
Article
- DOI
10.1093/logcom/exs081