Necessary and sufficient conditions for learning with correction queries

We investigate the newly introduced model of learning with correction queries in the context of query learning. We present necessary and sufficient conditions for a class of languages to be inferable within this setting. We also offer a complete picture of how is the model of learning with corrections related with other well-established learning models, like the model of learning in the limit from positive data, or the one of learning with membership queries. As an application, we show that the class of k-reversible languages is learnable with correction queries.

[1]  Leonor Becerra-Bonache,et al.  Learning Mild Context-Sensitiveness: Toward Understanding Children's Language Learning , 2004, ICGI.

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

[3]  Sandra Zilles,et al.  Formal language identification: query learning vs. Gold-style learning , 2004, Inf. Process. Lett..

[4]  Douglas L. T. Rohde,et al.  Language acquisition in the absence of explicit negative evidence: how important is starting small? , 1999, Cognition.

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

[6]  Leonor Becerra-Bonache,et al.  Learning DFA from Correction and Equivalence Queries , 2006, ICGI.

[7]  Efim B. Kinber,et al.  On Learning Regular Expressions and Patterns Via Membership and Correction Queries , 2008, ICGI.

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

[9]  Alexander Okhotin.  Language Equations with Symmetric Difference , 2006, CSR.

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

[11]  Sanjay Jain,et al.  One-Shot Learners Using Negative Counterexamples and Nearest Positive Examples , 2007, ALT.

[12]  Dana Angluin,et al.  Queries and concept learning , 1988, Machine Learning.

[13]  L. Becerra-Bonache,et al.  LEARNING DFA FROM CORRECTIONS , 2006 .

[14]  Patrick Brézillon,et al.  Lecture Notes in Artificial Intelligence , 1999 .

[15]  Koichi Furukawa,et al.  Proceedings of RIMS Symposium on Software Science and Engineering , 1983 .

[16]  Yasuhito Mukouchi,et al.  Inductive Inference with Bounded Mind Changes , 1992, ALT.

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

[18]  Sandra Zilles,et al.  Comparison of Query Learning and Gold-Style Learning in Dependence of the Hypothesis Space , 2004, ALT.

[19]  Timo Knuutila,et al.  Polynomial Time Algorithms for Learning k -Reversible Languages and Pattern Languages with Correction Queries , 2007, ALT.

[20]  Cristina Tîrnauca,et al.  A Note on the Relationship between Different Types of Correction Queries , 2008, ICGI.

[21]  Sanjay Jain,et al.  A general comparison of language learning from examples and from queries , 2007, Theor. Comput. Sci..

[22]  Thomas Zeugmann,et al.  Inductive Inference and Language Learning , 2006, TAMC.

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

[24]  Klaus P. Jantke.  Monotonic and non-monotonic inductive inference , 2009, New Generation Computing.

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

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

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

[28]  Steffen Lange.  The representation of recursive languages and its impact on the efficiency of learning , 1994, COLT '94.

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

[30]  Takeshi Shinohara,et al.  Polynomial Time Inference of Extended Regular Pattern Languages , 1983, RIMS Symposium on Software Science and Engineering.

[31]  Yasubumi Sakakibara,et al.  Learning context-free grammars from structural data in polynomial time , 1988, COLT '88.

[32]  Leonor Becerra-Bonache,et al.  Learning Balls of Strings with Correction Queries , 2007, ECML.

[33]  Sandra Zilles,et al.  Replacing Limit Learners with Equally Powerful One-Shot Query Learners , 2004, COLT.

[34]  Sandra Zilles,et al.  Relations between Gold-style learning and query learning , 2005, Inf. Comput..

[35]  Timo Knuutila,et al.  Efficient Language Learning with Correction Queries , 2007 .