A Walk-based Model on Entity Graphs for Relation Extraction

We present a novel graph-based neural network model for relation extraction. Our model treats multiple pairs in a sentence simultaneously and considers interactions among them. All the entities in a sentence are placed as nodes in a fully-connected graph structure. The edges are represented with position-aware contexts around the entity pairs. In order to consider different relation paths between two entities, we construct up to l-length walks between each pair. The resulting walks are merged and iteratively used to update the edge representations into longer walks representations. We show that the model achieves performance comparable to the state-of-the-art systems on the ACE 2005 dataset without using any external tools.

PDF Abstract ACL 2018 PDF ACL 2018 Abstract

Datasets


Results from the Paper


 Ranked #1 on Relation Extraction on ACE 2005 (Cross Sentence metric)

     Get a GitHub badge
Task Dataset Model Metric Name Metric Value Global Rank Result Benchmark
Relation Extraction ACE 2005 Walk-based model Relation classification F1 64.2 # 4
Cross Sentence No # 1

Methods


No methods listed for this paper. Add relevant methods here