An Incremental Interactive Algorithm for Regular Grammar Inference

We present provably correct interactive algorithms for learning regular grammars from positive examples and membership queries. A structurally complete set of strings from a language L(G) corresponding to a target regular grammar G implicitly specifies a lattice of finite state automata (FSA) which contains a FSA MG corresponding to G. The lattice is compactly represented as a version-space and MG is identified by searching the version-space using membership queries. We explore the problem of regular grammar inference in a setting where positive examples are provided intermittently. We provide an incremental version of the algorithm along with a set of sufficient conditions for its convergence.

[1]  Michael Thompson,et al.  Frontiers of Pattern Recognition , 1975 .

[2]  O. Firschein,et al.  Syntactic pattern recognition and applications , 1983, Proceedings of the IEEE.

[3]  Rajesh Parekh,et al.  An Efficient Interactive Algorithm for Regular Language Learning , 1995 .

[4]  Jerome A. Feldman,et al.  Learning automata from ordered examples , 1991, COLT '88.

[5]  Robert E. Schapire,et al.  Design and analysis of efficient learning algorithms , 1992, ACM Doctoral dissertation award ; 1991.

[6]  Dana Angluin,et al.  A Note on the Number of Queries Needed to Identify Regular Languages , 1981, Inf. Control..

[7]  Translator-IEEE Expert staff.  Machine Learning: A Theoretical Approach , 1992, IEEE Expert.

[8]  H. Hirsh.  Incremental Version-Space Merging: A General Framework for Concept Learning , 1990 .

[9]  C. L. Giles,et al.  Second-order recurrent neural networks for grammatical inference , 1991, IJCNN-91-Seattle International Joint Conference on Neural Networks.

[10]  Dana Angluin,et al.  Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..

[11]  Jeffrey D. Ullman,et al.  Introduction to Automata Theory, Languages and Computation , 1979 .

[12]  Vasant Honavar,et al.  Toward Learning Systems That Integrate Different Strategies and Representations , 1993 .

[13]  Enrique Vidal,et al.  What Is the Search Space of the Regular Inference? , 1994, ICGI.

[14]  Michael A. Harrison,et al.  Introduction to switching and automata theory , 1965 .

[15]  L. Miclet,et al.  Learning from examples in sequences and grammatical inference , 1988 .

[16]  M. Lankhorst.  A Genetic Algorithm for the Induction of Nondeterministic Pushdown Automata , 1995 .

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

[18]  Tom M. Mitchell,et al.  Generalization as Search , 2002 .

[19]  John W. Carr,et al.  A Solution of the Syntactical Induction-Inference Problem for Regular Languages , 1978, Comput. Lang..