Weakly Restricted Stochastic Grammars

Rieks op den Akker, Hugo ter Doest

    Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

    10 Downloads (Pure)


    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 languageEnglish
    Title of host publicationCOLING 1994
    Subtitle of host publication15th International Conference on Computational Linguistics
    EditorsM. Nagao
    PublisherAssociation for Computational Linguistics (ACL)
    Number of pages6
    Publication statusPublished - Aug 1994
    Event15th International Conference on Computational Linguistics, COLING 1994 - Kyoto, Japan
    Duration: 5 Aug 19949 Aug 1994
    Conference number: 15


    Conference15th International Conference on Computational Linguistics, COLING 1994
    Abbreviated titleCOLING


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

    Fingerprint Dive into the research topics of 'Weakly Restricted Stochastic Grammars'. Together they form a unique fingerprint.

    Cite this