2000 character limit reached
A Study of BERT for Non-Factoid Question-Answering under Passage Length Constraints
Published 19 Aug 2019 in cs.IR and cs.CL | (1908.06780v1)
Abstract: We study the use of BERT for non-factoid question-answering, focusing on the passage re-ranking task under varying passage lengths. To this end, we explore the fine-tuning of BERT in different learning-to-rank setups, comprising both point-wise and pair-wise methods, resulting in substantial improvements over the state-of-the-art. We then analyze the effectiveness of BERT for different passage lengths and suggest how to cope with large passages.
Paper Prompts
Sign up for free to create and run prompts on this paper.