Stochastic programmed grammars for syntactic pattern recognition

摘要

A stochastic version of the Programmed Grammar is proposed as a powerful and convenient formalism for syntactic pattern recognition. An algorithm for parsing strings generated by Stochastic Context-Free Programmed Grammars is described and an example is presented of one such grammar which generates “noisy” squares.