作为最大团发现的不连续命名实体识别
Discontinuous Named Entity Recognition as Maximal Clique Discovery
摘要:
命名实体识别(NER)仍然具有挑战性时,实体提及可以是不连续的。现有的方法将识别过程分为几个连续的步骤。在训练中,他们以黄金中间结果为条件进行预测,而在推理中依赖于前面步骤的模型输出,这引入了曝光偏差。为了解决这个问题,我们首先为每个句子构造一个片段图,其中每个节点表示一个片段(本身是连续的实体,或者是不连续实体的一部分),并且边连接属于同一实体的两个节点。节点和边可以分别生成在一个阶段与网格标记计划和学习共同使用一种新的架构命名为Mac。然后,不连续NER可以被重新表述为一个非参数的过程,发现最大的团在图中,并连接在每个团的跨度。在三个基准测试上的实验表明,我们的方法优于最先进的(SOTA)结果,在F1上提高了3.5个百分点,并实现了SOTA模型的5倍加速。
英文摘要:
Named entity recognition (NER) remains challenging when entity mentions can be discontinuous. Existing methods break the recognition process into several sequential steps. In training, they predict conditioned on the golden intermediate results, while at inference relying on the model output of the previous steps, which introduces exposure bias. To solve this problem, we first construct a segment graph for each sentence, in which each node denotes a segment (a continuous entity on its own, or a part of discontinuous entities), and an edge links two nodes that belong to the same entity. The nodes and edges can be generated respectively in one stage with a grid tagging scheme and learned jointly using a novel architecture named Mac. Then discontinuous NER can be reformulated as a non-parametric process of discovering maximal cliques in the graph and concatenating the spans in each clique. Experiments on three benchmarks show that our method outperforms the state-of-the-art (SOTA) results, with up to 3.5 percentage points improvement on F1, and achieves 5x speedup over the SOTA model.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。