Learning and Extending Sublanguages
A number of natural models for learning in the limit is introduced to deal with the situation when a learner is required to provide a grammar covering the input even if only a part of the target language is available. Examples of language families are exhibited that are learnable in one model and not learnable in another one. Some characterizations for learnability of algorithmically enumerable families of languages for the models in question are obtained. Since learnability of any part of the target language does not imply monotonicity of the learning process, we consider also our models under additional monotonicity constraint.
KeywordsInitial Segment Target Language Recursive Function Inductive Inference Restrictive Model
Unable to display preview. Download preview PDF.
- [Bār74a]Bārzdiņš, J.: Inductive inference of automata, functions and programs. In: Int. Math. Congress, Vancouver, pp. 771–776 (1974)Google Scholar
- [Bār74b]Bārzdiņš, J.: Two theorems on the limiting synthesis of functions. In: Theory of Algorithms and Programs. Latvian State University, vol. 1, pp. 82–88, 1974 (in Russian)Google Scholar
- [Ful85]Fulk, M.: A Study of Inductive Inference Machines. PhD thesis, SUNY/Buffalo (1985)Google Scholar
- [KY95]Kobayashi, S., Yokomori, T.: On approximately identifying concept classes in the limit. In: Zeugmann, T., Shinohara, T., Jantke, K.P. (eds.) ALT 1995. LNCS (LNAI), vol. 997, pp. 298–312. Springer, Heidelberg (1995)Google Scholar
- [Muk94]Mukouchi, Y.: Inductive inference of an approximate concept from positive data. In: Arikawa, S., Jantke, K.P. (eds.) AII 1994 and ALT 1994. LNCS (LNAI), vol. 872, pp. 484–499. Springer, Heidelberg (1994)Google Scholar
- [OSW86]Osherson, D., Stob, M., Weinstein, S.: Systems that Learn: An Introduction to Learning Theory for Cognitive and Computer Scientists. MIT Press, Cambridge (1986)Google Scholar