We study the problem of learning regular tree languages from text. We show that the framework of function distinguishability as introduced in our ALT 2000 paper is generalizable from the case of string languages towards tree languages, hence providing a large source of identifiable classes of regular tree languages. Eachof these classes can be characterized in various ways. Moreover, we present a generic inference algorithm with polynomial update time and prove its correctness. In this way, we generalize previous works of Angluin, Sakakibara and ourselves. Moreover, we show that this way all regular tree languages can be identified approximately.
CITATION STYLE
Fernau, H. (2002). Learning tree languages from text. In Lecture Notes in Artificial Intelligence (Subseries of Lecture Notes in Computer Science) (Vol. 2375, pp. 153–168). Springer Verlag. https://doi.org/10.1007/3-540-45435-7_11
Mendeley helps you to discover research relevant for your work.