A Search-based Neural Model for Biomedical Nested and Overlapping Event Detection
Kurt Espinosa, Makoto Miwa, Sophia Ananiadou

TL;DR
This paper introduces a search-based neural network model for detecting nested and overlapping biomedical events, effectively modeling complex event structures without relying on syntactic or hand-engineered features.
Contribution
The paper presents a novel search-based neural network approach that detects nested and overlapping events as a relation graph search, outperforming existing models in efficiency and accuracy.
Findings
Achieves comparable F1-score to state-of-the-art TEES system.
More computationally efficient than previous models.
Does not require syntactic or hand-engineered features.
Abstract
We tackle the nested and overlapping event detection task and propose a novel search-based neural network (SBNN) structured prediction model that treats the task as a search problem on a relation graph of trigger-argument structures. Unlike existing structured prediction tasks such as dependency parsing, the task targets to detect DAG structures, which constitute events, from the relation graph. We define actions to construct events and use all the beams in a beam search to detect all event structures that may be overlapping and nested. The search process constructs events in a bottom-up manner while modelling the global properties for nested and overlapping structures simultaneously using neural networks. We show that the model achieves performance comparable to the state-of-the-art model Turku Event Extraction System (TEES) on the BioNLP Cancer Genetics (CG) Shared Task 2013 without…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsBiomedical Text Mining and Ontologies · Machine Learning in Bioinformatics · Topic Modeling
