Hostname: page-component-77f85d65b8-5ngxj Total loading time: 0 Render date: 2026-03-29T04:49:11.463Z Has data issue: false hasContentIssue false

ASPER: Answer Set Programming Enhanced Neural Network Models for Joint Entity-Relation Extraction

Published online by Cambridge University Press:  25 July 2023

TRUNG HOANG LE
Affiliation:
Department of Computer Science, New Mexico State University, Las Cruces, NM, USA (e-mails: trungle@nmsu.edu, hcao@nmsu.edu, tson@cs.nmsu.edu)
HUIPING CAO
Affiliation:
Department of Computer Science, New Mexico State University, Las Cruces, NM, USA (e-mails: trungle@nmsu.edu, hcao@nmsu.edu, tson@cs.nmsu.edu)
TRAN CAO SON
Affiliation:
Department of Computer Science, New Mexico State University, Las Cruces, NM, USA (e-mails: trungle@nmsu.edu, hcao@nmsu.edu, tson@cs.nmsu.edu)

Abstract

A plethora of approaches have been proposed for joint entity-relation (ER) extraction. Most of these methods largely depend on a large amount of manually annotated training data. However, manual data annotation is time-consuming, labor-intensive, and error-prone. Human beings learn using both data (through induction) and knowledge (through deduction). Answer Set Programming (ASP) has been a widely utilized approach for knowledge representation and reasoning that is elaboration tolerant and adept at reasoning with incomplete information. This paper proposes a new approach, ASP-enhanced Entity-Relation extraction (ASPER), to jointly recognize entities and relations by learning from both data and domain knowledge. In particular, ASPER takes advantage of the factual knowledge (represented as facts in ASP) and derived knowledge (represented as rules in ASP) in the learning process of neural network models. We have conducted experiments on two real datasets and compare our method with three baselines. The results show that our ASPER model consistently outperforms the baselines.

Information

Type
Original Article
Copyright
© The Author(s), 2023. Published by Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)

Article purchase

Temporarily unavailable