Please use this identifier to cite or link to this item:
|Title:||LEARNING correction grammars||Authors:||Carlucci, L.
|Issue Date:||2009||Citation:||Carlucci, L., Case, J., Jain, S. (2009). LEARNING correction grammars. Journal of Symbolic Logic 74 (2) : 489-516. ScholarBank@NUS Repository. https://doi.org/10.2178/jsl/1243948324||Abstract:||We investigate a new paradigm in the context of learning in the limit, namely, learning correction grammars for classes of computably enumerable (c.e.) languages. Knowing a language may feature a representation of it in terms of two grammars. The second grammar is used to make corrections to the first grammar. Such a pair of grammars can be seen as a single description of (or grammar for) the language. We call such grammars correction grammars. Correction grammars capture the observable fact that people do correct their linguistic utterances during their usual linguistic activities. We show that learning correction grammars for classes of c.e. languages in the TxtEx-model (i.e., converging to a single correct correction grammar in the limit) is sometimes more powerful than learning ordinary grammars even in the 7"j:flc-model (where the learner is allowed to converge to infinitely many syntactically distinct but correct conjectures in the limit). For each n 0, there is a similar learning advantage, again in learning correction grammars for classes of c.e. languages, but where we compare learning correction grammars that make n + 1 corrections to those that make n corrections.The concept of a correction grammar can be extended into the constructive transfinite, using the idea of counting-down from notations for transfinite constructive ordinals. This transfinite extension can also be conceptualized as being about learning Ershov-descriptions for c.e. languages. For u a notation in Kleene's general system (O, o) of ordinal notations for constructive ordinals, we introduce the concept of an M-correction grammar, where u is used to bound the number of corrections that the grammar is allowed to make. We prove a general hierarchy result: if u and v are notations for constructive ordinals such that « o v, then there are classes of c.e. languages that can be TxtEx-eamed by conjecturing v-correction grammars but not by conjecturing H-correction grammars.Surprisingly, we show that-bove "o-many" corrections-t is not possible to strengthen the hierarchy: TxtEx-leaming u-correction grammars of classes of c.e. languages, where « is a notation in 0 for any ordinal, can be simulated by T ZJc-learning m-correction grammars, where w is any notation for the smallest infinite ordinal a. ©Association.||Source Title:||Journal of Symbolic Logic||URI:||http://scholarbank.nus.edu.sg/handle/10635/39417||ISSN:||00224812||DOI:||10.2178/jsl/1243948324|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 29, 2020
WEB OF SCIENCETM
checked on Sep 29, 2020
checked on Sep 22, 2020
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.