论文信息 - A method for the inference of non-recursive context-free grammars

A method for the inference of non-recursive context-free grammars

A practical method is presented for the automatic generation of a non-recursive context-free grammar (cfg) from a set of strings that the cfg is required to be capable of producing. The method is efficient in computing time by comparison with enumerative methods.

C. Chirathamjaree | Martin H. Ackroyd | M. Ackroyd | C. Chirathamjaree

[1] J. Feldman,et al. A SURVEY OF RESULTS IN GRAMMATICAL INFERENCE , 1972 .

[2] Chaiyaporn Chirathamjaree. The use of formal grammars in automatic speech recognition , 1979 .

[3] Fred Joseph Maryanski. Inference of probabilistic grammars. , 1974 .

[4] James Jay Horning,et al. A study of grammatical inference , 1969 .

[5] E. Mark Gold,et al. Language Identification in the Limit , 1967, Inf. Control..

[6] Ray J. Solomonoff,et al. A Formal Theory of Inductive Inference. Part II , 1964, Inf. Control..

[7] Eugene Galanter,et al. Handbook of mathematical psychology: I. , 1963 .

[8] J. S. Bridle,et al. Speech recognition using zero-crossing measurements and sequence information , 1969 .

[9] Taylor L. Booth,et al. Grammatical Inference: Introduction and Survey - Part I , 1975, IEEE Trans. Syst. Man Cybern..