1. Learning to Combine Answer Boundary Detection and Answer Re‐ranking for Phrase‐Indexed Question Answering
- Author
-
Shi Haibo, Wang Houfeng, Yin Dawei, Wei Xiaochi, Wang Xiaolin, Wang Junfeng, Zhang Xiaodong, Sun Xin, Cheng Zhicong, Luo Yingwei, and Wen Liang
- Subjects
Phrase ,business.industry ,Computer science ,Applied Mathematics ,Inference ,Boundary (topology) ,Machine learning ,computer.software_genre ,Ranking (information retrieval) ,Task (project management) ,Question answering ,Independence (mathematical logic) ,Artificial intelligence ,Electrical and Electronic Engineering ,business ,Encoder ,computer - Abstract
Phrase-indexed question answering (PIQA) seeks to improve the inference speed of question answering (QA) models by enforcing complete independence of the document encoder from the question encoder, and it shows that the constrained model can achieve significant efficiency at the cost of its accuracy. In this paper, we aim to build a model under the PIQA constraint while reducing its accuracy gap with the unconstrained QA models. We propose a novel framework—AnsDR, which consists of an answer boundary detector (AnsD) and an answer candidate ranker (AnsR). More specifically, AnsD is a QA model under the PIQA architecture and it is designed to identify the rough answer boundaries; and AnsR is a lightweight ranking model to finely re-rank the potential candidates without losing the efficiency. We perform the extensive experiments on public datasets. The experimental results show that the proposed method achieves the state of the art on the PIQA task.
- Published
- 2022