Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
A machine learning approach to coreference resolution of noun phrases
Computational Linguistics - Special issue on computational anaphora resolution
Improving machine learning approaches to coreference resolution
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
A mention-synchronous coreference resolution algorithm based on the Bell tree
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Computing locally coherent discourses
ACL '04 Proceedings of the 42nd Annual Meeting on Association for Computational Linguistics
Semantic role labeling via integer linear programming inference
COLING '04 Proceedings of the 20th international conference on Computational Linguistics
On coreference resolution performance metrics
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
Exploiting semantic role labeling, WordNet and Wikipedia for coreference resolution
HLT-NAACL '06 Proceedings of the main conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics
Enforcing transitivity in coreference resolution
HLT-Short '08 Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics on Human Language Technologies: Short Papers
Incremental integer linear programming for non-projective dependency parsing
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
BestCut: a graph algorithm for coreference resolution
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Specialized models and ranking for coreference resolution
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
Beyond the pipeline: discrete optimization in NLP
CONLL '05 Proceedings of the Ninth Conference on Computational Natural Language Learning
Supervised noun phrase coreference research: the first fifteen years
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Anaphora resolution with real preprocessing
IceTAL'10 Proceedings of the 7th international conference on Advances in natural language processing
Real anaphora resolution is hard: the case of German
TSD'10 Proceedings of the 13th international conference on Text, speech and dialogue
A global relaxation labeling approach to coreference resolution
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics: Posters
Bootstrapping coreference resolution using word associations
HLT '11 Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies - Volume 1
An incremental model for coreference resolution with restrictive antecedent accessibility
CONLL Shared Task '11 Proceedings of the Fifteenth Conference on Computational Natural Language Learning: Shared Task
| Hi-index | 0.00 |
We show how global constraints such as transitivity can be treated intensionally in a Zero-One 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 NP-complete, actually is the best we can do, we compared the first consistent solution generated by our adaptation of an efficient Zero-One 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.