Tree languages have proved to be a versatile and rewarding extension of the classical notion of string languages.Many nice applications have been established over the years, in areas such as Natural Language Processing, Information Extraction, and Computational Biology. Although some properties of string languages transfer easily to the tree case, in particular for regular languages, several computational aspects turn out to be harder. It is therefore both of theoretical and of practical interest to investigate howfar and in whatways Grammatical Inference algorithms developed for the string case are applicable to trees. This chapter surveys known results in this direction. We begin by recalling the basics of tree language theory. Then, the most popular learning scenarios and algorithms are presented. Several applications of Grammatical Inference of tree languages are reviewed in some detail. We conclude by suggesting a number of directions for future research.
CITATION STYLE
Björklund, J., & Fernau, H. (2016). Learning tree languages. In Topics in Grammatical Inference (pp. 173–214). Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-48395-4_7
Mendeley helps you to discover research relevant for your work.