The DOI matches its Crossref record; 55 of the 55 references it cites were found in a registry or an index.
Machine Learning for Information Extraction in Informal Domains
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
(1992) · Cited by 23,431
Breiman, L. (1996) · Machine Learning · doi:10.1007/bf00058655 · Cited by 16,325
WordNet: a lexical database for English
Miller, G. A. (1995) · Communications of the ACM · doi:10.1145/219717.219748 · Cited by 14,015
(1973) · CERN Document Server (European Organization for Nuclear Research) · Cited by 12,895
An introduction to hidden Markov models
Rabiner, L., & Juang, B. (1986) · IEEE ASSP Magazine · doi:10.1109/massp.1986.1165342 · Cited by 4,775
Language identification in the limit
Gold, E. M. (1967) · Information and Control · doi:10.1016/s0019-9958(67)91165-5 · Cited by 3,572
The Automatic Creation of Literature Abstracts
Luhn, H. P. (1958) · IBM Journal of Research and Development · doi:10.1147/rd.22.0159 · Cited by 3,246
Relevance feedback in information retrieval
Rocchio, J. J. (1971) · Medical Entomology and Zoology · Cited by 2,680
The SMART Retrieval System—Experiments in Automatic Document Processing
Salton, G. (1971) · CERN Document Server (European Organization for Nuclear Research) · Cited by 2,252
The Weighted Majority Algorithm
Littlestone, N., & Warmuth, M. K. (1994) · Information and Computation · doi:10.1006/inco.1994.1009 · Cited by 1,975
Very Simple Classification Rules Perform Well on Most Commonly Used Datasets
Holte, R. C. (1993) · Machine Learning · doi:10.1023/a:1022631118932 · Cited by 1,791
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
Learning Logical Definitions from Relations
Quinlan, J. R. (1990) · Machine Learning · doi:10.1023/a:1022699322624 · Cited by 1,644
Mitchell, T. M. (1982) · Artificial Intelligence · doi:10.1016/0004-3702(82)90040-6 · Cited by 1,412
Pattern Classification and Scene Analysis.
Grenander, U., Duda, R. O., & Hart, P. E. (1974) · Journal of the American Statistical Association · doi:10.2307/2286028 · Cited by 1,006
A theory and methodology of inductive learning
Michalski, R. S. (1983) · Artificial Intelligence · doi:10.1016/0004-3702(83)90016-4 · Cited by 1,002
Rivest, R. L. (1987) · Machine Learning · doi:10.1007/bf00058680 · Cited by 886
Rule induction with CN2: Some recent improvements
Clark, P., & Boswell, R. (1991) · Lecture Notes in Computer Science · doi:10.1007/bfb0017011 · Cited by 859
Automated learning of decision rules for text categorization
Apté, C., Damerau, F., & Weiss, S. M. (1994) · ACM Transactions on Information Systems · doi:10.1145/183422.183423 · Cited by 859
Complexity of automaton identification from given data
Gold, E. M. (1978) · Information and Control · doi:10.1016/s0019-9958(78)90562-4 · Cited by 771
(1983) · Springer eBooks · doi:10.1007/978-3-662-12405-5 · Cited by 760
Nymble: a high-performance learning name-finder
Bikel, D. M., Miller, S., Schwartz, R., & Weischedel, R. (1997) · Proceedings of the fifth conference on Applied natural language processing - · doi:10.3115/974557.974586 · Cited by 726
Kohavi, R. (1995) · Lecture Notes in Computer Science · doi:10.1007/3-540-59286-5_57 · Cited by 712
Beyond Independence: Conditions for the Optimality of the Simple Bayesian Classifier.
Domingos, P., & Pazzani, M. J. (1996) · Cited by 690
Parsing English with a Link Grammar
Sleator, D. D., & Temperley, D. (1995) · Cited by 678
Learning to extract symbolic knowledge from the World Wide Web
Craven, M. W., DiPasquo, D., Freitag, D., McCallum, A., Mitchell, T. M., Nigam, K., & Slattery, S. (1998) · National Conference on Artificial Intelligence · Cited by 662
Self-citationCesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., & Warmuth, M. K. (1997) · Journal of the ACM · doi:10.1145/258128.258179 · Cited by 634
Automatically generating extraction patterns from untagged text
Riloff, E. (1996) · Cited by 621
Automatic Indexing: An Experimental Inquiry
Maron, M. E. (1961) · Journal of the ACM · doi:10.1145/321075.321084 · Cited by 570 · cited 1×
“The idea of a Bayesian method for text classification is almost as old as the idea of automatic text classification itself (Maron, 1961).”
MethodInference of Reversible Languages
Angluin, D. (1982) · Journal of the ACM · doi:10.1145/322326.322334 · Cited by 526
Relational Learning of Pattern-Match Rules for Information Extraction.
Califf, M. E., & Mooney, R. J. (1997) · Cited by 507
Estimating probabilities: a crucial task in machine learning
Cestnik, B. (1990) · European Conference on Artificial Intelligence · Cited by 459
Selecting a classification method by cross-validation
Schaffer, C. (1993) · Machine Learning · doi:10.1007/bf00993106 · Cited by 442
Context-sensitive learning methods for text categorization
Cohen, W. W., & Singer, Y. (1999) · ACM Transactions on Information Systems · doi:10.1145/306686.306688 · Cited by 360
A Conservation Law for Generalization Performance
Schaffer, C. (1994) · Machine Learning Proceedings 1994 · doi:10.1016/b978-1-55860-335-6.50039-8 · Cited by 335
Proceedings of the 3rd International Conference on Knowledge Discovery and Data Mining
Heckerman, D. E., Uthurusamy, R., Mannila, H., & Pregibon, D. (1997) · AAAI Press eBooks · Cited by 271
Context-sensitive learning methods for text categorization
Cohen, W. W., & Singer, Y. (1996) · Proceedings of the 19th annual international ACM SIGIR conference on Research and development in information retrieval - SIGIR '96 · doi:10.1145/243199.243278 · Cited by 252
Using Decision Trees for Coreference ResolutionPreprint
McCarthy, J. F., & Lehnert, W. G. (1995) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9505043 · Cited by 252
Unifying instance-based and rule-based induction
Domingos, P. (1996) · Machine Learning · doi:10.1007/bf00058656 · Cited by 242
Empirical Methods in Information Extraction
Cardie, C. (1997) · Cited by 227
A Theory and Methodology of Inductive Learning
Michalski, R. S. (1983) · Machine Learning · doi:10.1007/978-3-662-12405-5_4 · Cited by 223
Information extraction as a basis for high-precision text classification
Riloff, E., & Lehnert, W. (1994) · ACM Transactions on Information Systems · doi:10.1145/183422.183428 · Cited by 207
Experiments on multistrategy learning by meta-learning
Chan, P. K., & Stolfo, S. J. (1993) · ACM International Conference on Information and Knowledge Management (CIKM) · doi:10.1145/170088.170160 · Cited by 150
Miyamoto, S. (2004) · Institute of Physics eBooks · doi:10.1887/0750304278/b438c67 · Cited by 133
SRI International FASTUS system
Appelt, D. E., Hobbs, J. R., Bear, J., Israel, D. J., Kameyama, M., MARTIN, D. J., Myers, K. L., & Tyson, M. (1995) · Message Understanding Conference (MUC) · doi:10.3115/1072399.1072420 · Cited by 132
Lehnert, W., Cardie, C., Fisher, D., McCarthy, J., Riloff, E., & Soderland, S. G. (1992) · Message Understanding Conference (MUC) · doi:10.3115/1072064.1072105 · Cited by 122
Carrasco, R. C., & Oncina, J. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58473-0 · Cited by 120
Using decision trees for conference resolution
McCarthy, J. F., & Lehnert, W. G. (1995) · International Joint Conference on Artificial Intelligence · Cited by 97
Relational learning techniques for natural language information extraction
Califf, M. E., & Mooney, R. J. (1998) · Cited by 87
Syntactic and Structural Pattern Recognition
Ferraté, G., Pavlidis, T., Sanfeliu, A., & Horst Bunke, A. (1988) · Springer eBooks · doi:10.1007/978-3-642-83462-2 · Cited by 73
Learning text analysis rules for domain-specific natural language processing
Soderland, S. G. (1996) · Cited by 63
Evans, D. A., Brownlow, N. D., Hersh, W., & Campbell, E. M. (1996) · PubMed · Cited by 56
Grammatical inference: An introductory survey
Vidal, E. (1994) · Lecture notes in computer science · doi:10.1007/3-540-58473-0_131 · Cited by 28
An Efficient Algorithm for the Inference of Circuit-Free Automata
Rulot, H., & Vidal, E. (1988) · Springer eBooks · doi:10.1007/978-3-642-83462-2_11 · Cited by 22
(1996)
Cited by
Data Mining: Practical Machine Learning Tools and Techniques
(2011) · Elsevier eBooks · doi:10.1016/c2009-0-19715-5 · Cited by 25,437
Incorporating non-local information into information extraction systems by Gibbs sampling
Finkel, J. R., Grenager, T., & Manning, C. (2005) · Proceedings of the 43rd Annual Meeting on Association for Computational Linguistics - ACL '05 · doi:10.3115/1219840.1219885 · Cited by 3,008
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
An Introduction to Conditional Random Fields for Relational Learning
Sutton, C., & McCallum, A. (2007) · Introduction to Statistical Relational Learning · doi:10.7551/mitpress/7432.003.0006 · Cited by 841
Reconciling schemas of disparate data sources: a machine-learning approach
Doan, A., Domingos, P., & Halevy, A. Y. (2001) · Proceedings of the 2001 ACM SIGMOD international conference on Management of data · doi:10.1145/375663.375731 · Cited by 733
Metadata
- Authors
- Freitag, D.
- Venue
- Machine Learning
- Published
- 2000-05
- Volume
- 39
- Issue
- 2-3
- Pages
- 169-202
- ISSN
- 0885-6125 (ISSN-L)
- 1573-0565
- OpenAlex
- W2163915185
- Cited by
- 350
- References
- 55
- FWCI
- 18.74
- 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.