8706 search results - page 298 / 1742 » Learning Subjective Language |
167
Voted
JMLR
2012
13 years 5 months ago
2012
In this paper we propose a new approach for semi-supervised structured output learning. Our approach uses relaxed labeling on unlabeled data to deal with the combinatorial nature ...
137
click to vote
ICALP
2001
Springer
15 years 7 months ago
2001
Springer
We consider a model of learning Boolean functions from quantum membership queries. This model was studied in [26], where it was shown that any class of Boolean functions which is i...
132
Voted
NLP
2000
15 years 6 months ago
2000
In this article we compare the performance of various machine learning algorithms on the task of constructing word-sense disambiguation rules from data. The distinguishing characte...
145
Voted
EACL
2006
ACL Anthology
15 years 4 months ago
2006
ACL Anthology
Given the growing complexity of tasks that spoken dialogue systems are trying to handle, Reinforcement Learning (RL) has been increasingly used as a way of automatically learning ...
116
click to vote
ECCC
2008
15 years 2 months ago
2008
Higman essentially showed that if A is any language then SUBSEQ(A) is regular, where SUBSEQ(A) is the language of all subsequences of strings in A. Let s1, s2, s3, . . . be the sta...