Dependency tree positional encoding method for relation extraction

Citations

SCOPUS

5

초록

Dependency trees are recently used for relation extraction tasks to capture long-range relations among entities. Many studies have proposed various methods to apply dependency tree features to relation extraction models. However, most of these approaches are difficult to apply to different models especially when the overall structure of a model is changed or newly suggested for inserting information of the dependency trees. Existing approaches, which are a structure to use dependency trees such as graph convolutional networks (GCNs), do not use these information into input representations. In this paper, we propose a new method of injecting dependency tree information into the input representations of a model with positional encoding of dependency trees. Specifically, to incorporate dependency tree information with input vectors, we present a novel strategy to convert dependency tree features to positional encoding. The existing model (BERT) that applied our method achieves a state-of-the-art performance without changing the original model on the TACRED and SemEval-2010 Task 8, the standard benchmark dataset in relation extraction. Through detailed analysis, we show that our method is effective complementarily for relation extraction models, and is also easy to use for other models.

키워드

BERTdependency treepositional encodingrelation extractionBenchmarkingConvolutional neural networksEncoding (symbols)ExtractionForestrySignal encodingBenchmark datasetsConvolutional networksDependency treesEncoding methodsNovel strategiesOriginal modelRelation extractionState-of-the-art performanceTrees (mathematics)
제목
Dependency tree positional encoding method for relation extraction
저자
Cho, ChunghyeonChoi, Yong Suk
DOI
10.1145/3412841.3441977
발행일
2021-03
유형
Conference Paper
저널명
Proceedings of the ACM Symposium on Applied Computing
페이지
1012 ~ 1020