Event Detection with Multi-Order Graph Convolution and Aggregated Attention (D19-1)
Copied to clipboard
| Challenge: | Existing methods for event detection use first-order syntactic relations to identify trigger words. |
| Approach: | They propose a dependency tree-based method to model and aggregate multi-order syntactic representations in sentences. |
| Outcome: | The proposed method outperforms existing methods on a benchmark dataset . it uses a dependency tree based graph convolution network with aggregative attention . |
Similar Papers
Edge-Enhanced Graph Convolution Networks for Event Detection with Syntactic Relation (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Event detection (ED) is a key subtask of information extraction. |
| Approach: | They propose an architecture that exploits syntactic structure and typed dependency label information to perform event detection. |
| Outcome: | The proposed architecture exploits syntactic structure and typed dependency label information to perform ED. |
Event Detection with Dual Relational Graph Attention Networks (2022.coling-1)
Copied to clipboard
| Challenge: | Existing approaches to event detection confuse syntactic relations and introduce redundant or noisy information, leading to performance degradation. |
| Approach: | They propose a model that exploits syntactic and semantic relations to alleviate the problem by combining syntatic and semantic knowledge. |
| Outcome: | The proposed model outperforms state-of-the-art methods on a ACE2005 benchmark dataset. |
Event Detection: Gate Diversity and Syntactic Importance Scores for Graph Convolution Neural Networks (2020.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies on event detection (ED) have shown that the syntactic dependency graph can be employed in graph convolutional neural networks (GCNs) but the computation of the hidden vectors in such graph-based models is agnostic to the trigger candidate words, leaving irrelevant information for the trigger candidates. |
| Approach: | They propose a mechanism to filter noisy information in the hidden vectors of graph-based models based on the information from the trigger candidate. |
| Outcome: | The proposed model achieves state-of-the-art on two ED datasets. |
Event Detection as Graph Parsing (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to event detection focus on using syntactic dependency structures or external knowledge to boost the performance. |
| Approach: | They propose a graph parsing problem that explicitly models multiple event correlations and utilizes rich information conveyed by event type and subtype. |
| Outcome: | The proposed model outperforms existing models on the public ACE2005 dataset by 4.2% on the dataset. |
Jointly Multiple Events Extraction via Attention-based Graph Information Aggregation (D18-1)
Copied to clipboard
| Challenge: | Event extraction is of practical utility in natural language processing . it is common that multiple events exist in the same sentence, causing difficulties in extracting them . |
| Approach: | They propose a framework to jointly extract multiple event triggers and arguments . they introduce syntactic shortcut arcs to enhance information flow and attention-based graph convolution networks to model graph information. |
| Outcome: | The proposed framework achieves competitive results compared with state-of-the-art methods. |
Self-Attention Graph Residual Convolutional Networks for Event Detection with dependency relations (2021.findings-emnlp)
Copied to clipboard
| Challenge: | Existing methods to classify events using syntactic dependency relations have not been developed. |
| Approach: | They propose a model which combines syntactic dependency relations with attention-based dynamic tensors to mine node-to-node latent dependency relations via self-attention mechanism. |
| Outcome: | The proposed model improves on the ACE2005 dataset and compares with baseline models. |
Intra-Event and Inter-Event Dependency-Aware Graph Network for Event Argument Extraction (2023.findings-emnlp)
Copied to clipboard
| Challenge: | Existing models do not build dependency information among event argument roles . Existing methods do not learn the interactions between different roles based on event structure . |
| Approach: | They propose an intra-event and inter-e event dependency-aware graph network to model dependencies between roles . they use event structure as the fundamental unit to construct role dependencies within events . |
| Outcome: | The proposed model improves on the ACE05, RAMS, and WikiEvents datasets. |
Syntactic Graph Convolutional Network for Spoken Language Understanding (2020.coling-main)
Copied to clipboard
| Challenge: | Existing work on slot filling and intent detection builds joint models without prior knowledge of linguistic knowledge. |
| Approach: | They propose a joint model that integrates syntactic structure for learning slot filling and intent detection jointly. |
| Outcome: | The proposed model outperforms existing models on two public benchmark datasets and further improves on slot filling and intent detection. |
SSEGCN: Syntactic and Semantic Enhanced Graph Convolutional Network for Aspect-based Sentiment Analysis (2022.naacl-main)
Copied to clipboard
| Challenge: | Aspect-based Sentiment Analysis (ABSA) aims to predict sentiment polarity towards aspects in sentences . a novel model for ABSA is proposed, but how to harness it is still a challenge . |
| Approach: | They propose a syntactic and semantic enhanced Graph Convolutional Network (SSEGCN) model for ABSA task using aspect-aware attention mechanism and self-attention. |
| Outcome: | The proposed model outperforms state-of-the-art methods on benchmark datasets. |
Graph Convolutional Networks for Event Causality Identification with Rich Document-level Structures (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing models for document-level Event Causality Identification (ECI) are limited to intra-sentence contexts where event mention pairs are presented in the same sentences. |
| Approach: | They propose a deep learning model that accepts inter-sentence event mention pairs . they use interaction graphs to capture relevant connections between important objects . |
| Outcome: | The proposed model achieves state-of-the-art on two benchmark datasets. |