Rights accessRestricted access - publisher's policy
This paper presents a constraint-based
graph partitioning approach to coreference
resolution solved by relaxation labeling.
The approach combines the strengths of groupwise classifiers and chain formation
methods in one global method. Experiments
show that our approach significantly
outperforms systems based on separate
classification and chain formation steps, and that it achieves the best results
in the state of the art for the same dataset
CitationSapena, E.; Padró, L.; Turmo, J. A global relaxation labeling approach to coreference resolution. A: International Conference on Computational Linguistics. "Proceedings of 23rd International Conference on Computational Linguistics (COLING - 2010)". Beijing: 2010, p. 1086-1094.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com