Sciweavers

3653 search results - page 280 / 731
» Learning of Partial Languages
Sort
View
CICLING
2006
Springer
15 years 8 months ago
Application of Semi-supervised Learning to Evaluative Expression Classification
Abstract. We propose to use semi-supervised learning methods to classify evaluative expressions, that is, tuples of subjects, their attributes, and evaluative words, that indicate ...
Yasuhiro Suzuki, Hiroya Takamura, Manabu Okumura
NLP
2000
15 years 8 months ago
Learning Rules for Large-Vocabulary Word Sense Disambiguation: A Comparison of Various Classifiers
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...
Georgios Paliouras, Vangelis Karkaletsis, Ion Andr...
179
Voted
EACL
2006
ACL Anthology
15 years 6 months ago
Using Reinforcement Learning to Build a Better Model of Dialogue State
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 ...
Joel R. Tetreault, Diane J. Litman
147
Voted
ECCC
2008
117views more  ECCC 2008»
15 years 5 months ago
The complexity of learning SUBSEQ(A)
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...
Stephen A. Fenner, William I. Gasarch, Brian Posto...
VL
2010
IEEE
160views Visual Languages» more  VL 2010»
15 years 3 months ago
Toward End-User Debugging of Machine-Learned Classifiers
Many machine-learning algorithms learn rules of behavior from individual end users, such as taskoriented desktop organizers and handwriting recognizers. These rules form a generat...
Todd Kulesza