10458 search results - page 276 / 2092 » Modeling Features at Runtime |
166
click to vote
COLING
2008
15 years 8 months ago
2008
We present an algorithm for unsupervised induction of labeled parse trees. The algorithm has three stages: bracketing, initial labeling, and label clustering. Bracketing is done f...
175
click to vote
LREC
2010
15 years 8 months ago
2010
The task of parse disambiguation has gained in importance over the last decade as the complexity of grammars used in deep linguistic processing has been increasing. In this paper ...
150
Voted
EMNLP
2008
15 years 8 months ago
2008
In this paper, we present a novel method based on CRFs in response to the two special characteristics of "contextual dependency" and "label redundancy" in sent...
185
click to vote
NIPS
2001
15 years 8 months ago
2001
We present a new approach to the supervised learning of lateral interactions for the competitive layer model (CLM) dynamic feature binding architecture. The method is based on con...
168
click to vote
JMLR
2008
15 years 6 months ago
2008
We argue that when objects are characterized by many attributes, clustering them on the basis of a random subset of these attributes can capture information on the unobserved attr...