The DOI matches its Crossref record.
Trainable grammars for speech recognition
Open accessAbstract
Algorithms which are based on modeling speech as a finite-state, hidden Markov process have been very successful in recent years. This paper presents a generalization of these algorithms to certain denumerable-state, hidden Markov processes. This algorithm permits automatic training of the stochastic analog of an arbitrary context free grammar. In particular, in contrast to many grammatical inference methods, the new algorithm allows the grammar to have an arbitrary degree of ambiguity. Since natural language is often syntactically ambiguous, it is necessary for the grammatical inference algorithm to allow for this ambiguity. Furthermore, allowing ambiguity in the grammar allows errors in the recognition process to be explicitly modeled in the grammar rather than added as an extra component.
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
Cited by
Accurate unlexicalized parsing
Klein, D., & Manning, C. D. (2003) · Proceedings of the 41st Annual Meeting on Association for Computational Linguistics - ACL '03 · doi:10.3115/1075096.1075150 · Cited by 3,008
Deep Learning in Medical Imaging: General Overview
Lee, J.-G., Jun, S., Cho, Y.-W., Lee, H., Kim, G. B., Seo, J. B., & Kim, N. (2017) · Korean Journal of Radiology · doi:10.3348/kjr.2017.18.4.570 · Cited by 1,276
Two decades of statistical language modeling: where do we go from here?
Rosenfeld, R. (2000) · Proceedings of the IEEE · doi:10.1109/5.880083 · Cited by 735
Zettlemoyer, L., & Collins, M. (2012) · arXiv (Cornell University) · doi:10.48550/arxiv.1207.1420 · Cited by 728
A syntax-based statistical translation model
Yamada, K., & Knight, K. (2001) · Proceedings of the 39th Annual Meeting on Association for Computational Linguistics - ACL '01 · doi:10.3115/1073012.1073079 · Cited by 728
A probabilistic model of lexical and syntactic access and disambiguation
Jurafsky, D. (1996) · Cognitive Science · doi:10.1016/s0364-0213(99)80005-6 · Cited by 714
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
Recurrent Neural Network Grammars
Dyer, C., Kuncoro, A., Ballesteros, M., & Smith, N. A. (2016) · Proceedings of the 2016 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies · doi:10.18653/v1/n16-1024 · Cited by 517
Corpus-based induction of syntactic structure: models of dependency and constituency
Klein, D., & Manning, C. D. (2004) · Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics - ACL '04 · doi:10.3115/1218955.1219016 · Cited by 440
An Efficient Probabilistic Context-Free Parsing Algorithm that Computes Prefix Probabilities
Stolcke, A. (1994) · arXiv (Cornell University) · doi:10.48550/arxiv.cmp-lg/9411029 · Cited by 336
Introduction to the special issue on computational linguistics using large corpora
Church, K., & Mercer, R. L. (1993) · OLAC - Open Language Archives Community · doi:10.5555/972450.972452 · Cited by 293
Inside-outside reestimation from partially bracketed corpora
Pereira, F., & Schabes, Y. (1992) · Proceedings of the 30th annual meeting on Association for Computational Linguistics - · doi:10.3115/981967.981984 · Cited by 284
Intricacies of Collins' Parsing Model
Bikel, D. M. (2004) · Computational Linguistics · doi:10.1162/0891201042544929 · Cited by 265
Metadata
- Authors
- Baker, J. K.
- Venue
- The Journal of the Acoustical Society of America
- Publisher
- Acoustical Society of America (ASA)
- Published
- 1979-06-01
- Volume
- 65
- Issue
- S1
- Pages
- S132-S132
- ISSN
- 0001-4966 (ISSN-L)
- 1520-8524
- OpenAlex
- W2047706513
- Cited by
- 512
- References
- 0
- Type
- conference abstract
- 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.