4163 search results - page 348 / 833 » A comprehensive combination framework |
162
click to vote
CI
2004
15 years 6 months ago
2004
Soft constraints are a generalization of classical constraints, which allow for the description of preferences rather than strict requirements. In soft constraints, constraints and...
179
click to vote
GRAMMARS
2000
15 years 6 months ago
2000
Inthis paper, we aim at giving alogical account of the representationalist view on minimalist grammars by refering to the notion of Proof-Net in Linear Logic. We propose at the sam...
189
click to vote
SAC
2002
ACM
15 years 6 months ago
2002
ACM
Soft constraints are a generalization of classical constraints, where constraints and/or partial assignments are associated to preference or importance levels, and constraints are...
163
click to vote
EMNLP
2010
15 years 4 months ago
2010
This paper introduces dual decomposition as a framework for deriving inference algorithms for NLP problems. The approach relies on standard dynamic-programming algorithms as oracl...
173
click to vote
EMNLP
2009
15 years 4 months ago
2009
Combining information extraction systems yields significantly higher quality resources than each system in isolation. In this paper, we generalize such a mixing of sources and fea...