3134 search results - page 186 / 627 » Computing full disjunctions |
CORR
2011
Springer
14 years 10 months ago
2011
Springer
—We address the problem of estimating a random vector X from two sets of measurements Y and Z, such that the estimator is linear in Y . We show that the partially linear minimum ...
122
Voted
COLING
2010
14 years 10 months ago
2010
This paper proposes a dependency-driven scheme to dynamically determine the syntactic parse tree structure for tree kernel-based anaphoricity determination in coreference resoluti...
113
click to vote
COLING
2010
14 years 10 months ago
2010
There often exist multiple corpora for the same natural language processing (NLP) tasks. However, such corpora are generally used independently due to distinctions in annotation s...
123
click to vote
COLING
2010
14 years 10 months ago
2010
We present a probabilistic generative model for learning semantic parsers from ambiguous supervision. Our approach learns from natural language sentences paired with world states ...
131
click to vote
COLING
2010
14 years 10 months ago
2010
In this paper, we present a two-stage approach to acquire Japanese unknown morphemes from text with full POS tags assigned to them. We first acquire unknown morphemes only making ...