Employing Multiple Decomposable Attention Networks to Resolve Event Coreference

4Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Event coreference resolution is a challenging NLP task due to this task needs to understand the semantics of events. Different with most previous studies used probability-based or graph-based models, this paper introduces a novel neural network, MDAN (Multiple Decomposable Attention Networks), to resolve document-level event coreference from different views, i.e., event mention, event arguments and trigger context. Moreover, it applies a document-level global inference mechanism to further resolve the coreference chains. The experimental results on two popular datasets ACE and TAC-KBP illustrate that our model outperforms the two state-of-the-art baselines.

Cite

CITATION STYLE

APA

Fang, J., Li, P., & Zhou, G. (2018). Employing Multiple Decomposable Attention Networks to Resolve Event Coreference. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11109 LNAI, pp. 246–256). Springer Verlag. https://doi.org/10.1007/978-3-319-99501-4_21

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free