Weakly restricted stochastic grammars

Authors:
Rieks op den Akker;Hugo ter Doest
Affiliations:
University of Twente, Enschede, The Netherlands;University of Twente, Enschede, The Netherlands
Venue:
COLING '94 Proceedings of the 15th conference on Computational linguistics - Volume 2
Year:
1994

Citing 3
Cited 0

Probabilistic Languages: A Review and Some Open Questions

ACM Computing Surveys (CSUR)
Computation of the probability of initial substring generation by stochastic context-free grammars

Computational Linguistics
Generalized probabilistic LR parsing of natural language (Corpora) with unification-based grammars

Computational Linguistics - Special issue on using large corpora: I

Quantified Score

Hi-index	0.00

Visualization

Abstract

A new type of stochastic grammars in introduced for investigation: weakly restricted stochastic grammars. In this paper we will concentrate on the consistency problem. To find conditions for stochastic grammars to be consistent, the theory of multitype Galton-Watson brancning processes and generating functions is of central importance. The unrestricted stochastic grammar formalism generates the same class of languages as the weakly restricted formalism. The inside-outside algorithm is adapted for use with weakly restricted grammars.