Open AccessOn a property of probabilistic context-free grammars
Author(s) -
Ranjan Chaudhuri,
A.N.V. Rao
Publication year - 1983
Publication title -
international journal of mathematics and mathematical sciences
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 39
eISSN - 1687-0425
pISSN - 0161-1712
DOI - 10.1155/s0161171283000356
Subject(s) - algorithm , context (archaeology) , artificial intelligence , mathematics , computer science , archaeology , history
It is proved that for a probabilistic context-free language L(G), the population density of a character (terminal symbol) is equal to its relative densityin the words of a sample S from L(G) whenever the production probabilities of the grammar G are estimated by the relative frequencies of the corresponding productions in the sample
Accelerating Research
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom
Address
John Eccles HouseRobert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom