Abstract
In this paper, some properties of stochastic context-free programmed grammars arepresented. By illustrative examples, the class of stochastic context-free programmed grammars is shown to be quite effective in characterizing the structures of some pictorial patterns. Two stochastic syntactic-analysis algorithms for stochastic context-free programmed grammars are introduced. It is shown that the stochastic analyzer with a fixed strategy would require the least average number of steps to recognize the language generated by a stochastic context-free programmed grammar, while the stochastic syntactic analyzer with a random strategy would be useful in the case where the probability information associated with the stochastic context-free programmed grammar is incomplete or inaccurately known. The performance of the stochastic syntactic analyzer with a random strategy would be better than that of the nondeterministic syntactic analyzer proposed earlier. The use of the proposed stochastic syntactic-analysis algorithm with a fixed strategy for syntactic pattern recognition is illustrated by a chromosome patternclassification experiment.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
