The DOI matches its OpenAlex record; 11 of the 11 references it cites were found in a registry or an index.
Learning Hidden Markov Model Structure for Information Extraction
Open accessOverview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
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
Error 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
Baum, L. E. (1972) · Medical Entomology and Zoology · Cited by 1,405
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
On structuring probabilistic dependences in stochastic language modelling
Ney, H., Essen, U., & Kneser, R. (1994) · Computer Speech & Language · doi:10.1006/csla.1994.1001 · Cited by 517
Tagging English text with a probabilistic model
Mérialdo, B. (1994) · Cited by 474
Robust part-of-speech tagging using a hidden Markov model
Kupiec, J. (1992) · Computer Speech & Language · doi:10.1016/0885-2308(92)90019-z · Cited by 416
Information Extraction with HMMs and Shrinkage
Freitag, D., & McCallum, A. K. (1999) · Cited by 237
A machine learning approach to building domain-specific search engines
McCallum, A., Nigam, K., Rennie, J. D. M., & Seymore, K. (1999) · Cited by 183
Self-citationBayesian learning of probabilistic language models
Stolcke, A. (1994) · Cited by 171
Cited by
The text mining handbook: advanced approaches in analyzing unstructured data
(2007) · Choice Reviews Online · doi:10.5860/choice.44-5684 · Cited by 1,598
Sarawagi, S. (2008) · Foundations and Trends in Databases · doi:10.1561/1900000003 · Cited by 707
Adaptive name matching in information integration
Bilenko, M., Mooney, R., Cohen, W., Ravikumar, P., & Fienberg, S. (2003) · IEEE Intelligent Systems · doi:10.1109/mis.2003.1234765 · Cited by 469
Travel time estimation for urban road networks using low frequency probe vehicle data
Jenelius, E., & Koutsopoulos, H. N. (2013) · Transportation Research Part B: Methodological · doi:10.1016/j.trb.2013.03.008 · Cited by 434
Name disambiguation in author citations using a K-way spectral clustering method
Han, H., Zha, H., & Giles, C. L. (2005) · Proceedings of the 5th ACM/IEEE-CS joint conference on Digital libraries · doi:10.1145/1065385.1065462 · Cited by 272
Metadata
- Authors
- Seymore, K., & Rosenfeld, R.
- Published
- 2018-06-30
- OpenAlex
- W1568339100
- Cited by
- 381
- References
- 11
- FWCI
- 4.06
- Type
- conference paper
- Language
- en
- Open access
- green
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Learning Hidden Markov Model Structure for Information Extraction. https://app.cochat.ai/papers/10.1184/r1/6606872
- The paper
- Seymore, K., & Rosenfeld, R. (2018). Learning Hidden Markov Model Structure for Information Extraction. https://doi.org/10.1184/r1/6606872
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.
