The DOI matches its Crossref record; 17 of the 17 references it cites were found in a registry or an index.
Identifying Hierarchical Structure in Sequences: A linear-time algorithm
Open accessAbstract
SEQUITUR is an algorithm that infers a hierarchical structure from a sequence of discrete symbols by replacing repeated phrases with a grammatical rule that generates the phrase, and continuing this process recursively. The result is a hierarchical representation of the original sequence, which offers insights into its lexical structure. The algorithm is driven by two constraints that reduce the size of the grammar, and produce structure as a by-product. SEQUITUR breaks new ground by operating incrementally. Moreover, the method's simple structure permits a proof that it operates in space and time that is linear in the size of the input. Our implementation can process 50,000 symbols per second and has been applied to an extensive range of real world sequences.
Overview
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
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 Art of Computer Programming. Volume 1: Fundamental Algorithms.
Odeh, R. E., & Knuth, D. E. (1969) · Journal of the American Statistical Association · doi:10.2307/2283757 · Cited by 2,525
Watch what I do: programming by demonstration
Cypher, A., Halbert, D. C., Kurlander, D., Lieberman, H. A., Maulsby, D., Myers, B. A., & Turransky, A. (1993) · Medical Entomology and Zoology · Cited by 1,027
Bell, T., Cleary, J. G., & Witten, I. H. (1990) · Cited by 988
Self-citationAttention and structure in sequence learning.
Cohen, A., Ivry, R. I., & Keele, S. W. (1990) · Journal of Experimental Psychology: Learning, Memory, and Cognition · doi:10.1037/0278-7393.16.1.17 · Cited by 661
Inference of Reversible Languages
Angluin, D. (1982) · Journal of the ACM · doi:10.1145/322326.322334 · Cited by 526
Johansson, S., Leech, G., & Goodluck, H. (1978) · Cited by 344
Inducing probabilistic grammars by Bayesian model merging
Stolcke, A., & Omohundro, S. (1994) · Lecture Notes in Computer Science · doi:10.1007/3-540-58473-0_141 · Cited by 230
Language acquisition, data compression and generalization
Wolff, J. (1982) · Language & Communication · doi:10.1016/0271-5309(82)90035-0 · Cited by 136
Cited by
Sequences of purchases in credit card data reveal lifestyles in urban populations
Di Clemente, R., Luengo-Oroz, M., Travizano, M., Xu, S., Vaitla, B., & González, M. C. (2018) · Nature Communications · doi:10.1038/s41467-018-05690-8 · Cited by 105
Owadally, I., Zhou, F., Otunba, R., Lin, J., & Wright, D. (2019) · Expert Systems with Applications · doi:10.1016/j.eswa.2019.01.049 · Cited by 16
Metadata
- Authors
- Nevill-Manning, C. G., & Witten, I. H.
- Venue
- Journal of Artificial Intelligence Research
- Publisher
- AI Access Foundation
- Published
- 1997-09-01
- Volume
- 7
- Pages
- 67-82
- ISSN
- 1076-9757 (ISSN-L)
- OpenAlex
- W2105686649
- Cited by
- 549
- References
- 17
- FWCI
- 7.61
- Type
- journal article
- Language
- en
- Open access
- diamond
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: Identifying Hierarchical Structure in Sequences: A linear-time algorithm. https://app.cochat.ai/papers/10.1613/jair.374
- The paper
- Nevill-Manning, C. G., & Witten, I. H. (1997). Identifying Hierarchical Structure in Sequences: A linear-time algorithm. Journal of Artificial Intelligence Research. https://doi.org/10.1613/jair.374
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.
