Chinese relation extraction based on dynamic dependency driving and multiple feature enhancement.

Saved in:

Bibliographic Details
Title:	Chinese relation extraction based on dynamic dependency driving and multiple feature enhancement.
Authors:	HUANG, Mingwei¹ huangmw_ly@163.com, HAN, Hu^1,2 hanhu_lzjtu@mail.lzjtu.cn, XU, Xuefeng¹ xuefeng_1998@163.com, WANG, Tingting¹ wangtt_ly@163.com
Source:	Computer Engineering & Science / Jisuanji Gongcheng yu Kexue. Feb2026, Vol. 48 Issue 2, p319-329. 11p.
Subjects:	Natural language processing, Graph neural networks, Semantics (Philosophy), Syntax (Grammar)
Abstract:	As a subtask in the field of natural language processing (NLP), relation extraction aims to identify the relationships between specific entity pairs from unstructured text. Aiming at the problems of incomplete extraction of key semantic features and the introduction of syntactic knowledge accompanied by a large amount of noise information in existing studies on Chinese relation extraction, a dynamic dependency-driven and multiple feature-enhanced Chinese relation extraction model is constructed. The model consists of two channels. In channel one, the original dependency parse trees for entity pairs are reconstructed and dynamically pruned to remove redundant syntactic dependencies, and deep syntactic features are captured through a graph convolutional network (GCN). In channel two, relative position vectors are constructed for entities, and segmented feature extraction is performed on these vectors using segmented convolution to obtain local semantic features. Global semantic features are captured using a hybrid attention mechanism, and local and global semantic features are fused through a gating mechanism. Finally, the feature representations from the two channels are interactively fused. Experimental results demonstrate that the model outperforms baseline models on four public datasets: COAE2016, SanWen, FinRE, and SciRE. [ABSTRACT FROM AUTHOR]
	Copyright of Computer Engineering & Science / Jisuanji Gongcheng yu Kexue is the property of Computer Engineering & Science and its content may not be copied or emailed to multiple sites without the copyright holder's express written permission. Additionally, content may not be used with any artificial intelligence tools or machine learning technologies. However, users may print, download, or email articles for individual use. This abstract may be abridged. No warranty is given about the accuracy of the copy. Users should refer to the original published version of the material for the full abstract. (Copyright applies to all Abstracts.)
Database:	Engineering Source

Description
Abstract:	As a subtask in the field of natural language processing (NLP), relation extraction aims to identify the relationships between specific entity pairs from unstructured text. Aiming at the problems of incomplete extraction of key semantic features and the introduction of syntactic knowledge accompanied by a large amount of noise information in existing studies on Chinese relation extraction, a dynamic dependency-driven and multiple feature-enhanced Chinese relation extraction model is constructed. The model consists of two channels. In channel one, the original dependency parse trees for entity pairs are reconstructed and dynamically pruned to remove redundant syntactic dependencies, and deep syntactic features are captured through a graph convolutional network (GCN). In channel two, relative position vectors are constructed for entities, and segmented feature extraction is performed on these vectors using segmented convolution to obtain local semantic features. Global semantic features are captured using a hybrid attention mechanism, and local and global semantic features are fused through a gating mechanism. Finally, the feature representations from the two channels are interactively fused. Experimental results demonstrate that the model outperforms baseline models on four public datasets: COAE2016, SanWen, FinRE, and SciRE. [ABSTRACT FROM AUTHOR]
ISSN:	1007130X
DOI:	10.3969/j.issn.1007-130X.2026.02.013