Weakly Restricted Stochastic Grammars

Rieks op den Akker; Hugo ter Doest

doi:10.3115/991250.991298

Weakly Restricted Stochastic Grammars

Rieks op den Akker, Hugo ter Doest

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

19 Downloads (Pure)

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.

Original language	English
Title of host publication	COLING 1994
Subtitle of host publication	15th International Conference on Computational Linguistics
Editors	M. Nagao
Publisher	Association for Computational Linguistics (ACL)
Pages	929-934
Number of pages	6
Volume	2
DOIs	https://doi.org/10.3115/991250.991298
Publication status	Published - Aug 1994
Event	15th International Conference on Computational Linguistics, COLING 1994 - Kyoto, Japan Duration: 5 Aug 1994 → 9 Aug 1994 Conference number: 15

Conference

Conference	15th International Conference on Computational Linguistics, COLING 1994
Abbreviated title	COLING
Country/Territory	Japan
City	Kyoto
Period	5/08/94 → 9/08/94

Keywords

Stochastic languages
Grammar inference
Grammars
HMI-SLT: Speech and Language Technology

Access to Document

10.3115/991250.991298

OpdenAkker1994weaklyFinal published version, 517 KB

Cite this

@inproceedings{67af60253dcd480b83e9a99f829ddc6b,

title = "Weakly Restricted Stochastic Grammars",

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.",

keywords = "Stochastic languages, Grammar inference, Grammars, HMI-SLT: Speech and Language Technology",

author = "{op den Akker}, Rieks and {ter Doest}, Hugo",

year = "1994",

month = aug,

doi = "10.3115/991250.991298",

language = "English",

volume = "2",

pages = "929--934",

editor = "M. Nagao",

booktitle = "COLING 1994",

publisher = "Association for Computational Linguistics (ACL)",

address = "United States",

note = "15th International Conference on Computational Linguistics, COLING 1994, COLING ; Conference date: 05-08-1994 Through 09-08-1994",

}

op den Akker, R & ter Doest, H 1994, Weakly Restricted Stochastic Grammars. in M Nagao (ed.), COLING 1994: 15th International Conference on Computational Linguistics. vol. 2, Association for Computational Linguistics (ACL), pp. 929-934, 15th International Conference on Computational Linguistics, COLING 1994, Kyoto, Japan, 5/08/94. https://doi.org/10.3115/991250.991298

TY - GEN

T1 - Weakly Restricted Stochastic Grammars

AU - op den Akker, Rieks

AU - ter Doest, Hugo

N1 - Conference code: 15

PY - 1994/8

Y1 - 1994/8

N2 - 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.

AB - 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.

KW - Stochastic languages

KW - Grammar inference

KW - Grammars

KW - HMI-SLT: Speech and Language Technology

U2 - 10.3115/991250.991298

DO - 10.3115/991250.991298

M3 - Conference contribution

VL - 2

SP - 929

EP - 934

BT - COLING 1994

A2 - Nagao, M.

PB - Association for Computational Linguistics (ACL)

T2 - 15th International Conference on Computational Linguistics, COLING 1994

Y2 - 5 August 1994 through 9 August 1994

ER -

Weakly Restricted Stochastic Grammars

Abstract

Conference

Keywords

Access to Document

Fingerprint

Cite this