Solution of an Open Problem on Probabilistic Grammars | IEEE Journals & Magazine | IEEE Xplore

Solution of an Open Problem on Probabilistic Grammars


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 producti...Show More

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.
Published in: IEEE Transactions on Computers ( Volume: C-32, Issue: 8, August 1983)
Page(s): 748 - 750
Date of Publication: 31 August 1983

ISSN Information:


Contact IEEE to Subscribe

References

References is not available for this document.