Pith. sign in

REVIEW 1 cited by

Edge-Enhanced Graph Convolution Networks for Event Detection with Syntactic Relation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2002.10757 v2 pith:MKOZHVQY submitted 2020-02-25 cs.CL

classification cs.CL
keywords dependencyinformationeventgraphnetworkssyntacticconvolutiondetection
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Event detection (ED), a key subtask of information extraction, aims to recognize instances of specific event types in text. Previous studies on the task have verified the effectiveness of integrating syntactic dependency into graph convolutional networks. However, these methods usually ignore dependency label information, which conveys rich and useful linguistic knowledge for ED. In this paper, we propose a novel architecture named Edge-Enhanced Graph Convolution Networks (EE-GCN), which simultaneously exploits syntactic structure and typed dependency label information to perform ED. Specifically, an edge-aware node update module is designed to generate expressive word representations by aggregating syntactically-connected words through specific dependency types. Furthermore, to fully explore clues hidden in dependency edges, a node-aware edge update module is introduced, which refines the relation representations with contextual information. These two modules are complementary to each other and work in a mutual promotion way. We conduct experiments on the widely used ACE2005 dataset and the results show significant improvement over competitive baseline methods.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Multi-Order Hyperbolic Graph Convolution and Aggregated Attention for Social Event Detection

    cs.SI 2025-02 conditional novelty 4.0 of 10

    MOHGCAA, a multi-order hyperbolic graph convolution with aggregated attention, is reported to outperform prior Euclidean and hyperbolic baselines on four datasets in supervised and unsupervised settings.

Pith tools