Abstract
Document-level event extraction aims to extract event records from a whole document that contain numerous entities scattered across multiple sentences. Efficiently modeling the interactions among these entities is crucial. However, previous methods suffer from two main shortcomings. Firstly, they tend to implicitly model key information, which can result in representations with higher levels of noise. Secondly, they excessively consider irrelevant entities, thereby reducing extraction efficiency and precision. To address these issues, we propose a novel Two-phase Graph Inference Network (TGIN) approach for extracting document-level events. In the first phase, TGIN constructs a heterogeneous document-level graph to capture complex interactions among nodes of different granularity, enabling the acquisition of document-aware features. Subsequently, a dedicated module is developed to extract relevant entity pairs within the same event record. This module utilizes a key information aggregator with an attention mechanism to explicitly aggregate key sentences for entity pairs. In the second phase, the entity links predicted in the first phase serve as prior information to construct the entity-level graph, which focuses on modeling interactions between entity pairs that potentially share the same event link, effectively reducing error propagation. Experimental results on the publicly available document-level event extraction dataset ChFinAnn demonstrate the superiority of our framework over most existing models.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.