Synthesizing enumeration techniques for language learning

This paper provides positive and negative results on algorithmically synthesizing, from grammars and from decision procedures for classes of languages, learning machines for identifying, from positive data, grammars for the languages in those classes. In the process, the uniformly decidable classes of recursive languages that can be behaviorally correctly identified from positive data are surprisingly characterized by Angluin’s 1980 Condition 2 (the subset principle for preventing overgeneralization).

[1]  Hartley Rogers,et al.  Gödel numberings of partial recursive functions , 1958, Journal of Symbolic Logic.

[2]  M. B. Pour-El,et al.  A structural criterion for recursive enumeration without repetition , 1964 .

[3]  H. Putnam,et al.  Recursively enumerable classes and their application to recursive sequences of formal theories , 1965 .

[4]  Hilary Putnam,et al.  Trial and error predicates and the solution to a problem of Mostowski , 1965, Journal of Symbolic Logic.

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

[6]  Dennis M. Ritchie,et al.  The complexity of loop programs , 1967, ACM National Conference.

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

[8]  Jr. Hartley Rogers Theory of Recursive Functions and Effective Computability , 1969 .

[9]  N. Shapiro Review: E. Mark Gold, Limiting Recursion; Hilary Putnam, Trial and Error Predicates and the Solution to a Problem of Mostowski , 1971 .

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

[11]  John Case,et al.  Anomaly hierarchies of mechanized inductive inference , 1978, STOC.

[12]  Paul Young,et al.  An introduction to the general theory of algorithms , 1978 .

[13]  S. Pinker Formal models of language learning , 1979, Cognition.

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

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

[16]  Kenneth Wexler,et al.  Formal Principles of Language Acquisition , 1980 .

[17]  Rolf Wiehagen,et al.  Research in the theory of inductive inference by GDR mathematicians - A survey , 1980, Inf. Sci..

[18]  Dana Angluin,et al.  Finding Patterns Common to a Set of Strings , 1980, J. Comput. Syst. Sci..

[19]  Dana Angluin,et al.  Inference of Reversible Languages , 1982, JACM.

[20]  On extensional learnability , 1982, Cognition.

[21]  D. Osherson,et al.  Ideal Learning Machines , 1982, Cognitive Sciences.

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

[23]  Daniel N. Osherson,et al.  Ideal Learning Machines , 1982, Cogn. Sci..

[24]  Daniel N. Osherson,et al.  Criteria of Language Learning , 1982, Inf. Control..

[25]  D. Osherson,et al.  A note on formal learning theory , 1982, Cognition.

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

[27]  Carl H. Smith,et al.  Inductive Inference: Theory and Methods , 1983, CSUR.

[28]  D. Osherson,et al.  Learning theory and natural language , 1984, Cognition.

[29]  Rusins Freivalds Recursiveness of the enumerating functions invreases the inferablity of recursively enumberable sets , 1985, Bull. EATCS.

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

[31]  Michael Stob,et al.  An analysis of a learning paradigm , 1986 .

[32]  Mark A. Fulk A study of inductive inference machines , 1986 .

[33]  Rita M. Manzini,et al.  Parameters, binding theory and learnability , 1987 .

[34]  James S. Royer A Connotational Theory of Program Structure , 1987, Lecture Notes in Computer Science.

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

[36]  John Case The power of vacillation , 1988, COLT '88.

[37]  Daniel N. Osherson,et al.  Systems That Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists , 1990 .

[38]  Mark A. Fulk Prudence and Other Conditions on Formal Language Learning , 1990, Inf. Comput..

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

[40]  Rolf Wiehagen A Thesis in Inductive Inference , 1990, Nonmonotonic and Inductive Logic.

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

[42]  David Kirsh,et al.  PDP Learnability and Innate Knowledge of Language , 1992 .

[43]  S. Kapur,et al.  Universal Grammar and Learnability Theory: The Case of Binding Domains and the ‘Subset Principle’ , 1993 .

[44]  K. Wexler The Subset Principle is an Intensional Principle , 1993 .

[45]  Thomas Zeugmann,et al.  Language learning in dependence on the space of hypotheses , 1993, COLT '93.

[46]  J. Case,et al.  Subrecursive Programming Systems: Complexity & Succinctness , 1994 .

[47]  J. Case,et al.  Subrecursive programming systems - complexity and succinctness , 1994 .

[48]  Manfred K. Warmuth,et al.  The Weighted Majority Algorithm , 1994, Inf. Comput..

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

[50]  John Case,et al.  Language Learning with Some Negative Information , 1993, J. Comput. Syst. Sci..

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

[52]  John Case,et al.  Learnability: Admissible, Co-Finite, and Hypersimple Languages , 1996, J. Comput. Syst. Sci..

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