Abstract
The adult-child interaction which takes place during the child’s language acquisition process has been the inspiration for Angluin’s teacher-learner model [1], the forerunner of today’s active learning field. But the initial types of queries have some drawbacks: equivalence queries are both unrealistic and computationally costly; membership queries, on the other hand, are not informative enough, not being able to capture the feedback received by the child when he or she makes mistakes. This is why a new type of query (called correction query), weaker than the first one and more informative than the second, appeared. While in the case of natural languages it is well understood what correcting means, in formal language theory different objects may require different types of corrections. Therefore, several types of correction queries have been introduced so far. In this paper we investigate the relations existing between different models of correction queries, as well as their connection to other well-known Gold-style and query learning models. The study comprises results obtained in the general case when time complexity issues are ignored, and in the restricted case when efficiency constraints are imposed.
This work was possible thanks to the FPU Fellowships AP2004-6968 from the Spanish Ministry of Education and Science.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)
Becerra-Bonache, L., Dediu, A.H., Tîrnăucă, C.: Learning DFA from correction and equivalence queries. In: Sakakibara, Y., Kobayashi, S., Sato, K., Nishino, T., Tomita, E. (eds.) ICGI 2006. LNCS (LNAI), vol. 4201, pp. 281–292. Springer, Heidelberg (2006)
Tîrnăucă, C.: Learning reversible languages from correction queries only, http://grlmc-dfilrom.urv.cat/grlmc/PersonalPages/cristina/publications.htm
Becerra-Bonache, L., de la Higuera, C., Janodet, J.C., Tantini, F.: Learning balls of strings with correction queries. In: Kok, J.N., Koronacki, J., Lopez de Mantaras, R., Matwin, S., Mladenič, D., Skowron, A. (eds.) ECML 2007. LNCS (LNAI), vol. 4701, pp. 18–29. Springer, Heidelberg (2007)
Kinber, E.: On learning regular expressions and patterns via membership and correction queries (manuscript, 2008)
Jain, S., Kinber, E.B.: One-shot learners using negative counterexamples and nearest positive examples. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 257–271. Springer, Heidelberg (2007)
Tîrnăucă, C.I., Tîrnăucă, C.: Learning regular tree languages from correction and equivalence queries. Journal of Automata, Languages and Combinatorics 12(4), 501–524 (2007)
Tîrnăucă, C., Kobayashi, S.: A characterization of the language classes learnable with correction queries. In: Cai, J.-Y., Cooper, S.B., Zhu, H. (eds.) TAMC 2007. LNCS, vol. 4484, pp. 398–407. Springer, Heidelberg (2007)
Tîrnăucă, C., Knuutila, T.: Polynomial time algorithms for learning k-reversible languages and pattern languages with correction queries. In: Hutter, M., Servedio, R.A., Takimoto, E. (eds.) ALT 2007. LNCS (LNAI), vol. 4754, pp. 272–284. Springer, Heidelberg (2007)
Wagner, R.A., Fischer, M.J.: The string-to-string correction problem. Journal of ACM 21(1), 168–173 (1974)
Angluin, D.: Inference of reversible languages. Journal of the ACM 29(3), 741–765 (1982)
Zeugmann, T., Lange, S., Kapur, S.: Characterizations of monotonic and dual monotonic language learning. Information and Computation 120(2), 155–173 (1995)
Zeugmann, T.: Inductive inference and language learning. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol. 3959, pp. 464–473. Springer, Heidelberg (2006)
Gold, E.M.: Language identification in the limit. Information and Control 10(5), 447–474 (1967)
Lange, S., Zilles, S.: Formal language identification: query learning vs. Gold-style learning. Information Processing Letters 91(6), 285–292 (2004)
Angluin, D.: Negative results for equivalence queries. Machine Learning 5(2), 121–150 (1990)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tîrnăucă, C. (2008). A Note on the Relationship between Different Types of Correction Queries. In: Clark, A., Coste, F., Miclet, L. (eds) Grammatical Inference: Algorithms and Applications. ICGI 2008. Lecture Notes in Computer Science(), vol 5278. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-88009-7_17
Download citation
DOI: https://doi.org/10.1007/978-3-540-88009-7_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-88008-0
Online ISBN: 978-3-540-88009-7
eBook Packages: Computer ScienceComputer Science (R0)