Applying Probability Measures to Abstract Languages
The DOI matches its Crossref record.
Abstract
The problem of assigning a probability to each word of a language is considered. Two methods are discussed. One method assigns a probability to a word on the basis of particular measurable features of the language. The second method is applied to languages L(G) generated by a grammar G. A probability is associated with each production of G. These in turn define the word probabilities of each word in the language. The conditions for this assignment to be a probabilistic measure are derived.
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
Head-Driven Statistical Models for Natural Language Parsing
Collins, M. (2003) · Computational Linguistics · doi:10.1162/089120103322753356 · Cited by 1,826
A probabilistic earley parser as a psycholinguistic model
Hale, J. (2001) · Second meeting of the North American Chapter of the Association for Computational Linguistics on Language technologies 2001 - NAACL '01 · doi:10.3115/1073336.1073357 · Cited by 1,150
“This de(cid:12)nes a probabilistic language (Grenander, 1967) (Booth and Thompson, 1973) (Soule, 1974) (Wetherell, 1980).”
BackgroundThree generative, lexicalised models for statistical parsing
Collins, M. (1997) · Proceedings of the 35th annual meeting on Association for Computational Linguistics - · doi:10.3115/976909.979620 · Cited by 743
Recognition of visual activities and interactions by stochastic parsing
Ivanov, Y. A., & Bobick, A. F. (2000) · IEEE Transactions on Pattern Analysis and Machine Intelligence · doi:10.1109/34.868686 · Cited by 659
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
Recursive Markov chains, stochastic grammars, and monotone systems of nonlinear equations
Etessami, K., & Yannakakis, M. (2009) · Journal of the ACM · doi:10.1145/1462153.1462154 · Cited by 512
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
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
(1998) · MPG.PuRe (Max Planck Society) · Cited by 293
Grammatical Inference: Introduction and Survey - Part I
Fu, K.-S., & Booth, T. L. (1975) · IEEE Transactions on Systems, Man, and Cybernetics · doi:10.1109/tsmc.1975.5409159 · Cited by 270
Self-citationIntricacies of Collins' Parsing Model
Bikel, D. M. (2004) · Computational Linguistics · doi:10.1162/0891201042544929 · Cited by 265
Recurrent Neural Networks as Weighted Language Recognizers
Chen, Y., Gilroy, S., Maletti, A., May, J., & Knight, K. (2018) · Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers) · doi:10.18653/v1/n18-1205 · Cited by 49
“Not all probabilistic context-free grammars are consistent; necessary and sufficient conditions for consistency are given by Booth and Thompson (1973). However, probabilistic context-free grammars obtained by training on a finite corpus using popular methods (such as expectation-maximization) are guaranteed to be cons…”
Background
Metadata
- Authors
- Booth, T. L., & Thompson, R. A.
- Venue
- IEEE Transactions on Computers
- Published
- 1973-05
- Volume
- C-22
- Issue
- 5
- Pages
- 442-450
- ISSN
- 0018-9340 (ISSN-L)
- 1557-9956
- 2326-3814
- OpenAlex
- W2111041233
- Cited by
- 228
- References
- 0
- FWCI
- 5.75
- Type
- journal article
- 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.