2000 character limit reached
Deep Relevance Ranking Using Enhanced Document-Query Interactions (1809.01682v2)
Published 5 Sep 2018 in cs.IR and cs.CL
Abstract: We explore several new models for document relevance ranking, building upon the Deep Relevance Matching Model (DRMM) of Guo et al. (2016). Unlike DRMM, which uses context-insensitive encodings of terms and query-document term interactions, we inject rich context-sensitive encodings throughout our models, inspired by PACRR's (Hui et al., 2017) convolutional n-gram matching features, but extended in several ways including multiple views of query and document inputs. We test our models on datasets from the BIOASQ question answering challenge (Tsatsaronis et al., 2015) and TREC ROBUST 2004 (Voorhees, 2005), showing they outperform BM25-based baselines, DRMM, and PACRR.
- Ryan McDonald (24 papers)
- Georgios-Ioannis Brokos (3 papers)
- Ion Androutsopoulos (51 papers)