38 search results - page 3 / 8 » Learning Languages from Positive Data and a Finite Number of... |
TAMC
2007
Springer
13 years 12 months ago
2007
Springer
Abstract. Formal language learning models have been widely investigated in the last four decades. But it was not until recently that the model of learning from corrections was intr...
ALT
2007
Springer
14 years 2 months ago
2007
Springer
As some cognitive research suggests, in the process of learning languages, in addition to overt explicit negative evidence, a child often receives covert explicit evidence in form...
ALT
2003
Springer
14 years 2 months ago
2003
Springer
A pattern is a finite string of constant and variable symbols. The erasing language generated by a pattern p is the set of all strings that can be obtained by substituting (possib...
ALT
2003
Springer
13 years 9 months ago
2003
Springer
Abstract. Inductive inference can be considered as one of the fundamental paradigms of algorithmic learning theory. We survey results recently obtained and show their impact to pot...
PAMI
1998
13 years 5 months ago
1998
—This paper concerns an efficient algorithm for learning in the limit a special type of regular languages called strictly locally testable languages from positive data, and its a...