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

将是/否问答可控去语境化为事实陈述

Controllable Decontextualization of Yes/No Question and Answers into Factual Statements

The Ohio State University(俄亥俄州立大学);Amazon.com, Inc.(亚马逊公司)

Lingbo Mo, Besnik Fetahu, Oleg Rokhlenko, Shervin Malmasi

AI总结:

本文研究极性问答答案的可控去语境化问题,提出利用软约束的 Transformer 序列到序列模型,将问答重写为语义等价的简洁事实陈述,并在三个数据集上验证其优于基线。

摘要:

是/否问题或称极性问题,代表主要的语言问题类别之一。它们由一个主要疑问小句构成,其答案是二元的(肯定或否定)。极性问答(PQA)是一种宝贵的知识资源,存在于许多社区及其他经过整理的问答来源中,例如论坛或电子商务应用。在其他语境中单独使用极性问题的答案并非易事。答案是语境化的,并假定已经提供了疑问小句以及提问者和回答者之间的任何共享知识。我们解决了将极性问题的答案可控重写为去语境化且简洁的事实陈述这一问题。我们提出了一个 Transformer 序列到序列模型,该模型利用软约束来确保可控重写,使输出陈述在语义上等价于其 PQA 输入。在三个独立的 PQA 数据集上通过自动化和人工评估指标进行的评估表明,与现有基线相比,我们提出的方法取得了最佳性能。

英文摘要:

Yes/No or polar questions represent one of the main linguistic question categories. They consist of a main interrogative clause, for which the answer is binary (assertion or negation). Polar questions and answers (PQA) represent a valuable knowledge resource present in many community and other curated QA sources, such as forums or e-commerce applications. Using answers to polar questions alone in other contexts is not trivial. Answers are contextualized, and presume that the interrogative question clause and any shared knowledge between the asker and answerer are provided. We address the problem of controllable rewriting of answers to polar questions into decontextualized and succinct factual statements. We propose a Transformer sequence to sequence model that utilizes soft-constraints to ensure controllable rewriting, such that the output statement is semantically equivalent to its PQA input. Evaluation on three separate PQA datasets as measured through automated and human evaluation metrics show that our proposed approach achieves the best performance when compared to existing baselines.

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

↑