Exploiting Abstract Meaning Representation for Open-Domain Question Answering
Abstract
The Open-Domain Question Answering (ODQA) task involves retrieving and subsequently generating answers from fine-grained relevant passages within a database. Current systems leverage Pretrained Language Models (PLMs) to model the relationship between questions and passages. However, the diversity in surface form expressions can hinder the model's ability to capture accurate correlations, especially within complex contexts. Therefore, we utilize Abstract Meaning Representation (AMR) graphs to assist the model in understanding complex semantic information. We introduce a method known as Graph-as-Token (GST) to incorporate AMRs into PLMs. Results from Natural Questions (NQ) and TriviaQA (TQ) demonstrate that our GST method can significantly improve performance, resulting in up to 2.44/3.17 Exact Match score improvements on NQ/TQ respectively. Furthermore, our method enhances robustness and outperforms alternative Graph Neural Network (GNN) methods for integrating AMRs. To the best of our knowledge, we are the first to employ semantic graphs in ODQA.
Cite
@article{arxiv.2305.17050,
title = {Exploiting Abstract Meaning Representation for Open-Domain Question Answering},
author = {Cunxiang Wang and Zhikun Xu and Qipeng Guo and Xiangkun Hu and Xuefeng Bai and Zheng Zhang and Yue Zhang},
journal= {arXiv preprint arXiv:2305.17050},
year = {2023}
}
Comments
Accepted by ACL2023 findings, reviewer scores: 4 4 4