The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Named entity recognition using an HMM-based chunk tagger
Abstract
This paper proposes a Hidden Markov Model (HMM) and an HMM-based chunk tagger, from which a named entity (NE) recognition (NER) system is built to recognize and classify names, times and numerical quantities. Through the HMM, our system is able to apply and integrate four types of internal and external evidences: 1) simple deterministic internal feature of the words, such as capitalization and digitalization; 2) internal semantic feature of important triggers; 3) internal gazetteer feature; 4) external macro context feature. In this way, the NER problem can be resolved effectively. Evaluation of our system on MUC-6 and MUC-7 English NE tasks achieves F-measures of 96.6% and 94.1% respectively. It shows that the performance is significantly better than reported by any other machine-learning system. Moreover, the performance is even consistently better than those based on handcrafted rules.
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
A tutorial on hidden Markov models and selected applications in speech recognition
Rabiner, L. R. (1989) · Proceedings of the IEEE · doi:10.1109/5.18626 · Cited by 22,743 · cited 3×
“Ideally, it can be estimated by using the forward-backward algorithm [ Rabiner89 ] recursively for the 1st-order [Rabiner89] or 2nd”
MethodInfluentialError bounds for convolutional codes and an asymptotically optimum decoding algorithm
Viterbi, A. (1967) · IEEE Transactions on Information Theory · doi:10.1109/tit.1967.1054010 · Cited by 6,759
A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition
RABINER, L. R. (1990) · Readings in Speech Recognition · doi:10.1016/b978-0-08-051584-7.50027-9 · Cited by 1,869
Brill, E. (1995) · Cited by 1,520
An Algorithm that Learns What's in a Name
Bikel, D. M., Schwartz, R., & Weischedel, R. M. (1999) · Machine Learning · doi:10.1023/a:1007558221122 · Cited by 776
Introduction to the CoNLL-2000 shared task: chunking
Tjong Kim Sang, E. F., & Buchholz, S. (2000) · Proceedings of the 2nd workshop on Learning language in logic and the 4th conference on Computational natural language learning - · doi:10.3115/1117601.1117631 · Cited by 705
Young, A. (1975) · The Iowa Review · doi:10.17077/0021-065x.1850 · Cited by 626
A maximum entropy approach to named entity recognition
Grishman, R., & Borthwick, A. (1999) · Cited by 467
Named Entity recognition without gazetteers
Mikheev, A., Moens, M., & Grover, C. (1999) · Proceedings of the ninth conference on European chapter of the Association for Computational Linguistics - · doi:10.3115/977035.977037 · Cited by 433
An Ontology for CoNLL-RDF: Formal Data Structures for TSV Formats in Language Technology
Chiarcos, C., Ionov, M., Glaser, L., & Fäth, C. (2000) · arXiv (Cornell University) · doi:10.4230/oasics.ldk.2021.20 · Cited by 322
NYU: Description of the MENE Named Entity System as Used in MUC-7
Borthwick, A., Sterling, J., Agichtein, E., & Grishman, R. (1998) · Cited by 233
IsoQuest Inc.: Description of the NetOwl™ Extractor System as Used for MUC-7
Krupka, G. R., & Hausman, K. (1998) · Cited by 127
Internal and External Evidence in the Identification and Semantic Categorization of Proper Names
McDonald, D. D. (1993) · Cited by 124
The statistical significance of the MUC-4 results
Chinchor, N. A. (1992) · Message Understanding Conference (MUC) · doi:10.3115/1072064.1072068 · Cited by 57
Description of the Kent Ridge Digital Labs System Used for MUC-7
Yu, S., Bai, S., & Wu, P. (1998) · Cited by 55
Error Bounds for Convolutional Codes and an Asymptotically Optimum Decoding Algorithm
Viterbi, A. J. (2009) · Co-Published with Indian Institute of Science (IISc), Bangalore, India eBooks · doi:10.1142/9789814287517_0004 · Cited by 32
Cited by
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
Web-a-where: geotagging web content
Amitay, E., Har'El, N., Sivan, R., & Soffer, A. (2004) · Proceedings of the 27th annual international ACM SIGIR conference on Research and development in information retrieval · doi:10.1145/1008992.1009040 · Cited by 531
A 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
A Comprehensive Survey on Automatic Knowledge Graph Construction
Zhong, L., Wu, J., Li, Q., Peng, H., & Wu, X. (2024) · ACM Computing Surveys · doi:10.1145/3618295 · Cited by 382
Adaptive Co-attention Network for Named Entity Recognition in Tweets
Zhang, Q., Fu, J., Liu, X., & Huang, X. (2018) · Proceedings of the AAAI Conference on Artificial Intelligence · doi:10.1609/aaai.v32i1.11962 · Cited by 381
Metadata
- Authors
- Zhou, G., & Su, J.
- Venue
- Proceedings of the 40th Annual Meeting on Association for Computational Linguistics - ACL '02
- Published
- 2001
- Pages
- 473
- OpenAlex
- W2123512824
- Cited by
- 715
- References
- 16
- Type
- conference abstract
- Language
- en
- Open access
- closed
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.