arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2008.13339cs.CL
收藏

一种用于联合医学关系抽取的双向树标记方案

A Bidirectional Tree Tagging Scheme for Joint Medical Relation Extraction

Peking University(北京大学)

Xukun Luo, Weijie Liu, Meng Ma, Ping Wang

摘要:

联合医学关系抽取是指用单一模型从医学文本中抽取由实体和关系组成的三元组。解决方案之一是将此任务转换为顺序标记任务。然而,在现有的工作中,以线性方式表示和标记三元组的方法无法处理重叠三元组,并且将三元组组织为图的方法面临着计算量大的挑战。在本文中,受医学文本中的树状关系结构的启发,我们提出了一种新的方案,称为双向树标记(BiTT),形成医疗关系三元组为两个两个二叉树,并将树转换成一个字级的标签序列。基于BiTT方案,我们开发了一个联合关系抽取模型来预测BiTT标签,并进一步有效地提取医学三元组。在两个医学数据集上,我们的模型在F1评分上比最佳基线高出2.0%和2.5%。更重要的是,我们的BiTT计划的模型也取得了可喜的结果在其他领域的三个公共数据集。

英文摘要:

Joint medical relation extraction refers to extracting triples, composed of entities and relations, from the medical text with a single model. One of the solutions is to convert this task into a sequential tagging task. However, in the existing works, the methods of representing and tagging the triples in a linear way failed to the overlapping triples, and the methods of organizing the triples as a graph faced the challenge of large computational effort. In this paper, inspired by the tree-like relation structures in the medical text, we propose a novel scheme called Bidirectional Tree Tagging (BiTT) to form the medical relation triples into two two binary trees and convert the trees into a word-level tags sequence. Based on BiTT scheme, we develop a joint relation extraction model to predict the BiTT tags and further extract medical triples efficiently. Our model outperforms the best baselines by 2.0\% and 2.5\% in F1 score on two medical datasets. What's more, the models with our BiTT scheme also obtain promising results in three public datasets of other domains.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑