Approximating grammar probabilities: solution of a conjecture

Authors:
R. Chaudhuri;A. N. V. Rao
Affiliations:
Department of Computer Science, Eastern Michigan University, Ypsilanti, MI;Department of Mathematics, University of South Florida, Tampa, FL
Venue:
Journal of the ACM (JACM)
Year:
1986

Citing 2
Cited 7

Probabilistic Languages: A Review and Some Open Questions

ACM Computing Surveys (CSUR)
Formal languages and their relation to automata

Formal languages and their relation to automata

Inference of k-Testable Languages in the Strict Sense and Application to Syntactic Pattern Recognition

IEEE Transactions on Pattern Analysis and Machine Intelligence
Generalized Stochastic Tree Automata for Multi-relational Data Mining

ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Probabilistic Finite-State Machines-Part II

IEEE Transactions on Pattern Analysis and Machine Intelligence
Detecting Irrelevant Subtrees to Improve Probabilistic Learning from Tree-structured Data

Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
Links between probabilistic automata and hidden Markov models: probability distributions, learning models and induction algorithms

Pattern Recognition
Detecting Irrelevant Subtrees to Improve Probabilistic Learning from Tree-structured Data

Fundamenta Informaticae - Advances in Mining Graphs, Trees and Sequences
PROBABILISTIC GRAPH GRAMMARS

Fundamenta Informaticae

Quantified Score

Hi-index	0.01

Visualization

Abstract

It is proved that the production probabilities of a probabilistic context-free grammar may be obtained as the limit of the estimates inferred from an increasing sequence of randomly drawn samples from the language generated by the grammar.