169 search results - page 5 / 34 » Learning Languages from Positive Data and Negative Counterex... |
PAMI
1998
13 years 7 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...
EMNLP
2010
13 years 5 months ago
2010
This paper studies the effects of training data on binary text classification and postulates that negative training data is not needed and may even be harmful for the task. Tradit...
ALT
1997
Springer
13 years 12 months ago
1997
Springer
An index for an r.e. class of languages (by definition) generates a sequence of grammars defining the class. An index for an indexed family of languages (by definition) generat...
GOSLER
1995
13 years 11 months ago
1995
The present paper deals with the learnability of indexed families of uniformly recursive languages from positive data as well as from both, positive and negative data. We consider...
AUSAI
2008
Springer
13 years 9 months ago
2008
Springer
Classifiers are traditionally learned using sets of positive and negative training examples. However, often a classifier is required, but for training only an incomplete set of pos...