The DOI matches its Crossref record; 37 of the 37 references it cites were found in a registry or an index.
Unsupervised named-entity extraction from the Web: An experimental study
Open accessOverview
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
Basic objects in natural categories
Rosch, E., Mervis, C. B., Gray, W. D., Johnson, D. M., & Boyes-Braem, P. (1976) · Cognitive Psychology · doi:10.1016/0010-0285(76)90013-x · Cited by 5,643
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
Thumbs Up or Thumbs Down? Semantic Orientation Applied to Unsupervised Classification of Reviews
Peter, P., & Turney (2002) · Cited by 3,650
Automatic acquisition of hyponyms from large text corpora
Hearst, M. A. (1992) · Proceedings of the 14th conference on Computational linguistics - · doi:10.3115/992133.992154 · Cited by 3,253
On the Optimality of the Simple Bayesian Classifier under Zero-One Loss
Domingos, P., & Pazzani, M. (1997) · Machine Learning · doi:10.1023/a:1007413511361 · Cited by 3,101
Text classification from labeled and unlabeled documents using EM
Nigam, K., Mccallum, A. K., Thrun, S., & Mitchell, T. (2000) · Machine Learning · doi:10.1023/a:1007692713085 · Cited by 2,736 · cited 1×
“Fourth, we plan to investigate EM and related co-training techniques [4, 34] to improve the assessment of extracted instances.”
MethodThumbs up or thumbs down?: semantic orientation applied to unsupervised classification of reviews
Turney, P. D. (2001) · Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02 · doi:10.3115/1073083.1073153 · Cited by 2,352
Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Isabelle, P. (2002) · Cited by 1,635
Measuring praise and criticism: Inference of semantic orientation from association
Turney, P. D., & Littman, M. L. (2003) · ACM Transactions on Information Systems · doi:10.1145/944012.944013 · Cited by 1,502
The Complexity of Markov Decision Processes
Papadimitriou, C. H., & Tsitsiklis, J. N. (1987) · Mathematics of Operations Research · doi:10.1287/moor.12.3.441 · Cited by 1,329 · cited 1×
“Finding optimal policies for POMDPs is known to be PSPACE-complete [38]; however, the particular POMDPs produced by Guo’s mapping have special structure, and Guo asks if polynomial time algorithms for this particular problem may exist.”
BackgroundMining the Web for Synonyms: PMI-IR versus LSA on TOEFL
Turney, P. D. (2001) · Lecture Notes in Computer Science · doi:10.1007/3-540-44795-4_42 · Cited by 1,285
Snowball: extracting relations from large plain-text collections
Agichtein, E., & Gravano, L. (2000) · Proceedings of the fifth ACM conference on Digital libraries · doi:10.1145/336597.336644 · Cited by 1,147
Extracting Patterns and Relations from the World Wide Web
Brin, S. (1999) · Lecture Notes in Computer Science · doi:10.1007/10704656_11 · Cited by 999
Pattern recognition and categorization
Reed, S. K. (1972) · Cognitive Psychology · doi:10.1016/0010-0285(72)90014-x · Cited by 997
Learning Information Extraction Rules for Semi-Structured and Free Text
Soderland, S. (1999) · Machine Learning · doi:10.1023/a:1007562322031 · Cited by 934
Self-citationUnsupervised Models for Named Entity Classification
Collins, M., & Singer, Y. (1999) · Cited by 819
Learning surface text patterns for a Question Answering system
Ravichandran, D., & Hovy, E. (2001) · Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02 · doi:10.3115/1073083.1073092 · Cited by 809
Using Maximum Entropy for Text Classification
Nigam, K., Lafferty, J., & McCallum, A. (1999) · Cited by 781
Web-scale information extraction in knowitall: (preliminary results)
Etzioni, O., Cafarella, M., Downey, D., Kok, S., Popescu, A.-M., Shaked, T., Soderland, S., Weld, D. S., & Yates, A. (2004) · Proceedings of the 13th international conference on World Wide Web · doi:10.1145/988672.988687 · Cited by 747
Self-citationLearning Syntactic Patterns for Automatic Hypernym Discovery
Snow, R., Jurafsky, D. S., & Ng, A. Y. (2004) · neural information processing systems · Cited by 658
Relational Learning of Pattern-Match Rules for Information Extraction.
Califf, M. E., & Mooney, R. J. (1997) · Cited by 507
Learning to construct knowledge bases from the World Wide Web
Craven, M., DiPasquo, D., Freitag, D., McCallum, A., Mitchell, T., Nigam, K., & Slattery, S. (2000) · Artificial Intelligence · doi:10.1016/s0004-3702(00)00004-7 · Cited by 464
Efficiently Inducing Features of Conditional Random Fields
McCallum, A. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1212.2504 · Cited by 363
A bootstrapping method for learning semantic lexicons using extraction pattern contexts
Thelen, M., & Riloff, E. (2002) · Proceedings of the ACL-02 conference on Empirical methods in natural language processing - EMNLP '02 · doi:10.3115/1118693.1118721 · Cited by 361
Types of Cost in Inductive Concept Learning
Turney, P. D. (2002) · arXiv (Cornell University) · doi:10.48550/arxiv.cs/0212034 · Cited by 327
Learning to classify text from labeled and unlabeled documents
Nigam, K., McCallum, A., Thrun, S., & Mitchell, T. M. (1998) · Cited by 327
Information Extraction with HMMs and Shrinkage
Freitag, D., & McCallum, A. K. (1999) · Cited by 237
A flexible learning system for wrapping tables and lists in HTML documents
Cohen, W. W., Hurst, M. F., & Jensen, L. S. (2002) · International World Wide Web Conference (WWW) · doi:10.1145/511446.511477 · Cited by 235
Scaling question answering to the web
Kwok, C., Etzioni, O., & Weld, D. S. (2001) · ACM Transactions on Information Systems · doi:10.1145/502115.502117 · Cited by 230
Self-citationSnowball: extracting relations from large plain-text collections
Agichtein, E., & Gravano, L. (2000) · Columbia Academic Commons (Columbia University) · doi:10.7916/d8v413fm · Cited by 190
A Probabilistic Model of Redundancy in Information Extraction
Downey, D., Etzioni, O., & Soderland, S. (2006) · doi:10.21236/ada454763 · Cited by 175
Self-citationMagnini, B., Negri, M., Prevete, R., et al. (2001) · Annual Meeting of the Association for Computational Linguistics (ACL) · doi:10.3115/1073083.1073154 · Cited by 168
Methods for domain-independent information extraction from the web: an experimental comparison
Etzioni, O., Cafarella, M., Downey, D., Popescu, A.-M., Shaked, T., Soderland, S. G., Weld, D. S., & Yates, A. (2004) · Cited by 111
Self-citationCan we derive general world knowledge from texts?
Schubert, L. K. (2002) · doi:10.3115/1289189.1289263 · Cited by 111
AskMSR: Question Answering Using the Worldwide Web
Banko, M., Brili, E., Dumais, S., & Lin, J. (2002) · Cited by 54
Troubleshooting Under Uncertainty
Heckerman, D. E., Breese, J. S., & Rommelse, K. (1994) · Cited by 52
(1999)
Cited by
Distant supervision for relation extraction without labeled data
Mintz, M., Bills, S., Snow, R., & Jurafsky, D. (2009) · Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP: Volume 2 - ACL-IJCNLP '09 · doi:10.3115/1690219.1690287 · Cited by 2,752
A survey of named entity recognition and classification
Nadeau, D., & Sekine, S. (2007) · Lingvisticae Investigationes · doi:10.1075/li.30.1.03nad · Cited by 2,507
“Finally, marginal types are sometime handled for specific needs: " film " and " scientist " (O. Etzioni et al. 2005), " email address " and " phone number " (I. Witten et al. 1999, D. Maynard et al. 2001), " research area " and " project name " (J. Zhu et al. 2005), " book title " (S. Brin 1998, I.…”
BackgroundMethodExtracting product features and opinions from reviews
Popescu, A.-M., & Etzioni, O. (2005) · Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05 · doi:10.3115/1220575.1220618 · Cited by 1,698
Self-citationA Survey on Deep Learning for Named Entity Recognition
Li, J., Sun, A., Han, J., & Li, C. (2022) · IEEE Transactions on Knowledge and Data Engineering · doi:10.1109/tkde.2020.2981314 · Cited by 1,567
Navigli, R., & Ponzetto, S. P. (2012) · Artificial Intelligence · doi:10.1016/j.artint.2012.07.001 · Cited by 1,465
Metadata
- Authors
- Etzioni, O., Cafarella, M., Downey, D., Popescu, A.-M., Shaked, T., Soderland, S., Weld, D. S., & Yates, A.
- Venue
- Artificial Intelligence
- Publisher
- Elsevier BV
- Published
- 2005-06
- Volume
- 165
- Issue
- 1
- Pages
- 91-134
- ISSN
- 0004-3702 (ISSN-L)
- OpenAlex
- W2148540243
- Cited by
- 1,124
- References
- 37
- FWCI
- 165.38
- Type
- journal article
- 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.