skip to main content
10.3115/1034678.1034758dlproceedingsArticle/Chapter ViewAbstractPublication PagesaclConference Proceedingsconference-collections
Article
Free access

Estimators for stochastic "Unification-Based" grammars

Published: 20 June 1999 Publication History

Abstract

Log-linear models provide a statistically sound framework for Stochastic "Unification-Based" Grammars (SUBGs) and stochastic versions of other kinds of grammars. We describe two computationally-tractable ways of estimating the parameters of such grammars from a training corpus of syntactic analyses, and apply these to estimate a stochastic version of Lexical-Functional Grammar.

References

[1]
Steven P. Abney. 1997. Stochastic Attribute-Value Grammars. Computational Linguistics, 23(4): 597--617.
[2]
Adam L. Berger, Vincent J. Della Pietra, and Stephen A. Della Pietra. 1996. A maximum entropy approach to natural language processing. Computational Linguistics, 22(1): 39--71.
[3]
J. Besag. 1974. Spatial interaction and the statistical analysis of lattice systems (with discussion). Journal of the Royal Statistical Society, Series D, 36: 192--236.
[4]
J. Besag. 1975. Statistical analysis of non-lattice data. The Statistician, 24: 179--195.
[5]
Zhiyi Chi. 1998. Probability Models for Complex Systems. Ph.D. thesis, Brown University.
[6]
Brendan J. Frey. 1998. Graphical Models for Machine Learning and Digital Communication. The MIT Press, Cambridge, Massachusetts.
[7]
Jerry R. Hobbs and John Bear. 1995. Two principles of parse preference. In Antonio Zampolli, Nicoletta Calzolari, and Martha Palmer, editors, Linguistica Computazionale: Current Issues in Computational Linguistics: In Honour of Don Walker, pages 503--512. Kluwer.
[8]
Frederick Jelinek. 1997. Statistical Methods for Speech Recognition. The MIT Press, Cambridge, Massachusetts.
[9]
John T. Maxwell III and Ronald M. Kaplan. 1995. A method for disjunctive constraint satisfaction. In Mary Dalrymple, Ronald M. Kaplan, John T. Maxwell III, and Annie Zaenen, editors, Formal Issues in Lexical-Functional Grammar, number 47 in CSLI Lecture Notes Series, chapter 14, pages 381--481. CSLI Publications.
[10]
Judea Pearl. 1988. Probabalistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan Kaufmann, San Mateo, California.
[11]
William H. Press, Saul A. Teukolsky, William T. Vetterling, and Brian P. Flannery. 1992. Numerical Recipies in C: The Art of Scientific Computing. Cambridge University Press, Cambridge, England, 2nd edition.

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image DL Hosted proceedings
ACL '99: Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
June 1999
642 pages
ISBN:1558606093

Publisher

Association for Computational Linguistics

United States

Publication History

Published: 20 June 1999

Qualifiers

  • Article

Acceptance Rates

Overall Acceptance Rate 85 of 443 submissions, 19%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)33
  • Downloads (Last 6 weeks)2
Reflects downloads up to 27 Dec 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media