@inproceedings{f22ead2f247e4495ae8cabf360695c00,
title = "Coreference Resolution with Loose Transitivity Constraints",
abstract = "Our system treats coreference resolution as an integer linear programming (ILP) problem. Extending Denis and Baldridge (2007) and Finkel and Manning (2008)'s work, we exploit loose transitivity constraints on coreference pairs. Instead of enforcing transitivity closure constraints, which brings O (n 3 ) complexity, we employ a strategy to reduce the number of constraints without large performance decrease, i.e., eliminating coreference pairs with probability below a threshold. Experimental results show that it achieves a better performance than pairwise classifiers.",
author = "Xinxin Li and Xuan Wang and Shuhan Qi",
note = "Publisher Copyright: {\textcopyright} 2011 Association for Computational Linguistics; 15th Conference on Computational Natural Language Learning: Shared Task, CoNLL 2011 ; Conference date: 23-06-2011 Through 24-06-2011",
year = "2011",
language = "英语",
series = "CoNLL 2011 - 15th Conference on Computational Natural Language Learning: Shared Task, Proceedings",
publisher = "Association for Computational Linguistics (ACL)",
pages = "107--111",
editor = "Sameer Pradhan",
booktitle = "CoNLL 2011 - 15th Conference on Computational Natural Language Learning",
address = "澳大利亚",
}