Synthesizing noise-tolerant language learners

An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of languages (by definition) generates a sequence of decision procedures defining the family. F. Stephen's model of noisy data is empoloyed, in which, roughly, correct data crops up infintely often, and incorrect data only finitely often. Studied, then, is the synthesis from indices for r.e. classes and for indexed families of languages of various kinds of noise-tolerant language-learners for the corresponding classes or families indexed. Many positive results, as well as some negative results, are presented regarding the existence of such synthesizers. The proofs of most of the positive resutls yield, as pleasant corollaries, strict subset-principle or tell-tale style characterization for the noise-tolerant learn-ability of the corresponding classes or families indexed.

[1]  T. Shinohara INFERRING UNIONS OF TWO PATTERN LANGUAGES , 1983 .

[2]  John Case,et al.  The Power of Vacillation in Language Learning , 1999, SIAM J. Comput..

[3]  Thomas Zeugmann,et al.  Characterizations of Monotonic and Dual Monotonic Language Learning , 1995, Inf. Comput..

[4]  Dick de Jongh,et al.  Angluin's theorem for indexed families of r.e. sets and applications , 1996, COLT '96.

[5]  Arun Sharma,et al.  Characterizing Language Identification by Standardizing Operations , 1994, J. Comput. Syst. Sci..

[6]  Ya. M. Barzdin,et al.  Towards a Theory of Inductive Inference (in Russian) , 1973, MFCS.

[7]  John Case,et al.  Synthesizing enumeration techniques for language learning , 1996, COLT '96.

[8]  P. Odifreddi Classical recursion theory , 1989 .

[9]  John Case,et al.  Infinitary self-reference in learning theory , 1994, J. Exp. Theor. Artif. Intell..

[10]  Dana Angluin,et al.  Inductive Inference of Formal Languages from Positive Data , 1980, Inf. Control..

[11]  Thomas Zeugmann,et al.  A Guided Tour Across the Boundaries of Learning Recursive Languages , 1995, GOSLER Final Report.

[12]  Robert C. Berwick,et al.  The acquisition of syntactic knowledge , 1985 .

[13]  John Case,et al.  Machine Inductive Inference and Language Identification , 1982, ICALP.

[14]  Efim B. Kinber,et al.  On a Theory of Inductive Inference , 1977, FCT.

[15]  John Case,et al.  Comparison of Identification Criteria for Machine Inductive Inference , 1983, Theor. Comput. Sci..

[16]  Mark A. Fulk Robust separations in inductive inference , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.

[17]  Gianfranco Bilardi,et al.  Language Learning without Overgeneralization , 1992, STACS.

[18]  Klaus P. Jantke Automatic synthesis of programs and inductive inference of functions , 1979, FCT.

[19]  S. Kapur Computational Learning of Languages , 1992 .

[20]  Manuel Blum,et al.  Toward a Mathematical Theory of Inductive Inference , 1975, Inf. Control..

[21]  Frank Stephan,et al.  Noisy Inference and Oracles , 1995, Theor. Comput. Sci..

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

[23]  R. Soare Recursively enumerable sets and degrees , 1987 .

[24]  Arun Sharma,et al.  Characterizing Language Identification in Terms of Computable Numberings , 1997, Ann. Pure Appl. Log..

[25]  Thomas Zeugmann,et al.  Types of monotonic language learning and their characterization , 1992, COLT '92.

[26]  Manuel Blum,et al.  A Machine-Independent Theory of the Complexity of Recursive Functions , 1967, JACM.

[27]  Frank Stephan Noisy Inference and Oracles , 1997, Theor. Comput. Sci..

[28]  John Case,et al.  Vacillatory and BC learning on noisy data , 1996, Theor. Comput. Sci..

[29]  Daniel N. Osherson,et al.  Synthesizing Inductive Expertise , 1988, Inf. Comput..

[30]  Arto Salomaa,et al.  ICALP'88: Proceedings of the 15th International Colloquium on Automata, Languages and Programming , 1988 .

[31]  Gianfranco Bilardi,et al.  Language Learning Without Overgeneralization , 1992, Theor. Comput. Sci..

[32]  Yasuhito Mukouchi,et al.  Characterization of Finite Identification , 1992, AII.

[33]  Thomas Zeugmann,et al.  Monotonic and Dual Monotonic Language Learning , 1996, Theor. Comput. Sci..