Abstract

In this study, we explored the complexities of document-level event extraction, a process that involves identifying multiple events and their associated arguments within a document. The primary challenges include (1) the distribution of event arguments across numerous sentences, resulting in long-distance dependencies, and (2) the complex relationships between multiple events due to the overlapping and dispersion of event arguments throughout the document. To address these issues, we propose the Binary Contrastive Generation (BCG) method. BCG utilizes binary auto-regressive generation in both the original and reversed sequences to learn binary-directed interdependency, thereby capturing the long-distance dependency of dispersed event arguments. To handle intricate multi-event relationships, BCG enhances the global semantic representation of multiple events by extraction-oriented contrastive learning. Specifically, event representations derived from identical event arguments in varying sequences are deemed positive pairs, while those from different event arguments in the same sequence are classified as negative pairs. Experimental results on three public datasets demonstrate that BCG outperforms existing methods, achieving an increase of 2.6 in absolute F1 score. Further analysis revealed that BCG effectively models the dependency of dispersed event arguments and enhances the semantic representation of multiple events.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call