跳到正文
AI NEWS JOURNAL
arXiv cs.CLAI NEWS / JOURNAL

用于上下文依赖句法分析的POS-签名演示检索

arXiv:2610.31966v1 发布类型:新 摘要:上下文学习的示范通常通过语义相似度进行检索,而这在结构化预测任务中可能并非相关性的良好替代指标。我们研究了面向通用依存句法分析的示范选择方法,采用一种基于词性签名的策略,该策略以加权词性统计特征表示句子,并从已标注的训练集里检索出三个长度兼容、由人工标注的示例。我们在UD英语网络树库测试集的全部2,077个句子上,对两种未经过微调的开放权重语言模型进行了评估,将该策略与按样本数量和格式匹配的固定三元组及语义三元组基线,以及零样本、思维链和批判性修正系统进行了比较。结果表明,基于词性签名的检索方式获得了最高的标注准确率

对应语言译文排队中,完成后自动更新。

arXiv:2610.31966v1 Announce Type: new

Abstract: Demonstrations for in-context learning are often retrieved by semantic similarity, which may be a poor proxy for relevance in structured prediction. We study demonstration selection for Universal Dependencies parsing with a POS-signature policy that represents sentences with weighted part-of-speech statistics and retrieves three length-compatible, gold-parsed examples from the labeled training split. We evaluate two open-weight language models without fine-tuning on all 2,077 sentences of the UD English Web Treebank test set, comparing the policy with shot- and format-matched fixed and semantic three-shot baselines, as well as zero-shot, chain-of-thought, and critique-refinement systems. POS-signature retrieval yields the highest labeled attachment score among the tested prompting systems for both models (72.4 and 73.2), outperforming semantic retrieval by 1.9 and 2.7 points; paired-bootstrap 95% confidence intervals exclude zero for both contrasts. Chain-of-thought and refinement comparisons vary across models. These exploratory results favor the tested POS-signature retrieval approach on English-EWT. We release the prompts, archived outputs, and evaluation code.

资料来源

arXiv cs.CL

相关主题

← 继续阅读全部动态