Skip to main content

Learning of Stochastic Context-Free Grammars by Means of Estimation Algorithms and Initial Treebank Grammars

  • Conference paper
  • First Online:

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 2652))

Abstract

In this paper we study the problem of learning of Stochastic Context-Free Grammars by means of estimation algorithms. In these algorithms, which are based on a gradient descendent technique, the initial model play an important role. Here we explore the use of initial SCFG obtained from a treebank corpus. Experiments on the UPenn Treebank corpus are reported.

This work has been partially supported by the Spanish CICYT under contract (TIC2002/04103-C03-03)

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Baker, J.K.: Trainable grammars for speech recognition. In: Klatt, Wolf (eds.) Speech Communications for the 97th Meeting of the Acoustical Society of America, pp. 31–35. Acoustical Society of America (June 1979)

    Google Scholar 

  2. Baum, L.E.: An inequality and associated maximization technique in statistical estimation for probabilistic functions of markov processes. Inequalities 3, 1–8 (1972)

    MathSciNet  Google Scholar 

  3. Charniak, E.: Tree-bank grammars. Technical report, Departament of Computer Science, Brown University, Providence, Rhode Island (January 1996)

    Google Scholar 

  4. Earley, J.: An efficient context-free parsing algorithm. Communications of the ACM 8(6), 451–455 (1970)

    MATH  Google Scholar 

  5. Jelinek, F., Lafferty, J.D.: Computation of the probability of initial substring generation by stochastic context-free grammars. Computational Linguistics 17(3), 315–323 (1991)

    Google Scholar 

  6. Lari, K., Young, S.J.: The estimation of stochastic context-free grammars using the inside-outside algorithm. Computer, Speech and Language 4, 35–56 (1990)

    Article  Google Scholar 

  7. Marcus, M.P., Santorini, B., Marcinkiewicz, M.A.: Building a large annotated corpus of english: the penn treebank. Computational Linguistics 19(2), 313–330 (1993)

    Google Scholar 

  8. Ney, H.: Stochastic grammars and pattern recognition. In: Laface, P., De Mori, R. (eds.) Speech Recognition and Understanding. Recent Advances, pp. 319–344. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  9. Pereira, F., Schabes, Y.: Inside-outside reestimation from partially bracketed corpora. In: Proceedings of the 30th Annual Meeting of the Association for Computational Linguistics, pp. 128–135. University of Delaware (1992)

    Google Scholar 

  10. Rosenfeld, R.: The cmu statistical language modeling toolkit and its use in the 1994 arpa csr evaluation. In: ARPA Spoken Language Technology Workshop, Austin, Texas, USA (1995)

    Google Scholar 

  11. Sánchez, J.A., Benedí, J.M.: Learning of stochastic context-free grammars by means of estimation algorithms. In: Proc. EUROSPEECH 1999, Budapest, Hungary, vol. 4, pp. 1799–1802 (1999)

    Google Scholar 

  12. Stolcke, A.: An efficient probabilistic context-free parsing algorithm that computes prefix probabilities. Computational Linguistics 21(2), 165–200 (1995)

    MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Linares, D., Sánchez, JA., Benedí, JM., Torres, F. (2003). Learning of Stochastic Context-Free Grammars by Means of Estimation Algorithms and Initial Treebank Grammars. In: Perales, F.J., Campilho, A.J.C., de la Blanca, N.P., Sanfeliu, A. (eds) Pattern Recognition and Image Analysis. IbPRIA 2003. Lecture Notes in Computer Science, vol 2652. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-44871-6_47

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-44871-6_47

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40217-6

  • Online ISBN: 978-3-540-44871-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics