The DOI matches its Crossref record.
A Gaussian Prior for Smoothing Maximum Entropy Models
Abstract
In certain contexts, maximum entropy (ME) modeling can be viewed as maximum likelihood train-ing for exponential models, and like other maximum likelihood methods is prone to overfitting of training data. Several smoothing methods for maximum entropy models have been proposed to address this problem, but previous results do not make it clear how these smoothing methods com-pare with smoothing methods for other types of related models. In this work, we survey previous work in maximum entropy smoothing and compare the performance of several of these algorithms with conventional techniques for smoothing n-gram language models. Because of the mature body of research in n-gram model smoothing and the close connection between maximum entropy and conventional n-gram models, this domain is well-suited to gauge the performance of maximum entropy smoothing methods. Over a large number of data sets, we find that an ME smoothing method proposed to us by Lafferty [1] performs as well as or better than all other algorithms under consideration. This general and efficient method involves using a Gaussian prior on the parame-ters of the model and selecting maximum a posteriori instead of maximum likelihood parameter values. We contrast this method with previous n-gram smoothing methods to explain its superior performance.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cited by
Shallow parsing with conditional random fields
Sha, F., & Pereira, F. (2003) · Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - NAACL '03 · doi:10.3115/1073445.1073473 · Cited by 1,246
Domain Adaptation for Statistical Classifiers
Daume III, H., & Marcu, D. (2006) · Journal of Artificial Intelligence Research · doi:10.1613/jair.1872 · Cited by 816
Discriminative Reranking for Natural Language Parsing
Collins, M., & Koo, T. (2005) · Computational Linguistics · doi:10.1162/0891201053630273 · Cited by 710
A bit of progress in language modeling
Goodman, J. T. (2001) · Computer Speech & Language · doi:10.1006/csla.2001.0174 · Cited by 469
Developing a Robust Part-of-Speech Tagger for Biomedical Text
Tsuruoka, Y., Tateishi, Y., Kim, J.-D., Ohta, T., McNaught, J., Ananiadou, S., & Tsujii, J. (2005) · Lecture Notes in Computer Science · doi:10.1007/11573036_36 · Cited by 436
Wide-Coverage Efficient Statistical Parsing with CCG and Log-Linear Models
Clark, S., & Curran, J. R. (2007) · Computational Linguistics · doi:10.1162/coli.2007.33.4.493 · Cited by 410
Collective multi-label classification
Ghamrawi, N., & McCallum, A. (2005) · Proceedings of the 14th ACM international conference on Information and knowledge management · doi:10.1145/1099554.1099591 · Cited by 410
Wilson, C. (2006) · Cognitive Science · doi:10.1207/s15516709cog0000_89 · Cited by 398
Efficiently Inducing Features of Conditional Random Fields
McCallum, A. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1212.2504 · Cited by 363
Table extraction using conditional random fields
Pinto, D., McCallum, A., Wei, X., & Croft, W. B. (2003) · Proceedings of the 26th annual international ACM SIGIR conference on Research and development in informaion retrieval · doi:10.1145/860435.860479 · Cited by 355
Finding advertising keywords on web pages
Yih, W.-T., Goodman, J., & Carvalho, V. R. (2006) · Proceedings of the 15th international conference on World Wide Web · doi:10.1145/1135777.1135813 · Cited by 336
Enriching speech recognition with automatic detection of sentence boundaries and disfluencies
Liu, Y., Shriberg, E., Stolcke, A., Hillard, D., Ostendorf, M., & Harper, M. (2006) · IEEE Transactions on Audio, Speech and Language Processing · doi:10.1109/tasl.2006.878255 · Cited by 270
Learning for semantic parsing with statistical machine translation
Wong, Y. W., & Mooney, R. J. (2006) · Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics - · doi:10.3115/1220835.1220891 · Cited by 263
Chung, G. Y.-C. (2009) · Journal of Biomedical Informatics · doi:10.1016/j.jbi.2008.12.011 · Cited by 34
Metadata
- Authors
- Chen, S. F., & Rosenfeld, R.
- Publisher
- Defense Technical Information Center
- Published
- 1999-02-01
- OpenAlex
- W1592796124
- Cited by
- 345
- References
- 0
- Type
- report
- Language
- en
- Open access
- closed
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.