Abstract
Based on the ideas suggested in [5], the following model for learning from a variant of correction queries to an oracle is proposed: being asked a membership query, the oracle, in the case of negative answer, returns also a correction – a positive datum (that has not been seen in the learning process yet) with the smallest edit distance from the queried string. Polynomial-time algorithms for learning a class of regular expressions from one such query and membership queries and learning pattern languages from queries of this type are proposed and discussed.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Angluin, D.: Finding Patterns Common to a Set of Strings (extended abstract). In: 11th Annual ACM Symposium on Theory of Computing, pp. 130–141. ACM Press, New York (1979)
Angluin, D.: Inference of Reversible Languages. Journal of the ACM 29(3), 741–765 (1982)
Angluin, D.: Learning Regular Sets from Queries and Counterexamples. Information and Computation 75(2), 87–106 (1987)
Angluin, D.: Queries and Concept Learning. Machine Learning 2, 319–342 (1988)
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)
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)
Bex, G.J., Neven, F., Schwentick, T., Tuyls, K.: Inference of Concise DTDs from XML Data. In: 32nd International Conference on Very Large Data Bases VLDB (2006)
Bex, G.J., Gelade, W., Neven, F., Vansummeren, S.: Learning Deterministic Regular Expressions for the Inference of Schemas from XML Data. In: WWW Conference 2008, Beijing, China, pp. 825–836 (2008)
Gold, E.M.: Language Identification in the Limit. Information and Control 10, 447–474 (1967)
Fernau, H.: Algorithms for Learning Regular Expressions. In: Jain, S., Simon, H.U., Tomita, E. (eds.) ALT 2005. LNCS (LNAI), vol. 3734, pp. 297–311. Springer, Heidelberg (2005)
Kinber, E.: Learning a Class of Regular Expressions via Restricted Subset Queries. In: Jantke, K.P. (ed.) AII 1992. LNCS, vol. 642, pp. 232–243. Springer, Heidelberg (1992)
Lange, S., Wiehagen, R.: Polynomial-time Inference of Arbitrary Pattern Languages. New Generation Computing 8(4), 361–370 (1991)
Rohde, D.L.T., Plaut, D.C.: Language Acquisition in the Absence of Explicit Negative Evidence: How Important Is Starting Small? Cognition 72, 67–109 (1999)
Sakakibara, Y.: Learning Context-free Grammars from Structural Data in Polynomial Time. Theoretical Computer Science 76, 223–242 (1990)
Shinohara, T., Arikawa, S.: Pattern Inference. In: Lange, S., Jantke, K.P. (eds.) GOSLER 1994. LNCS, vol. 961, pp. 259–291. Springer, Heidelberg (1995)
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. 264–276. 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 (2007)
Valiant, L.G.: A Theory of the Learnable. Communications of the ACM 27(11), 1134–1142 (1984)
Yokomori, T.: Learning Non-deterministic Finite Automata from Queries and Counterexamples. Machine Intelligence 13, 169–189 (1994)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kinber, E. (2008). On Learning Regular Expressions and Patterns Via Membership and 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_10
Download citation
DOI: https://doi.org/10.1007/978-3-540-88009-7_10
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)