
[ Overview | Details | Publications ]
Supervised learning strategies are costly in terms of resources. However, one can often reduce costs--make use of only a small amount of labeled data along with a large pool of unlabeled examples--by exploiting regularities present in the data and, possibly, domain specific information. We investigate semi-supervised and unsupervised learning methods to minimize the need for supervision in a variety of learning protocols and multiple NLP problems.
Examples of learning protocols and problems studied include: