Abstract
We generalize a learning algorithm by Drewes and Högberg [1] for regular tree languages based on a learning model proposed by Angluin [2] to recognizable tree languages of arbitrarily many dimensions, so-called multi-dimensional trees. Trees over multi-dimensional tree domains have been defined by Rogers [3,4]. However, since the algorithm by Drewes and Högberg relies on classical finite state automata, these structures have to be represented in another form to make them a suitable input for the algorithm: We give a new representation for multi-dimensional trees which establishes them as a direct generalization of classical trees over a partitioned alphabet, and show that with this notation Drewes’ and Högberg’s algorithm is able to learn tree languages of arbitrarily many dimensions. Via the correspondence between trees and string languages (“yield operation”) this is equivalent to the statement that this way even some string language classes beyond context-freeness have become learnable with respect to Angluin’s learning model as well.
Access provided by Autonomous University of Puebla. Download to read the full chapter text
Chapter PDF
Similar content being viewed by others
References
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)
Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation 75(2), 87–106 (1987)
Rogers, J.: Syntactic Structures as Multi-dimensional Trees. Research on Language and Computation 1, 265–305 (2003)
Rogers, J.: wMSO Theories as Grammar Formalisms. TCS 293, 291–320 (2003)
Sakakibara, Y.: Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science 76(2–3), 223–242 (1990)
Joshi, A.K.: Tree adjoining grammars: How much context-sensitivity is required to provide reasonable structural description. In: Dowty, D., Karttunen, L., Zwicky, A. (eds.) Natural Language Processing. Cambridge University Press, Cambridge (1985)
Weir, D.J.: A geometric hierarchy beyond context-free languages. Theoretical Computer Science 104(2), 235–261 (1992)
Kasprzik, A.: Two Equivalent Regularizations of Tree Adjoining Grammars. Technical Report 08-1, University of Trier (2008), urts117.uni-trier.de/cms/index.php?id=15939
Kasprzik, A.: Making Finite-State Methods Applicable to Languages Beyond Context-Freeness via Multi-dimensional Trees. Technical Report 08-3, University of Trier (2008), urts117.uni-trier.de/cms/index.php?id=15939
Maler, O., Pnueli, A.: On the learnability of infinitary regular sets. In: Proc. 4th Annual Workshop on Comp. Learning Th., pp. 128–136. Morgan Kaufmann, San Francisco (1991)
Drewes, F., Högberg, J.: Query Learning of Regular Tree Languages: How to Avoid Dead States. Theory of Computing Systems 40(2), 163–185 (2007)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kasprzik, A. (2008). A Learning Algorithm for Multi-dimensional Trees, or: Learning Beyond Context-Freeness. 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_9
Download citation
DOI: https://doi.org/10.1007/978-3-540-88009-7_9
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)