Please use this identifier to cite or link to this item: https://doi.org/10.1006/jcss.2001.1759
Title: Language learning from texts: Degrees of intrinsic complexity and their characterizations
Authors: Jain, S. 
Kinber, E.
Wiehagen, R.
Issue Date: 2001
Source: Jain, S., Kinber, E., Wiehagen, R. (2001). Language learning from texts: Degrees of intrinsic complexity and their characterizations. Journal of Computer and System Sciences 63 (3) : 305-354. ScholarBank@NUS Repository. https://doi.org/10.1006/jcss.2001.1759
Abstract: This paper deals with two problems: (1) what makes languages learnable in the limit by natural strategies of varying hardness, and (2) what makes classes of languages the hardest ones to lear. To quantify hardness of learning, we use intrinsic complexity based on reductions between learning problems. Two types of reductions are considered: weak reductions mapping texts (representations of languages) to texts and strong reductions mapping languages to languages. For both types of reductions, characterizations of complete (hardest) classes in terms of their algorithmic and topological potentials have been obtained. To characterize the strong complete degree, we discovered a new and natural complete class capable of "coding" any learning problem using density of the set of rational numbers. We have also discovered and characterized rich hierarchies of degrees of complexity based on "core" natural learning problems. The classes in these hierarchies contain "multidimensional" languages, where the information learned from one dimension aids in learning other dimensions. In one formalization of this idea, the grammars learned from the dimensions 1, 2,...,k specify the "subspace" for the dimension k + 1, while the learning strategy for every dimension is predefined. In our other formalization, a "pattern" learned from the dimension k specifies the learning strategy for the dimension k + 1. A number of open problems are discussed.
Source Title: Journal of Computer and System Sciences
URI: http://scholarbank.nus.edu.sg/handle/10635/39085
ISSN: 00220000
DOI: 10.1006/jcss.2001.1759
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

9
checked on Dec 6, 2017

WEB OF SCIENCETM
Citations

9
checked on Nov 22, 2017

Page view(s)

52
checked on Dec 10, 2017

Google ScholarTM

Check

Altmetric


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