Challenge: entailment : absence of questions classified based on their rewriting hardness or difficulty . enactment of QR system to rewrite context-dependent questions in CQA requires context knowledge .
Approach: They propose a heuristic method to automatically classify questions into subsets of varying hardness . they then conduct a human evaluation to annotate the rewriting hardness of questions .
Outcome: The proposed learning framework improves the overall performance compared to baselines.

Similar Papers

Integrating Question Rewrites in Conversational Question Answering: A Reinforcement Learning Approach (2022.acl-srw)

Copied to clipboard

Challenge: Existing approaches to improve QR performance dependencies among dialogue history dependencies are limited.
Approach: They propose a reinforcement learning approach that integrates QR and CQA tasks without corresponding labeled QR datasets.
Outcome: The proposed approach improves existing pipeline approaches in conversational question answering (QA) existing methods depend on assumption of corresponding QR datasets for every CQA dataset, resulting in poor performance.
Reinforced Question Rewriting for Conversational Question Answering (2022.emnlp-industry)

Copied to clipboard

Challenge: Existing approaches to CQA involve training new models from scratch . existing approaches are expensive and often not feasible .
Approach: They propose to use QA feedback to supervise the rewriting model with reinforcement learning.
Outcome: The proposed model can improve QA performance over baselines for extractive and retrieval QA.
Beyond Static Synthetic Noise: Assessing the Robustness of Large Language Models to Natural Context Variation in the Real World (2026.findings-acl)

Copied to clipboard

Challenge: Current robustness evaluation methods rely on static synthetic perturbations to stress-test models.
Approach: They propose a framework for automatically evaluating QA models under naturally occurring textual perturbations by replacing context passages with revised Wikipedia edit histories.
Outcome: The proposed framework replaces context passages with revised Wikipedia edit histories to improve model performance.
Guiding the Growth: Difficulty-Controllable Question Generation through Step-by-Step Rewriting (2021.acl-long)

Copied to clipboard

Challenge: Existing QG systems perform substantially worse in answering multi-hop questions than single-hop ones.
Approach: They propose a framework that progressively increases question difficulty through step-by-step rewriting under the guidance of an extracted reasoning chain.
Outcome: The proposed framework increases question difficulty through step-by-step rewriting under the guidance of an extracted reasoning chain.
Adaptive Query Rewriting: Aligning Rewriters through Marginal Probability of Conversational Answers (2024.emnlp-main)

Copied to clipboard

Challenge: Existing methods to incorporate retriever’s preference during the training of query rewriting models rely on extensive annotations such as in-domain rewrites and/or relevant passage labels, limiting their generalization and adaptation capabilities.
Approach: They propose a framework for training query rewriting models with limited rewrite annotations from seed datasets and completely no passage label.
Outcome: The proposed approach decontexualizes conversational queries into self-contained questions suitable for off-the-shelf retrievers.
Improving the Robustness of Question Answering Systems to Question Paraphrasing (P19-1)

Copied to clipboard

Challenge: Despite advancement of question answering systems, generalizability of QA models is a topic of concern.
Approach: They propose to use a neural paraphrasing model to generate multiple paraphrased questions for a given source question and a set of paraphrase suggestions to re-train the models.
Outcome: The proposed approach requires no human intervention to re-train the models for improved robustness to question paraphrasing.
CoQAR: Question Rewriting on CoQA (2022.lrec-1)

Copied to clipboard

Challenge: Existing systems that ask questions in a conversational context may have contextual dependencies that make the understanding difficult.
Approach: They propose to rewrite questions into an out-of-context form to facilitate understanding . they propose to use this form to train and evaluate conversational question answering models .
Outcome: The proposed model can be used in the supervised learning of three tasks: question paraphrasing, question rewriting and conversational question answering.
RobustQA: Benchmarking the Robustness of Domain Adaptation for Open-Domain Question Answering (2023.findings-acl)

Copied to clipboard

Challenge: Existing ODQA datasets consist mainly of Wikipedia corpus, and are insufficient to study models’ generalizability across diverse domains.
Approach: They propose a benchmark to evaluate ODQA's domain robustness using Wikipedia corpus . they annotate QA pairs in retrieval datasets with rigorous quality control .
Outcome: The proposed benchmark improves model performance on annotated QA pairs in retrieval datasets with rigorous quality control.
Can You Unpack That? Learning to Rewrite Questions-in-Context (D19-1)

Copied to clipboard

Challenge: Existing QA datasets lack key NLP problems like coreference and ellipsis resolution.
Approach: They propose a task of question-in-context rewriting to rewrite a context-dependent question into a self-contained question with the same answer.
Outcome: The proposed task is based on a dataset of 40,527 questions based in QuAC . it requires models to link questions together to resolve conversational dependencies .
Open-Domain Question Answering Goes Conversational via Question Rewriting (2021.naacl-main)

Copied to clipboard

Challenge: Existing large-scale benchmarks for conversational QA limit the topic of conversation to the content of a single document.
Approach: They propose a dataset for Question Rewriting in Conversational Context (QReCC) the dataset contains 14K conversations with 80K question-answer pairs.
Outcome: The proposed approach shows that the first baseline for the QReCC dataset is 19.10, compared to the human upper bound of 75.45, indicating the difficulty of the setup and a large room for improvement.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations