The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
Unsupervised word sense disambiguation rivaling supervised methods
Open accessAbstract
This paper presents an unsupervised learning algorithm for sense disambiguation that, when trained on unannotated English text, rivals the performance of supervised techniques that require time-consuming hand annotations. The algorithm is based on two powerful constraints---that words tend to have one sense per discourse and one sense per collocation---exploited in an iterative bootstrapping procedure. Tested accuracy exceeds 96%.
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
Maximum Likelihood from Incomplete Data Via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1977) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1977.tb01600.x · Cited by 50,444
Maximum Likelihood from Incomplete Data via the EM Algorithm
Dempster, A. P., Laird, N. M., & Rubin, D. B. (1976) · Cited by 4,517
Introduction to WordNet: An On-line Lexical Database*
Miller, G. A., Beckwith, R., Fellbaum, C., Gross, D., & Miller, K. J. (1990) · International Journal of Lexicography · doi:10.1093/ijl/3.4.235 · Cited by 4,197
Lesk, M. (1986) · Proceedings of the 5th annual international conference on Systems documentation - SIGDOC '86 · doi:10.1145/318723.318728 · Cited by 1,770
Baum, L. E. (1972) · Medical Entomology and Zoology · Cited by 1,405
Inference and disputed authorship : The Federalist
Mosteller, F. C., & Wallace, D. L. (1964) · Medical Entomology and Zoology · Cited by 904
Rivest, R. L. (1987) · Machine Learning · doi:10.1007/bf00058680 · Cited by 886
Word-sense disambiguation using statistical models of Roget's categories trained on large corpora
Yarowsky, D. (1992) · Proceedings of the 14th conference on Computational linguistics - · doi:10.3115/992133.992140 · Cited by 663
Self-citationA 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
Self-citationYarowsky, D. (1993) · Proceedings of the workshop on Human Language Technology - HLT '93 · doi:10.3115/1075671.1075731 · Cited by 376
Self-citationWord-sense disambiguation using statistical methods
Brown, P. F., Pietra, S. A. D., Pietra, V. J. D., & Mercer, R. L. (1991) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/981344.981378 · Cited by 365
Yarowsky, D. (1994) · Proceedings of the 32nd annual meeting on Association for Computational Linguistics - · doi:10.3115/981732.981745 · Cited by 356
Self-citationSchütze, H. (1992) · Cited by 300
A corpus-based approach to language learning
Brill, E. (1993) · Cited by 272
Word sense disambiguation using a second language monolingual corpus
Dagan, I., & Itai, A. (1994) · Cited by 263
Word-sense disambiguation using decomposable models
Bruce, R. F., & Wiebe, J. (1994) · Proceedings of the conference - Association for Computational Linguistics. Meeting · doi:10.3115/981732.981752 · Cited by 204
Corpus-based statistical sense resolution
Leacock, C., Towell, G. G., & Voorhees, E. M. (1993) · DARPA Workshop on Speech and Natural Language (HLT) · doi:10.3115/1075671.1075730 · Cited by 154
A stochastic parts program and noun phrase parser for unrestricted text
Church, K. (2003) · IEEE International Conference on Acoustics Speech and Signal Processing · doi:10.1109/icassp.1989.266522 · Cited by 131
Cited by
Combining labeled and unlabeled data with co-training
Blum, A., & Mitchell, T. (1998) · Proceedings of the eleventh annual conference on Computational learning theory · doi:10.1145/279943.279962 · Cited by 5,495
(2009) · Minds at UW (University of Wisconsin) · Cited by 4,791
(2006) · The MIT Press eBooks · doi:10.7551/mitpress/9780262033589.001.0001 · Cited by 4,280
A survey on semi-supervised learning
van Engelen, J. E., & Hoos, H. H. (2020) · Machine Learning · doi:10.1007/s10994-019-05855-6 · Cited by 2,666
Self-Training With Noisy Student Improves ImageNet Classification
Xie, Q., Luong, M.-T., Hovy, E., & Le, Q. V. (2020) · 2020 IEEE/CVF Conference on Computer Vision and Pattern Recognition (CVPR) · doi:10.1109/cvpr42600.2020.01070 · Cited by 2,393
Metadata
- Authors
- Yarowsky, D.
- Venue
- Proceedings of the 33rd annual meeting on Association for Computational Linguistics -
- Published
- 1995
- Pages
- 189-196
- OpenAlex
- W2101210369
- Cited by
- 2,385
- References
- 18
- FWCI
- 25.24
- 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.