Unsupervised Open-Domain Question Answering with Higher Answerability
Open-domain Question Answering (ODQA) has achieved significant results in terms of supervised learning manner. However, data annotation cannot also be irresistible for its huge demand in an open domain. Though unsupervised QA or unsupervised Machine Reading Comprehension (MRC) has been tried more or less, unsupervised ODQA has not been touched according to our best knowledge. This paper thus pioneers the work of unsupervised ODQA by formally introducing the task and proposing a series of key data construction methods. Our exploration in this work inspiringly shows unsupervised ODQA can reach up to 86% performance of supervised ones.
Code (0)
등록된 구현이 없습니다.
Tasks
Machine Reading ComprehensionOpen-Domain Question AnsweringQuestion AnsweringReading ComprehensionSimilar Papers 제목 키워드 기반
Unsupervised Open-Domain Question Answering
Open-domain Question Answering (ODQA) has achieved significant results in terms of supervised learning manner. However, data annotation cannot also be irresistible for its huge demand in an open domain. Though unsupervis…
Machine Reading ComprehensionOpen-Domain Question AnsweringQuestion AnsweringReading ComprehensionMultivalent Entailment Graphs for Question Answering
Drawing inferences between open-domain natural language predicates is a necessity for true language understanding. There has been much progress in unsupervised learning of entailment graphs for this purpose. We make thre…
Question AnsweringCan Open Domain Question Answering Systems Answer Visual Knowledge Questions?
The task of Outside Knowledge Visual Question Answering (OKVQA) requires an automatic system to answer natural language questions about pictures and images using external knowledge. We observe that many visual questions,…
Open-Domain Question AnsweringQuestion AnsweringQuestion RewritingVisual Question Answering+1Answering Any-hop Open-domain Questions with Iterative Document Reranking
Existing approaches for open-domain question answering (QA) are typically designed for questions that require either single-hop or multi-hop reasoning, which make strong assumptions of the complexity of questions to be a…
Multi-hop Question AnsweringNatural QuestionsOpen-Domain Question AnsweringQuestion Answering+2Leveraging Term Banks for Answering Complex Questions: A Case for Sparse Vectors
While open-domain question answering (QA) systems have proven effective for answering simple questions, they struggle with more complex questions. Our goal is to answer more complex questions reliably, without incurring …
Open-Domain Question AnsweringQuestion Answering