Skip to main content
Springer Nature Link
Log in

A Theory of Stochastic Grammars

  • Conference paper
  • First Online:
Natural Language Processing — NLP 2000 (NLP 2000)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 1835))

Included in the following conference series:

  • 1043 Accesses

Abstract

A novel theoretical framework for describing stochastic grammars is proposed based on a small set of basic random variables that generate tree structures and relate them to surface strings. A number of prominent statistical language models are formulated as stochastic processes over these basic random variables.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. David Magerman. Statistical decision-tree models for parsing. Procs. 33rd Annual Meeting of the Association for Computational Linguistics, pages 276–283, 1995.

    Google Scholar 

  2. Hiyan Alshawi. Head automata and bilingual tiling: Translation with minimal representations. Procs. 34th Annual Meeting of the Association for Computational Linguistics, pages 167–176, 1996.

    Google Scholar 

  3. Michael Collins. Three generative, lexicalized models for statistical parsing. Procs. 35th Annual Meeting of the Association for Computational Linguistics, pages 16–23, 1997.

    Google Scholar 

  4. T. L. Booth and R. A. Thompson. Applying probability measures to abstract languages. IEEE Transactions on Computers, C-22(5), pages 442–450, 1973.

    Article  MathSciNet  Google Scholar 

  5. Ted Briscoe and John Carroll. Generalized probabilistic lr parsing of natural language (corpora) with unification-based grammars. Computational Linguistics, 19(1):25–59, 1993.

    Google Scholar 

  6. Ezra Black, Fred Jelinek, John Lafferty, David Magerman, Robert Mercer, and Salim Roukos. Towards history-based grammars: Using richer models for probabilistic parsing. Procs. 28th Annual Meeting of the Association for Computational Linguistics, pages 31–37, 1993.

    Google Scholar 

  7. Rens Bod. Enriching Linguistics with Statistics: Performance Models of Natural Language. ILLC Dissertation Series 1995-14, Amsterdam, 1995.

    Google Scholar 

  8. Yves Schabes. Stochastic lexicalized tree-adjoining grammars. Proc. 14th International Conference on Computational Linguistics, pages 426–432, 1992.

    Google Scholar 

  9. Khalil Sima’an. Computational complexity of probabilistic disambiguations by means of tree-grammars. Procs. 16th International Conference on Computational Linguistics, page at the very end, 1996.

    Google Scholar 

  10. Saul Gorn. Processors for infinite codes of shannon-fano type. Symp. Math. Theory of Automata, pages--–--, 1962.

    Google Scholar 

  11. Lucien Tesniére. Éléments de Syntaxe Structurale. Libraire C. Klincksieck, Paris, 1959.

    Google Scholar 

  12. Jacques Brel. Ne me quitte pas. La Valse á Mille Temps (PHI 6325.205), 1959.

    Google Scholar 

  13. Gerald Gazdar, Ewan Klein, Geoffrey K. Pullum, and Ivan A. Sag. Generalized Phrase Structure Grammar. Basil Blackwell Publishing, Oxford, England, 1985. Also published by Harvard University Press, Cambridge, MA.

    Google Scholar 

  14. Zhiyi Chi. Statistical properties of probabilistic context-free grammars. Computational Linguistics, 25(1):131–160, 1999.

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Xerox Research Centre Europe, 6, chemin de Maupertuis, 38240, Meylan, France

    Christer Samuelsson

Authors
  1. Christer Samuelsson
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Computer Engineering Department and Computer Technology Institute, University of Patras, 26500, Patras, Greece

    Dimitris N. Christodoulakis

Rights and permissions

Reprints and permissions

Copyright information

© 2000 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Samuelsson, C. (2000). A Theory of Stochastic Grammars. In: Christodoulakis, D.N. (eds) Natural Language Processing — NLP 2000. NLP 2000. Lecture Notes in Computer Science(), vol 1835. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45154-4_9

Download citation

  • DOI: https://doi.org/10.1007/3-540-45154-4_9

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-67605-8

  • Online ISBN: 978-3-540-45154-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics