Abstract
We investigate regular tree languages exact learning from positive examples and membership queries. Input data are trees of the language to infer. The learner computes new trees from the inputs and asks to the oracle whether or not they belong to the language. From the answers, the learner may ask further membership queries until he finds the correct grammar that generates the target language. This paradigm was introduced by Angluin in the seminal work [1] for the case of regular word language. Neither negative examples, equivalence queries nor counter examples are allowed in this paradigm.
We describe an efficient algorithm which is polynomial in the size of the examples for learning the whole class of regular tree languages. The convergence is insured when the set of examples contains a representative sample of the language to guess. A finite subset \(\mathcal{E}\) of a regular tree language \(\mathcal{L}\) is representative for \(\mathcal{L}\) if every transition of the minimal tree automaton for \(\mathcal{L}\) is used at least once for the derivation of an element of the set \(\mathcal{E}\).
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.: A note on the number of queries needed to identify regular languages. Information and Control 51, 76–87 (1981)
Angluin, D.: Learning regular sets from queries and counter examples. Information and Control 75, 87–106 (1987)
Angluin, D.: Queries and concept learning. Machine learning 2, 319–342 (1988)
Besombes, J., Marion, J.Y.: Identification of reversible dependency tree languages. In: Proceedings of the third Learning Language in Logic workshop, pp. 11–22 (2001)
Besombes, J., Marion, J.Y.: Apprentissage des langages réguliers d’arbres et applications. Conférence d’Apprentissage, Orléans 17, 18 et 19 juin 2002, pp. 55–70 (2002)
Besombes, J., Marion, J.Y.: Learning dependency languages from a teacher. In: Proceedings of Formal Grammar 2004, pp. 17–28 (2004)
Besombes, J., Marion, J.Y.: Learning reversible categorial grammars from structures. In: Proceedings of the international IIS:IIPWM 2004, Advances in Soft Computing, pp. 181–190. Springer, Heidelberg (2004)
Carrasco, R.C., Oncina, J., Calera, J.: Stochastic inference of regular tree languages. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol. 1433, pp. 185–197. Springer, Heidelberg (1998)
Christophe, A.: L’apprentissage du langage. In: Université de tous les savoirs, Odile Jacob, vol. 2, pp. 41–51 (2000)
Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree automata techniques and applications. Available on (1997), http://www.grappa.univ-lille3.fr/tata
Dikovsky, A., Modina, L.: Dependencies on the other side of the curtain. Traitement automatique des langues 41(1), 67–96 (2000)
Drewes, F., Högberg, J.: Learning a regular tree language from a teacher. In: Ésik, Z., Fülöp, Z. (eds.) DLT 2003. LNCS, vol. 2710, pp. 279–291. Springer, Heidelberg (2003)
Drewes, F., Högberg, J.: Learning a regular tree language from a teacher even more efficiently. Technical Report 03.11, Umea University (2003)
Fernau, H.: Learning tree languages from text. 2375, 153–168 (2002)
Fukuda, H., Kamata, K.: Inference of tree automata from sample set of trees. International Journal of Computer and Information Sciences 13(3), 177–196 (1984)
Gold, M.E.: Language identification in the limit. Information and Control 10, 447–474 (1967)
Kamata, K.: Inference methods for tree automata from sample set of trees. IEEE International Conference on Systems, Man and Cybernetics, 490–493 (1988)
Kanazawa, M.: Learnable classes of Categorial Grammars. In: CSLI (1998)
Kozen, D.: On the myhill-nerode theorem for trees. EATCS Bulletin 47, 170–173 (1992)
Pinker, S.: The language instinct. Harper (1994)
Sakakibara, Y.: Inductive inference of logic programs based on algebraic semantics. Technical Report ICOT, 79 (1987)
Sakakibara, Y.: . Inferring parsers of context-free languages from structural examples. Technical Report ICOT, 81 (1987)
Sakakibara, Y.: Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science 76, 223–242 (1990)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Besombes, J., Marion, JY. (2004). Learning Tree Languages from Positive Examples and Membership Queries. In: Ben-David, S., Case, J., Maruoka, A. (eds) Algorithmic Learning Theory. ALT 2004. Lecture Notes in Computer Science(), vol 3244. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30215-5_33
Download citation
DOI: https://doi.org/10.1007/978-3-540-30215-5_33
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23356-5
Online ISBN: 978-3-540-30215-5
eBook Packages: Springer Book Archive