The DOI matches its Crossref record; 12 of the 12 references it cites were found in a registry or an index.
Inside-outside reestimation from partially bracketed corpora
Open accessAbstract
The inside-outside algorithm for inferring the parameters of a stochastic context-free grammar is extended to take advantage of constituent information (constituent bracketing) in a partially parsed corpus.Experiments on formal and natural language parsed corpora show that the new algorithm can achieve faster convergence and better modeling of hierarchical structure than the original one.In particular, over 90% test set bracketing accuracy was achieved for grammars inferred by our algorithm from a training set of handparsed part-of-speech strings for sentences in the Air Travel Information System spoken language corpus.Finally, the new algorithm has better time complexity than the original one when sufficient bracketing is provided.
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
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
The ATIS spoken language systems pilot corpus
Hemphill, C. T., Godfrey, J. J., & Doddington, G. R. (1990) · Proceedings of the workshop on Speech and Natural Language - HLT '90 · doi:10.3115/116580.116613 · Cited by 790
Applications of stochastic context-free grammars using the Inside-Outside algorithm
Lari, K., & Young, S. J. (1991) · Computer Speech & Language · doi:10.1016/0885-2308(91)90009-f · Cited by 639
Trainable grammars for speech recognition
Baker, J. K. (1979) · The Journal of the Acoustical Society of America · doi:10.1121/1.2017061 · Cited by 512
Procedure for quantitatively comparing the syntactic coverage of English grammars
Klavans, J., Liberman, M., Marcus, M., Roukos, S., Santorini, B., Strzalkowski, T., Abney, S., Flickenger, S., Gdaniec, C., Grishman, C., et al. (1991) · Proceedings of the workshop on Speech and Natural Language - HLT '91 · doi:10.3115/112405.112467 · Cited by 432
The estimation of stochastic context-free grammars using the Inside-Outside algorithm
Lari, K., & Young, S. J. (1990) · Computer Speech & Language · doi:10.1016/0885-2308(90)90022-x · Cited by 379
Basic Methods of Probabilistic Context Free Grammars
Jelinek, F., Lafferty, J. D., & Mercer, R. L. (1992) · Speech Recognition and Understanding · doi:10.1007/978-3-642-76626-8_35 · Cited by 193
Parsing a natural language using mutual information statistics
Magerman, D. M., & Marcus, M. P. (1990) · Cited by 128
Stochastic lexicalized tree-adjoining grammars
Schabes, Y. (1992) · International Conference on Computational Linguistics · doi:10.3115/992133.992136 · Cited by 126
Self-citationProbabilistic representation of formal languages
Booth, T. L. (1969) · Annual Symposium on Switching & Automata Theory · doi:10.1109/swat.1969.17 · Cited by 93
Cited by
Building a Large Annotated Corpus of English: The Penn Treebank
Marcus, M. (1993) · doi:10.21236/ada273556 · Cited by 7,405
Learning Accurate, Compact, and Interpretable Tree Annotation
Petrov, S., Barrett, L., Thibaux, R., & Klein, D. (2006) · Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the ACL - ACL '06 · doi:10.3115/1220175.1220230 · Cited by 793
The Now-or-Never bottleneck: A fundamental constraint on language
Christiansen, M. H., & Chater, N. (2016) · Behavioral and Brain Sciences · doi:10.1017/s0140525x1500031x · Cited by 733
A new statistical parser based on bigram lexical dependencies
Collins, M. J. (1996) · Proceedings of the 34th annual meeting on Association for Computational Linguistics - · doi:10.3115/981863.981888 · Cited by 614
Distributional regularity and phonotactic constraints are useful for segmentation
Brent, M. R., & Cartwright, T. A. (1996) · Cognition · doi:10.1016/s0010-0277(96)00719-6 · Cited by 514
Metadata
- Authors
- Pereira, F., & Schabes, Y.
- Venue
- Proceedings of the 30th annual meeting on Association for Computational Linguistics -
- Published
- 1992
- Pages
- 128-135
- OpenAlex
- W2439178139
- Cited by
- 284
- References
- 12
- FWCI
- 13.80
- 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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Inside-outside reestimation from partially bracketed corpora. https://app.cochat.ai/papers/10.3115/981967.981984
- The paper
- Pereira, F., & Schabes, Y. (1992). Inside-outside reestimation from partially bracketed corpora. Proceedings of the 30th annual meeting on Association for Computational Linguistics -. https://doi.org/10.3115/981967.981984
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.
