Weakly Restricted Stochastic Grammars

Share/Save/Bookmark

Akker, H.J.A. op den and Doest, H.W.L. ter (1994) Weakly Restricted Stochastic Grammars. In: COLING 1994, 15th International Conference on Computational Linguistics, 5-9 Aug 1994, Kyoto, Japan (pp. pp. 929-934).

open access
[img]
Preview
PDF
529kB
Abstract:A new type of stochastic grammars is 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 branching 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.
Item Type:Conference or Workshop Item
Faculty:
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/64321
Official URL:http://acl.ldc.upenn.edu/C/C94/C94-2150.pdf
Export this item as:BibTeX
EndNote
HTML Citation
Reference Manager

 

Repository Staff Only: item control page

Metis ID: 119292