The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Nymble: a high-performance learning name-finder
Open accessAbstract
This paper presents a statistical, learned approach to finding names and other nonrecursive entities in text (as per the MUC-6 definition of the NE task), using a variant of the standard hidden Markov model. We present our justification for the problem and our approach, a detailed discussion of the model itself and finally the successful results of this new approach.
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
Elements of Information Theory
Cover, T. M., & Thomas, J. A. (2001) · Wiley eBooks · doi:10.1002/0471200611 · Cited by 36,808
Elements of Information Theory
Jacobs, K. (1992) · Discrete Stochastics · doi:10.1007/978-3-0348-8645-1_7 · Cited by 2,918
Coping with ambiguity and unknown words through probabilistic models
Weischedel, R., Schwartz, R. M., Palmucci, J., Meteer, M. W., & Ramshaw, L. (1993) · Cited by 256
Self-citationSRI 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
Cited by
A theory of learning from different domains
Ben-David, S., Blitzer, J., Crammer, K., Kulesza, A., Pereira, F., & Vaughan, J. W. (2010) · Machine Learning · doi:10.1007/s10994-009-5152-4 · Cited by 3,515
“The resulting bound generalizes the previously studied cases and is always at least as tight as a bound which considers minimizing only the target error or an equal weighting of source and target errors.”
BackgroundA 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
“For example, two-digit and four-digit numbers can stand for years (D. Bikel et al. 1997) and when followed by an " s " , they can stand for a decade; one and two digits may stand for a day or a month (S. Yu et al. 1998).”
BackgroundMethodHead-Driven Statistical Models for Natural Language Parsing
Collins, M. (2003) · Computational Linguistics · doi:10.1162/089120103322753356 · Cited by 1,826
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
A 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
Automating the Construction of Internet Portals with Machine Learning
McCallum, A. K., Nigam, K., Rennie, J., & Seymore, K. (2000) · Information Retrieval · doi:10.1023/a:1009953814988 · Cited by 1,280
Sarawagi, S. (2008) · Foundations and Trends in Databases · doi:10.1561/1900000003 · Cited by 707
Aggarwal, C. C. (2015) · Data Mining · doi:10.1007/978-3-319-14142-8_13 · Cited by 606
A hidden Markov model information retrieval system
Miller, D. R. H., Leek, T., & Schwartz, R. M. (1999) · Proceedings of the 22nd annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/312624.312680 · Cited by 469
Self-citationA Survey on Recent Advances in Named Entity Recognition from Deep Learning models
Yadav, V., & Bethard, S. J. (2019) · arXiv (Cornell University) · doi:10.48550/arxiv.1910.11470 · Cited by 464
Information extraction: Techniques and challenges
Grishman, R. (1997) · Lecture Notes in Computer Science · doi:10.1007/3-540-63438-x_2 · Cited by 435
Learning Hidden Markov Model Structure for Information Extraction
Seymore, K., & Rosenfeld, R. (2018) · doi:10.1184/r1/6606872 · Cited by 381
Named entity recognition in query
Guo, J., Xu, G., Cheng, X., & Li, H. (2009) · Proceedings of the 32nd international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1571941.1571989 · Cited by 379
Identifying sources of opinions with conditional random fields and extraction patterns
Choi, Y., Cardie, C., Riloff, E., & Patwardhan, S. (2005) · Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing - HLT '05 · doi:10.3115/1220575.1220620 · Cited by 366
Machine Learning for Information Extraction in Informal Domains
Freitag, D. (2000) · Machine Learning · doi:10.1023/a:1007601113994 · Cited by 350
Scaling question answering to the Web
Kwok, C. C. T., Etzioni, O., & Weld, D. S. (2001) · Proceedings of the 10th international conference on World Wide Web · doi:10.1145/371920.371973 · Cited by 326
(2004) · Springer eBooks · doi:10.1007/978-1-4757-4305-0 · Cited by 310
Named entity recognition: a maximum entropy approach using global information
Chieu, H. L., & Ng, H. T. (2002) · Proceedings of the 19th international conference on Computational linguistics - · doi:10.3115/1072228.1072253 · Cited by 309
Information retrieval and text mining technologies for chemistry
Krallinger, M., Rabal, O., Lourenço, A., Oyarzabal, J., & Valencia, A. (2017) · Chemical Reviews · doi:10.1021/acs.chemrev.6b00851 · Cited by 281
Intricacies of Collins' Parsing Model
Bikel, D. M. (2004) · Computational Linguistics · doi:10.1162/0891201042544929 · Cited by 265
Self-citation
Metadata
- Authors
- Bikel, D. M., Miller, S., Schwartz, R., & Weischedel, R.
- Venue
- Proceedings of the fifth conference on Applied natural language processing -
- Published
- 1997
- Pages
- 194-201
- OpenAlex
- W2163918411
- Cited by
- 726
- References
- 4
- FWCI
- 24.56
- 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.