arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2604.08752cs.CLcs.AI
收藏

大型语言模型在复杂图中对监督关系抽取性能欠佳

LLMs Underperform Graph-Based Parsers on Supervised Relation Extraction for Complex Graphs

University of Bologna(博洛尼亚大学);Dalhousie University(达尔豪斯大学)

Paolo Gajo, Domenic Rosati, Hassan Sajjad, Alberto Barrón-Cedeño

AI总结:

本文研究了大型语言模型在复杂图结构下的关系抽取性能,发现基于图的解析器在复杂图中表现更优,主要贡献是验证了图解析器在复杂场景下的优势。

摘要:

关系抽取是构建知识图谱等应用中的基本组件。大型语言模型(LLMs)已被用作关系抽取的有前景工具,无论是监督学习还是上下文学习设置。然而,在这项工作中,我们展示了当文本下隐藏的图结构具有高度复杂性时,它们的性能仍然落后于许多更小的架构。为了证明这一点,我们评估了四个LLM与基于图的解析器在六个关系抽取数据集上的表现,这些数据集包含大小和复杂性各不相同的句子图。我们的结果表明,随着输入文档中关系数量的增加,基于图的解析器相对于LLM的性能优势愈加明显。这使得在存在复杂语言图的情况下,轻量级的基于图的解析器成为更优的选择。

英文摘要:

Relation extraction represents a fundamental component in the process of creating knowledge graphs, among other applications. Large language models (LLMs) have been adopted as a promising tool for relation extraction, both in supervised and in-context learning settings. However, in this work we show that their performance still lags behind much smaller architectures when the linguistic graph underlying a text has great complexity. To demonstrate this, we evaluate four LLMs against a graph-based parser on six relation extraction datasets with sentence graphs of varying sizes and complexities. Our results show that the graph-based parser increasingly outperforms the LLMs, as the number of relations in the input documents increases. This makes the much lighter graph-based parser a superior choice in the presence of complex linguistic graphs.

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

↑