用关系先验提升大模型文档级关系抽取效果
Relation as a Prior: A Novel Paradigm for LLM-based Document-level Relation Extraction
- 先判断实体对是否有关系,再提取三元组
- 在两个基准上达到最新最佳性能
- 适合需要精准关系抽取的场景
大语言模型在文档理解方面表现优异,但在文档级关系抽取(DocRE)任务中仍存在性能差距,主要因现有方法‘先抽取实体再预测关系’的范式导致:(1) 大量无关实体对引入噪声,干扰真实关系判断;(2) 模型虽能识别语义关联,但超出预定义关系类别的输出仍被视为错误。为此,本文提出新的‘关系作为先验’(RelPrior)范式:针对问题(1),利用二元关系作为先验,筛选出相关实体对,减少预测噪声;针对问题(2),以预定义关系为先验匹配实体进行三元组抽取,避免因严格标签限制导致的误判。在两个基准数据集上的大量实验表明,RelPrior显著优于现有基于LLM的方法,达到当前最优性能。
原文摘要 · Abstract (English)
Large Language Models (LLMs) have demonstrated their remarkable capabilities in document understanding. However, recent research reveals that LLMs still exhibit performance gaps in Document-level Relation Extraction (DocRE) as requiring fine-grained comprehension. The commonly adopted "extract entities then predict relations" paradigm in LLM-based methods leads to these gaps due to two main reasons: (1) Numerous unrelated entity pairs introduce noise and interfere with the relation prediction for truly related entity pairs. (2) Although LLMs have identified semantic associations between entities, relation labels beyond the predefined set are still treated as prediction errors. To address these challenges, we propose a novel Relation as a Prior (RelPrior) paradigm for LLM-based DocRE. For challenge (1), RelPrior utilizes binary relation as a prior to extract and determine whether two entities are correlated, thereby filtering out irrelevant entity pairs and reducing prediction noise. For challenge (2), RelPrior utilizes predefined relation as a prior to match entities for triples extraction instead of directly predicting relation. Thus, it avoids misjudgment caused by strict predefined relation labeling. Extensive experiments on two benchmarks demonstrate that RelPrior achieves state-of-the-art performance, surpassing existing LLM-based methods.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。