SOTAVerified

A Walk-based Model on Entity Graphs for Relation Extraction

2019-02-19ACL 2018Code Available0· sign in to hype

Fenia Christopoulou, Makoto Miwa, Sophia Ananiadou

Code Available — Be the first to reproduce this paper.

Reproduce

Code

Abstract

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.

Tasks

Benchmark Results

DatasetModelMetricClaimedVerifiedStatus
ACE 2005Walk-based modelRelation classification F164.2Unverified

Reproductions