Journal of the ACM · 1986 · 19 citations · 4 references
ComputingComputer ScienceMathematicsComputational LinguisticsNatural Language ProcessingProbability TheoryContext-free LanguagesGrammarGrammar Inference
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.
4
Solution of an Open Problem on Probabilistic Grammars
Chaudhuri, Son Pham, García · IEEE Transactions on Computers · 1983 · 22 citations