A machine learning approach to coreference resolution of noun phrases
Computational Linguistics - Special issue on computational anaphora resolution
Resolving pronominal reference to abstract entities
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Combining sample selection and error-driven pruning for machine learning of coreference rules
EMNLP '02 Proceedings of the ACL-02 conference on Empirical methods in natural language processing - Volume 10
Kernel-based pronoun resolution with structured syntactic knowledge
ACL-44 Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics
Unrestricted Coreference: Identifying Entities and Events in OntoNotes
ICSC '07 Proceedings of the International Conference on Semantic Computing
A twin-candidate model for learning-based anaphora resolution
Computational Linguistics
BestCut: a graph algorithm for coreference resolution
EMNLP '06 Proceedings of the 2006 Conference on Empirical Methods in Natural Language Processing
Joint unsupervised coreference resolution with Markov logic
EMNLP '08 Proceedings of the Conference on Empirical Methods in Natural Language Processing
NAACL-Short '06 Proceedings of the Human Language Technology Conference of the NAACL, Companion Volume: Short Papers
Random walks for text semantic similarity
TextGraphs-4 Proceedings of the 2009 Workshop on Graph-based Methods for Natural Language Processing
WikiWalk: random walks on Wikipedia for semantic relatedness
TextGraphs-4 Proceedings of the 2009 Workshop on Graph-based Methods for Natural Language Processing
Identifying text polarity using random walks
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Unsupervised event coreference resolution with rich linguistic features
ACL '10 Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics
Coreference resolution with reconcile
ACLShort '10 Proceedings of the ACL 2010 Conference Short Papers
Resolving event noun phrases to their verbal mentions
EMNLP '10 Proceedings of the 2010 Conference on Empirical Methods in Natural Language Processing
End-to-end coreference resolution via hypergraph partitioning
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
A twin-candidate based approach for event pronoun resolution using composite kernel
COLING '10 Proceedings of the 23rd International Conference on Computational Linguistics
| Hi-index | 0.00 |
Event coreference is an important task in event extraction and other natural language processing tasks. Despite its importance, it was merely discussed in previous studies. In this article, we present a global coreference resolution system dedicated to various sophisticated event coreference phenomena. First, seven resolvers are utilized to resolve different event and object coreference mention pairs with a new instance selection strategy and new linguistic features. Second, a global solution—a modified random walk partitioning—is employed for the chain formation. Being the first attempt to apply the random walk model for coreference resolution, the revised model utilizes a sampling method, termination criterion, and stopping probability to greatly improve the effectiveness of random walk model for event coreference resolution. Last but not least, the new model facilitates a convenient way to incorporate sophisticated linguistic constraints and preferences, the related object mention graph, as well as pronoun coreference information not used in previous studies for effective chain formation. In total, these techniques impose more than 20% F-score improvement over the baseline system.