Machine Reading Comprehension using Case-based Reasoning
Fuente:
arXiv
Saved in:
| Main Authors: | , , , , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2023
|
| Subjects: | |
| Online Access: | |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866909924949229568 |
|---|---|
| author | Thai, Dung Agarwal, Dhruv Chaudhary, Mudit Zhao, Wenlong Das, Rajarshi Zaheer, Manzil Lee, Jay-Yoon Hajishirzi, Hannaneh McCallum, Andrew |
| author_facet | Thai, Dung Agarwal, Dhruv Chaudhary, Mudit Zhao, Wenlong Das, Rajarshi Zaheer, Manzil Lee, Jay-Yoon Hajishirzi, Hannaneh McCallum, Andrew |
| contents | We present an accurate and interpretable method for answer extraction in machine reading comprehension that is reminiscent of case-based reasoning (CBR) from classical AI. Our method (CBR-MRC) builds upon the hypothesis that contextualized answers to similar questions share semantic similarities with each other. Given a test question, CBR-MRC first retrieves a set of similar cases from a nonparametric memory and then predicts an answer by selecting the span in the test context that is most similar to the contextualized representations of answers in the retrieved cases. The semi-parametric nature of our approach allows it to attribute a prediction to the specific set of evidence cases, making it a desirable choice for building reliable and debuggable QA systems. We show that CBR-MRC provides high accuracy comparable with large reader models and outperforms baselines by 11.5 and 8.4 EM on NaturalQuestions and NewsQA, respectively. Further, we demonstrate the ability of CBR-MRC in identifying not just the correct answer tokens but also the span with the most relevant supporting evidence. Lastly, we observe that contexts for certain question types show higher lexical diversity than others and find that CBR-MRC is robust to these variations while performance using fully-parametric methods drops. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2305_14815 |
| institution | arXiv |
| publishDate | 2023 |
| record_format | arxiv |
| spellingShingle | Machine Reading Comprehension using Case-based Reasoning Thai, Dung Agarwal, Dhruv Chaudhary, Mudit Zhao, Wenlong Das, Rajarshi Zaheer, Manzil Lee, Jay-Yoon Hajishirzi, Hannaneh McCallum, Andrew Computation and Language Information Retrieval We present an accurate and interpretable method for answer extraction in machine reading comprehension that is reminiscent of case-based reasoning (CBR) from classical AI. Our method (CBR-MRC) builds upon the hypothesis that contextualized answers to similar questions share semantic similarities with each other. Given a test question, CBR-MRC first retrieves a set of similar cases from a nonparametric memory and then predicts an answer by selecting the span in the test context that is most similar to the contextualized representations of answers in the retrieved cases. The semi-parametric nature of our approach allows it to attribute a prediction to the specific set of evidence cases, making it a desirable choice for building reliable and debuggable QA systems. We show that CBR-MRC provides high accuracy comparable with large reader models and outperforms baselines by 11.5 and 8.4 EM on NaturalQuestions and NewsQA, respectively. Further, we demonstrate the ability of CBR-MRC in identifying not just the correct answer tokens but also the span with the most relevant supporting evidence. Lastly, we observe that contexts for certain question types show higher lexical diversity than others and find that CBR-MRC is robust to these variations while performance using fully-parametric methods drops. |
| title | Machine Reading Comprehension using Case-based Reasoning |
| topic | Computation and Language Information Retrieval |
| url | https://arxiv.org/abs/2305.14815 |