Please use this identifier to cite or link to this item: https://doi.org/10.1016/j.tcs.2007.07.024
Title: A general comparison of language learning from examples and from queries
Authors: Jain, S. 
Lange, S.
Zilles, S.
Keywords: Formal languages
Inductive inference
Query learning
Recursion theory
Issue Date: 2007
Source: Jain, S., Lange, S., Zilles, S. (2007). A general comparison of language learning from examples and from queries. Theoretical Computer Science 387 (1) : 51-66. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tcs.2007.07.024
Abstract: In language learning, strong relationships between Gold-style models and query models have recently been observed: in some quite general setting Gold-style learners can be replaced by query learners and vice versa, without loss of learning capabilities. These 'equalities' hold in the context of learning indexable classes of recursive languages. Former studies on Gold-style learning of such indexable classes have shown that, in many settings, the enumerability of the target class and the recursiveness of its languages are crucial for learnability. Moreover, studying query learning, non-indexable classes have been mainly neglected up to now. So it is conceivable that the recently observed relations between Gold-style and query learning are not due to common structures in the learning processes in both models, but rather to the enumerability of the target classes or the recursiveness of their languages. In this paper, the analysis is lifted onto the context of learning arbitrary classes of recursively enumerable languages. Still, strong relationships between the approaches of Gold-style and query learning are proven, but there are significant changes to the former results. Though in many cases learners of one type can still be replaced by learners of the other type, in general this does not remain valid vice versa. All results hold even for learning classes of recursive languages, which indicates that the recursiveness of the languages is not crucial for the former 'equality' results. Thus we analyze how constraints on the algorithmic structure of the target class affect the relations between two approaches to language learning. © 2007 Elsevier Ltd. All rights reserved.
Source Title: Theoretical Computer Science
URI: http://scholarbank.nus.edu.sg/handle/10635/39315
ISSN: 03043975
DOI: 10.1016/j.tcs.2007.07.024
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

4
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

4
checked on Nov 22, 2017

Page view(s)

43
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.