Please use this identifier to cite or link to this item:
|Title:||Learning languages from positive data and a limited number of short counterexamples|
|Authors:||Jain, S. |
Learning in the limit
|Citation:||Jain, S., Kinber, E. (2007). Learning languages from positive data and a limited number of short counterexamples. Theoretical Computer Science 389 (1-2) : 190-218. ScholarBank@NUS Repository. https://doi.org/10.1016/j.tcs.2007.08.010|
|Abstract:||We consider two variants of a model for learning languages in the limit from positive data and a limited number of short negative counterexamples (counterexamples are considered to be short if they are smaller than the largest element of input seen so far). Negative counterexamples to a conjecture are examples which belong to the conjectured language but do not belong to the input language. Within this framework, we explore how/when learners using n short (arbitrary) negative counterexamples can be simulated (or simulate) using least short counterexamples or just 'no' answers from a teacher. We also study how a limited number of short counterexamples fairs against unconstrained counterexamples, and also compare their capabilities with the data that can be obtained from subset, superset, and equivalence queries (possibly with counterexamples). A surprising result is that just one short counterexample can sometimes be more useful than any bounded number of counterexamples of arbitrary sizes. Most of the results exhibit salient examples of languages learnable or not learnable within corresponding variants of our models. © 2007 Elsevier Ltd. All rights reserved.|
|Source Title:||Theoretical Computer Science|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Feb 15, 2019
WEB OF SCIENCETM
checked on Jan 23, 2019
checked on Nov 17, 2018
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.