In April 2016 Manchester eScholar was replaced by the University of Manchester’s new Research Information Management System, Pure. In the autumn the University’s research outputs will be available to search and browse via a new Research Portal. Until then the University’s full publication record can be accessed via a temporary portal and the old eScholar content is available to search and browse via this archive.

Textual Relation Extraction with Edge-oriented Graph Neural Models

Christopoulou, Efstathia

[Thesis]. Manchester, UK: The University of Manchester; 2020.

Access to files

Abstract

Textual Relation Extraction is an important task for Natural Language Processing that aims to detect semantic relations between named entities in text. It can be seen as a multi-aspect challenge, with varying applications to several downstream tasks such as Question Answering, Knowledge Base completion and Event Extraction. In this dissertation, we aim to address two of the most common subtasks of Relation Extraction: the detection of relations inside sentences, also known as intra-sentence RE, as well as across sentences, known as inter-sentence RE. Our objectives in this study are two fold. Firstly, we suggest that interactions between multiple pairs should be taken into account when modelling relations, so as to enrich pair representations. Secondly, we want to leverage information encoded in the connections between different pairs, rather than the entities of the pair alone. To realise both goals, we propose a novel graph-based neural model, which we call edge-oriented; that is, it exploits the edges of a graph, which by definition correspond to relations, in the form of multi-dimensional representations. The proposed model can construct and/or update edge representations between pairs of nodes using other edges in the graph. As a result, we simultaneously model multiple pairs in a textual snippet by forming their representations as multi-hop interactions between their arguments. Throughout this work, we validate the proposed approach on several datasets, showing that it effectively improves relation detection on both multi-pair and single-pair sentences in different domains. Regarding document-level relations, we further propose a simple but intuitive way to construct heterogeneous document-level graphs and infer interactions between their nodes. We suggest that simple graph structures that can be constructed with heuristics can effectively capture interactions of interest in documents. In addition, incorporating information from the entire document proves beneficial for both intra- and inter-sentence relations. Overall, our edge-oriented model achieves promising results, thus demonstrating its potential suitability for relation extraction and other graph-based tasks.

Bibliographic metadata

Type of resource:
Content type:
Form of thesis:
Type of submission:
Degree type:
Doctor of Philosophy
Degree programme:
PhD Computer Science
Publication date:
Location:
Manchester, UK
Total pages:
227
Abstract:
Textual Relation Extraction is an important task for Natural Language Processing that aims to detect semantic relations between named entities in text. It can be seen as a multi-aspect challenge, with varying applications to several downstream tasks such as Question Answering, Knowledge Base completion and Event Extraction. In this dissertation, we aim to address two of the most common subtasks of Relation Extraction: the detection of relations inside sentences, also known as intra-sentence RE, as well as across sentences, known as inter-sentence RE. Our objectives in this study are two fold. Firstly, we suggest that interactions between multiple pairs should be taken into account when modelling relations, so as to enrich pair representations. Secondly, we want to leverage information encoded in the connections between different pairs, rather than the entities of the pair alone. To realise both goals, we propose a novel graph-based neural model, which we call edge-oriented; that is, it exploits the edges of a graph, which by definition correspond to relations, in the form of multi-dimensional representations. The proposed model can construct and/or update edge representations between pairs of nodes using other edges in the graph. As a result, we simultaneously model multiple pairs in a textual snippet by forming their representations as multi-hop interactions between their arguments. Throughout this work, we validate the proposed approach on several datasets, showing that it effectively improves relation detection on both multi-pair and single-pair sentences in different domains. Regarding document-level relations, we further propose a simple but intuitive way to construct heterogeneous document-level graphs and infer interactions between their nodes. We suggest that simple graph structures that can be constructed with heuristics can effectively capture interactions of interest in documents. In addition, incorporating information from the entire document proves beneficial for both intra- and inter-sentence relations. Overall, our edge-oriented model achieves promising results, thus demonstrating its potential suitability for relation extraction and other graph-based tasks.
Thesis main supervisor(s):
Thesis co-supervisor(s):
Language:
en

Institutional metadata

University researcher(s):

Record metadata

Manchester eScholar ID:
uk-ac-man-scw:325179
Created by:
Christopoulou, Efstathia
Created:
22nd June, 2020, 21:42:36
Last modified by:
Christopoulou, Efstathia
Last modified:
2nd July, 2020, 11:24:18

Can we help?

The library chat service will be available from 11am-3pm Monday to Friday (excluding Bank Holidays). You can also email your enquiry to us.