The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Scaling to very very large corpora for natural language disambiguation
Open accessAbstract
The amount of readily available on-line text has reached hundreds of billions of words and continues to grow. Yet for most core natural language tasks, algorithms continue to be optimized, tested and compared after training on corpora consisting of only one million words or less. In this paper, we evaluate the performance of different learning methods on a prototypical natural language disambiguation task, confusion set disambiguation, when trained on orders of magnitude more labeled data than has previously been used. We are fortunate that for this particular application, correctly labeled training data is free. Since this will often not be the case, we examine methods for effectively exploiting very large corpora when labeled data comes at a cost.
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
Cites
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
Unsupervised word sense disambiguation rivaling supervised methods
Yarowsky, D. (1995) · Proceedings of the 33rd annual meeting on Association for Computational Linguistics - · doi:10.3115/981658.981684 · Cited by 2,385
A sequential algorithm for training text classifiers
Lewis, D., & Gale, W. A. (1994) · arXiv (Cornell University) · doi:10.5555/188490.188495 · Cited by 1,731
Editorial: On Machine Learning
Langley, P. (1986) · Machine Learning · doi:10.1023/a:1022687019898 · Cited by 951
A method for disambiguating word senses in a large corpus
Gale, W. A., Church, K., & Yarowsky, D. (1992) · Computers and the Humanities · doi:10.1007/bf00136984 · Cited by 532
Committee-Based Sampling For Training Probabilistic Classifiers
Dagan, I., & Engelson, S. P. (1995) · Machine Learning Proceedings 1995 · doi:10.1016/b978-1-55860-377-6.50027-x · Cited by 499
Tagging English text with a probabilistic model
Mérialdo, B. (1994) · Cited by 474
Yarowsky, D. (1994) · Proceedings of the 32nd annual meeting on Association for Computational Linguistics - · doi:10.3115/981732.981745 · Cited by 356
Learning to classify text from labeled and unlabeled documents
Nigam, K., McCallum, A., Thrun, S., & Mitchell, T. M. (1998) · Cited by 327
A Winnow-Based Approach to Context-Sensitive Spelling Correction
Golding, A. R., & Roth, D. (1999) · Machine Learning · doi:10.1023/a:1007545901558 · Cited by 291
Eugene Charniak, D. (1996) · National Conference on Artificial Intelligence · Cited by 266
The Role of Unlabeled Data in Supervised Learning
Mitchell, T. M. (2004) · Springer eBooks · doi:10.1007/978-1-4020-2783-3_7 · Cited by 150
Classifier combination for improved lexical disambiguation
Brill, E., & Jun, W. (1998) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/980845.980876 · Cited by 129
Self-citationA Bayesian hybrid method for context-sensitive spelling correctionPreprint
Golding, A. R. (1996) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9606001 · Cited by 113
Exploiting Diversity in Natural Language Processing: Combining ParsersPreprint
Henderson, J. C., & Brill, E. (2000) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0006003 · Cited by 108
Self-citationImproving data driven wordclass tagging by system combination
van Halteren, H., Zavrel, J., & Daelemans, W. M. P. (1998) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/980845.980928 · Cited by 104
Mitigating the paucity-of-data problem
Banko, M., & Brill, E. (2001) · International Conference on Human Language Technology Research · doi:10.3115/1072133.1072204 · Cited by 96
Self-citationContextual spelling correction using latent semantic analysis
Jones, M. P., & Martin, J. (1997) · Conference on Applied Natural Language Processing · doi:10.3115/974557.974582 · Cited by 65
Cited by
80 Million Tiny Images: A Large Data Set for Nonparametric Object and Scene Recognition
Torralba, A., Fergus, R., & Freeman, W. T. (2008) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/tpami.2008.128 · Cited by 1,921
Cheap and fast---but is it good?: evaluating non-expert annotations for natural language tasks
Snow, R., O'Connor, B., Jurafsky, D., & Ng, A. Y. (2008) · Proceedings of the Conference on Empirical Methods in Natural Language Processing - EMNLP '08 · doi:10.3115/1613715.1613751 · Cited by 1,887
Scaling Laws for Neural Language Models
Kaplan, J., McCandlish, S., Henighan, T., Brown, T. B., Chess, B., Child, R., Gray, S., Radford, A., Wu, J., & Amodei, D. (2020) · arXiv · doi:10.48550/arxiv.2001.08361 · Cited by 9,550
“Some early [BB01, Goo01] work found power-law scalings between performance and dataset size.”
BackgroundMarketing Analytics for Data-Rich Environments
Wedel, M., & Kannan, P. K. (2016) · Journal of Marketing · doi:10.1509/jm.15.0413 · Cited by 1,261
Introduction to the Special Issue on the Web as Corpus
Kilgarriff, A., & Grefenstette, G. (2003) · Computational Linguistics · doi:10.1162/089120103322711569 · Cited by 929
Metadata
- Authors
- Banko, M., & Brill, E.
- Venue
- Proceedings of the 39th Annual Meeting on Association for Computational Linguistics - ACL '01
- Published
- 2001
- Pages
- 26-33
- OpenAlex
- W2157963512
- Cited by
- 675
- References
- 18
- FWCI
- 12.29
- Type
- conference paper
- Language
- en
- Open access
- bronze
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.