Results 1 
2 of
2
2009. Optimization in Coreference Resolution Is Not Needed: A NearlyOptimal Algorithm with Intensional Constraints
 In Proceedings of the 12th Conference of the EACL
"... We show how global constraints such as transitivity can be treated intensionally in a ZeroOne Integer Linear Programming (ILP) framework which is geared to find the optimal and coherent partition of coreference sets given a number of candidate pairs and their weights delivered by a pairwise classif ..."
Abstract

Cited by 5 (1 self)
 Add to MetaCart
(Show Context)
We show how global constraints such as transitivity can be treated intensionally in a ZeroOne Integer Linear Programming (ILP) framework which is geared to find the optimal and coherent partition of coreference sets given a number of candidate pairs and their weights delivered by a pairwise classifier (used as reliable clustering seed pairs). In order to find out whether ILP optimization, which is NPcomplete, actually is the best we can do, we compared the first consistent solution generated by our adaptation of an efficient ZeroOne algorithm with the optimal solution. The first consistent solution, which often can be found very fast, is already as good as the optimal solution; optimization is thus not needed. 1
Anaphora Resolution – What Helps in German
"... Although anaphora resolution has been a very active research area throughout the last ..."
Abstract
 Add to MetaCart
Although anaphora resolution has been a very active research area throughout the last