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

通过不相似跨度检测实现可解释的语义文本相似性

Explainable Semantic Textual Similarity via Dissimilar Span Detection

School of Computation, Information and Technology(计算、信息与技术学院);Technical University of Munich(慕尼黑技术大学);Munich Center for Machine Learning (MCML)(慕尼黑机器学习中心)

Diego Miguel Lozano, Daryna Dementieva, Alexander Fraser

AI总结:

本文提出不相似跨度检测任务,旨在识别文本对中语义不同的跨度,以提高语义文本相似性任务的可解释性,并通过新数据集和基线方法评估,显示其在同义词检测中的提升效果。

摘要:

语义文本相似性(STS)是许多自然语言处理(NLP)应用的关键组成部分。然而,现有方法通常将语义细微差别简化为单一分数,限制了可解释性。为此,我们引入了不相似跨度检测(DSD)任务,旨在识别文本对中语义不同的跨度。这有助于用户理解哪些特定词或标记会影响相似性分数,或用于改进依赖STS的下游任务性能。此外,我们发布了适合该任务的新数据集,即跨度相似性数据集(SSD),通过结合大型语言模型(LLMs)和人工验证的半自动化流程开发。我们提出了并评估了不同基线方法,包括基于LIME、SHAP、LLMs的无监督方法以及我们的方法和额外的监督方法。尽管LLMs和监督模型在性能上最高,但整体结果仍较低,突显了该任务的复杂性。最后,我们设置了一个额外实验,显示DSD如何在特定的同义词检测任务中提高性能。

英文摘要:

Semantic Textual Similarity (STS) is a crucial component of many Natural Language Processing (NLP) applications. However, existing approaches typically reduce semantic nuances to a single score, limiting interpretability. To address this, we introduce the task of Dissimilar Span Detection (DSD), which aims to identify semantically differing spans between pairs of texts. This can help users understand which particular words or tokens negatively affect the similarity score, or be used to improve performance in STS-dependent downstream tasks. Furthermore, we release a new dataset suitable for the task, the Span Similarity Dataset (SSD), developed through a semi-automated pipeline combining large language models (LLMs) with human verification. We propose and evaluate different baseline methods for DSD, both unsupervised, based on LIME, SHAP, LLMs, and our own method, as well as an additional supervised approach. While LLMs and supervised models achieve the highest performance, overall results remain low, highlighting the complexity of the task. Finally, we set up an additional experiment that shows how DSD can lead to increased performance in the specific task of paraphrase detection.

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

↑