A New Heuristic for Inferring Regular Grammars

Modifications to a grammatical inference scheme by Feldman et al. are presented. A comparison of the relative performance of the original and modified schemes is made using the complexity measures of Feldman and Wharton. The case where a complex model is used to generate the sample set is then analyzed. A set of 104 samples was found that trained the program to infer the grammar that corresponded to the original model. The results of a study of the performance of this algorithm when there is a large number of samples is then presented. The major conclusion of this study is that the modified scheme has a superior performance on small sample sets but is highly unsuitable for large ones.

[1]  Michael G. Thomason,et al.  Syntactic Pattern Recognition, An Introduction , 1978, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[2]  Shmuel Peleg,et al.  Determining Compatibility Coefficients for Curve Enhancement Relaxation Processes , 1978 .

[3]  S. Reder,et al.  Grammatical complexity and inference , 1969 .

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

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

[6]  Marc Berthod,et al.  Scene labeling: an optimization approach , 1980, Pattern Recognit..

[7]  Taylor L. Booth,et al.  Grammatical Inference: Introduction and Survey-Part I , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  R. M. Wharton.  Grammar Enumeration and Inference , 1977, Inf. Control..

[9]  L. P. J. Veelenturf,et al.  Inference of Sequential Machines from Sample Computations , 1978, IEEE Transactions on Computers.

[10]  Shmuel Peleg,et al.  A New Probabilistic Relaxation Scheme , 1980, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[11]  Taylor L. Booth,et al.  Grammatical Inference: Introduction and Survey-Part II , 1986, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[12]  Hiromichi Yamamoto.  A method of deriving compatibility coefficients for relaxation operators , 1979 .

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

[14]  Jerome A. Feldman,et al.  On the Synthesis of Finite-State Machines from Samples of Their Behavior , 1972, IEEE Transactions on Computers.