REVIEW 3 cited by
Learning to Paraphrase for Question Answering
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
Signed reviews
read the original abstract
Question answering (QA) systems are sensitive to the many different ways natural language expresses the same information need. In this paper we turn to paraphrases as a means of capturing this knowledge and present a general framework which learns felicitous paraphrases for various QA tasks. Our method is trained end-to-end using question-answer pairs as a supervision signal. A question and its paraphrases serve as input to a neural scoring model which assigns higher weights to linguistic expressions most likely to yield correct answers. We evaluate our approach on QA over Freebase and answer sentence selection. Experimental results on three datasets show that our framework consistently improves performance, achieving competitive results despite the use of simple QA models.
Forward citations
Cited by 3 Pith papers
-
An Empirical Comparison on Imitation Learning and Reinforcement Learning for Paraphrase Generation
DAgger-style imitation learning outperforms REINFORCE reinforcement learning for paraphrase generation with a pointer-generator, and the best model reaches state-of-the-art scores on Quora.
-
Generative Question Refinement with Deep Reinforcement Learning in Retrieval-based QA System
QREFINE, a BERT- and character-aware Seq2Seq model trained with PPO and answer-aware rewards, generates cleaned questions that improve answer retrieval over previous refinement methods.
-
Explainable Knowledge Graph Retrieval-Augmented Generation (KG-RAG) with KG-SMILE
KG-SMILE applies perturbation and linear regression to a knowledge graph to attribute which entities and relations drive a GraphRAG system's answers.
Discussion (0). Continue with ORCID to comment.