An Autoregressive Text-to-Graph Framework for Joint Entity and Relation Extraction

5Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

Abstract

In this paper, we propose a novel method for joint entity and relation extraction from unstructured text by framing it as a conditional sequence generation problem. In contrast to conventional generative information extraction models that are left-to-right token-level generators, our approach is span-based. It generates a linearized graph where nodes represent text spans and edges represent relation triplets. Our method employs a transformer encoder-decoder architecture with pointing mechanism on a dynamic vocabulary of spans and relation types. Our model can capture the structural characteristics and boundaries of entities and relations through span representations while simultaneously grounding the generated output in the original text thanks to the pointing mechanism. Evaluation on benchmark datasets validates the effectiveness of our approach, demonstrating competitive results. Code is available at https://github.com/urchade/ATG.

Cite

CITATION STYLE

APA

Zaratiana, U., Tomeh, N., Holat, P., & Charnois, T. (2024). An Autoregressive Text-to-Graph Framework for Joint Entity and Relation Extraction. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 38, pp. 19477–19484). Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v38i17.29919

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free