articles in general and definite articles in particular can create problems even long after all other aspects of english have been mastered. the present article investigated the learnability problems related to the acquisition of count-mass distinction of english nominals by persian l2 learners. the theoretical underpinning of the study is the interpretability hypothesis (tsimpli & dimitrak...

Articles in general and definite articles in particular can create problems even long after all other aspects of English have been mastered. The present article investigated the learnability problems related to the acquisition of count-mass distinction of English nominals by Persian L2 learners. The theoretical underpinning of the study is the interpretability hypothesis (Tsimpli & Dimitrakopou...

An active area of research in machine learning is learning logic programs from examples; this subarea is sometimes called inductive logic programming. This paper investigates this problem formally, using as our primary technical tool the method of prediction-preserving reducibilities and the model of polynomial predictability introduced by Pitt and Warmuth 1990]. We focus on the learnability of...

We prove a new combinatorial characterization of polynomial learnability from equivalence queries, and state some of its consequences relating the learnability of a class with the learnabil-ity via equivalence and membership queries of its subclasses obtained by restricting the instance space. Then we propose and study two models of query learning in which there is a probability distribution on...

In this paper, we propose a three component CSCL design evaluation framework of usability, sociability, and learnability. Usability refers to the ease of use and subjective learner satisfaction with CSCL systems. Sociability refers to the CSCL system support for social interactional processes such as conversation, cooperation, deliberation, and/or argumentation. Learnability refers to the evalu...

We prove a new combinatorial characterization of polynomial learnability from equiva lence queries and state some of its consequences relating the learnability of a class with the learnability via equivalence and membership queries of its subclasses obtained by restricting the instance space Then we propose and study two models of query learning in which there is a probability distribution on t...

A foundational assumption in linguistics has been that words and their meanings are arbitrarily related; however, this position has been challenged recently. Experiments have shown that both systematic (where similar objects have similar labels) and iconic (words ‘resemble’ the objects they label) associations between words and objects facilitate learning. However, these two literatures remain ...