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
Applying Probability Measures to Abstract Languages
IEEE Transactions on Computers
Inference of Finite-State Probabilistic Grammars
IEEE Transactions on Computers
Stochastic k-testable Tree Languages and Applications
ICGI '02 Proceedings of the 6th International Colloquium on Grammatical Inference: Algorithms and Applications
Probabilistic Context-Free Grammars Estimated from Infinite Distributions
IEEE Transactions on Pattern Analysis and Machine Intelligence
Maximum likelihood analysis of algorithms and data structures
Theoretical Computer Science
Smoothing and compression with stochastic k-testable tree languages
Pattern Recognition
Consistency of stochastic context-free grammars
Mathematical and Computer Modelling: An International Journal
An information-theoretic measure to evaluate parsing difficulty across treebanks
ACM Transactions on Speech and Language Processing (TSLP)
| Hi-index | 14.98 |
It has been proved that when the production probabilities of an unambiguous context-free grammar G are estimated by the relative frequencies of the corresponding productions in a sample S from the language L(G) generated by G, the expected derivation length and the expected word length of the words in L(G) are precisely equal to the mean derivation length and the mean world length of the words in the same S, respectively.