The synthesis of language learners

Citation
Gr. Baliga et al., The synthesis of language learners, INF COMPUT, 152(1), 1999, pp. 16-43
Citations number
84
Categorie Soggetti
Information Tecnology & Communication Systems
Journal title
INFORMATION AND COMPUTATION
ISSN journal
08905401 → ACNP
Volume
152
Issue
1
Year of publication
1999
Pages
16 - 43
Database
ISI
SICI code
0890-5401(19990710)152:1<16:TSOLL>2.0.ZU;2-D
Abstract
An index for an r.e. class of languages (by definition) is a procedure whic h generates a sequence of grammars defining the class, An index for an inde xed family of languages (by definition) is a procedure which generates a se quence of decision procedures defining the family. Studied is the metaprobl em of synthesizing from indices for r.e. classes and for indexed families o f languages various kinds of language learners for the corresponding classe s or families indexed. Many positive results, as well as some negative resu lts, are presented regarding the existence of such synthesizers. The negati ve results essentially provide lower bounds for the positive results. The p roofs of some of the positive results yield, as pleasant corollaries, subse t-principle or tell-tale style characterizations for the learnability of th e corresponding classes or families indexed. For example, the indexed famil ies of recursive languages that can be behaviorally correctly identified fr om positive data are surprisingly characterized by Angluin's condition 2 (t he subset principle for circumventing overgeneralization). (C) 1999 Academi c Press.