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 of families of recursive languages is studied when the learner obeys certain natural constraints. Exactly learnable families are characterized for prudent learners with the following types of constraints: 1. (0) conservative, 2. (1) conservative and consistent, 3. (2) conservative and responsive, and 4. (3) conservative, consistent and responsive. The class of learnable families is shown to strictly increase going from (3) to (2) and from (2) to (1), while it stays the same going from (1) to (0). It is also shown that, when exactness is not required, prudence, consistency and responsiveness, even together, do not restrict the power of conservative learners. © 1995.
Kapur, S., & Bilardi, G. (1995). Language learning without overgeneralization. Theoretical Computer Science, 141(1–2), 151–162. https://doi.org/10.1016/0304-3975(94)00075-T