Incorporating Query Term Independence Assumption For Efficient Retrieval And Ranking Using Deep Neural Networks

Abstract

Classical information retrieval (IR) methods, such as query likelihood and BM25, score documents independently w.r.t. each query term, and then accumulate the scores. Assuming query term independence allows precomputing term-document scores using these models---which can be combined with specialized data structures, such as inverted index, for efficient retrieval. Deep neural IR models, in contrast, compare the whole query to the document and are, therefore, typically employed only for late stage re-ranking. We incorporate query term independence assumption into three state-of-the-art neural IR models: BERT, Duet, and CKNRM---and evaluate their performance on a passage ranking task. Surprisingly, we observe no significant loss in result quality for Duet and CKNRM---and a small degradation in the case of BERT. However, by operating on each query term independently, these otherwise computationally intensive models become amenable to offline precomputation---dramatically reducing the cost

Stats

• citations0
• S2 citations—
• github stars0
• HF likes0
• heat score0.00
• arxiv keymitra2019incorporating

Related papers

• Neural Models For Information Retrieval (2017)0.00
• A Deep Look Into Neural Ranking Models For Information Retrieval (2019)17.73
• Improving Neural Ranking Models With Traditional IR Methods (2023)0.00
• Neural Ranking Models For Document Retrieval (2021)11.08
• SEINE: Segment-based Indexing For Neural Information Retrieval (2023)0.00
• Deeptilebars: Visualizing Term Distribution For Neural Information Retrieval (2018)6.34
• Neural Information Retrieval: A Literature Review (2016)0.00
• On The Effect Of Low-frequency Terms On Neural-ir Models (2019)9.76