mlsanityData to 7 Oct 2026

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

arXiv 2401.09775 ↗First posted 18 Jan 2024cs.CLcited by 1

Not on the map. Why?

Abstract (arXiv)

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.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 21 of its 35 references that are in the map. First posted on arXiv 18 Jan 2024.

Builds on

21 of 35 references.

References · 21

  1. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  2. 2019Sentence-BERT: Sentence Embeddings using Siamese BERT-Networkscited by 9,049
  3. 2019BART: Denoising Sequence-to-Sequence Pre-training for Natural Language Generation, Translation, and Comprehensioncited by 5,874
  4. 2019BERTScore: Evaluating Text Generation with BERTcited by 5,462
  5. 2018HotpotQA: A Dataset for Diverse, Explainable Multi-hop Question Answeringcited by 3,686
  6. 2014Sequence to Sequence Learning with Neural Networkscited by 2,974
  7. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,140
  8. 2018CoQA: A Conversational Question Answering Challengecited by 674
  9. 2018QuAC : Question Answering in Contextcited by 379
  10. 2017Lexically Constrained Decoding for Sequence Generation Using Grid Beam Searchcited by 234
  11. 2022COLD Decoding: Energy-based Constrained Text Generation with Langevin Dynamicscited by 159
  12. 2016Guided Open Vocabulary Image Captioning with Constrained Beam Searchcited by 105
9 more
  1. 2021Decontextualization: Making Sentences Stand-Alonecited by 101
  2. 2020Question Rewriting for Conversational Question Answeringcited by 93
  3. 2021Controlled Text Generation as Continuous Optimization with Multiple Constraintscited by 70
  4. 2020"I'd rather just go to bed": Understanding Indirect Answerscited by 36
  5. 2019Constrained Decoding for Neural NLG from Compositional Representations in Task-Oriented Dialoguecited by 35
  6. 2018A Deep Ensemble Model with Slot Alignment for Sequence-to-Sequence Natural Language Generationcited by 20
  7. 2022Reinforced Question Rewriting for Conversational Question Answeringcited by 19
  8. 2021Answering Product-Questions by Utilizing Questions from Other Contextually Similar Productscited by 12
  9. 2021Do Answers to Boolean Questions Need Explanations? Yescited by 5

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.