Relation classification is an important semantic processing task in the field
of natural language processing. In this paper, we propose the task of relation
classification for Chinese literature text. A new dataset of Chinese literature
text is constructed to facilitate the study in this task. We present a novel
model, named Structure Regularized Bidirectional Recurrent Convolutional Neural
Network (SR-BRCNN), to identify the relation between entities. The proposed
model learns relation representations along the shortest dependency path (SDP)
extracted from the structure regularized dependency tree, which has the
benefits of reducing the complexity of the whole model. Experimental results
show that the proposed method significantly improves the F1 score by 10.3, and
outperforms the state-of-the-art approaches on Chinese literature text.

本文提出了一个用于中文文学文本的关系分类任务并构建了一个新的数据集，通过 SR-BRCNN 模型基于结构规则的依存树上提取的最短依赖路径来识别实体之间的关系，实验结果表明该方法 F1 得分提高了 10.3，且在中文文学文本上优于当前的最先进方法。