DocumentCode :
1149202
Title :
Solution of an Open Problem on Probabilistic Grammars
Author :
Chaudhuri, Ranjan ; Pham, Son ; Garcia, Oscar N.
Author_Institution :
Computer Science Group, Department of Mathematics, East Carolina University
Issue :
8
fYear :
1983
Firstpage :
748
Lastpage :
750
Abstract :
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.
Keywords :
Consistency; expected mean/derivation length; expected/ mean word length; probabilistic grammars; Computer languages; Computer science; Frequency estimation; Mathematics; Probability; Production; Consistency; expected mean/derivation length; expected/ mean word length; probabilistic grammars;
fLanguage :
English
Journal_Title :
Computers, IEEE Transactions on
Publisher :
ieee
ISSN :
0018-9340
Type :
jour
DOI :
10.1109/TC.1983.1676313
Filename :
1676313
Link To Document :
بازگشت