Skip to main content


eCommons@Cornell >
College of Engineering >
Computer Science >
Computer Science Technical Reports >

Please use this identifier to cite or link to this item:
Title: Inductive Inference without Overgeneralization from Positive Examples
Authors: Kapur, Shyam
Bilardi, Gianfranco
Keywords: computer science
technical report
Issue Date: Nov-1989
Publisher: Cornell University
Abstract: Language learnability is investigated in the Gold paradigm of inductive inference from positive data. Angluin gave a characterization of learnable families in this framework. Here, learnability is studied when the learner obeys certain constraints. These constraints have been suggested by some studies of child language acquisition. Learnable families are characterized for learners with the following types of constraints: (a) conservative, consistent, and responsive, (b) conservative and responsive, (c) conservative and consistent, and (d) conservative. It is shown that the class of learnable families strictly increases going from (a) to (b) and from (b) to (c), while it stays the same going from (c) to (d).
Appears in Collections:Computer Science Technical Reports

Files in This Item:

File Description SizeFormat
89-1057.pdf1.43 MBAdobe PDFView/Open
89-1057.ps382.26 kBPostscriptView/Open

Refworks Export

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


© 2014 Cornell University Library Contact Us