Learning To Match Using Local And Distributed Representations Of Text For Web Search

Abstract

Models such as latent semantic analysis and those based on neural embeddings learn distributed representations of text, and match the query against the document in the latent semantic space. In traditional information retrieval models, on the other hand, terms have discrete or local representations, and the relevance of a document is determined by the exact matches of query terms in the body text. We hypothesize that matching with distributed representations complements matching with traditional local representations, and that a combination of the two is favorable. We propose a novel document ranking model composed of two separate deep neural networks, one that matches the query and the document using a local representation, and another that matches the query and the document using learned distributed representations. The two networks are jointly trained as part of a single neural network. We show that this combination or `duet' performs significantly better than either neural network

Stats

• citations257
• S2 citations—
• github stars0
• HF likes0
• heat score18.09
• arxiv keymitra2016learning

Related papers

• Neural Ranking Models For Document Retrieval (2021)11.08
• Neural Ranking Models With Multiple Document Fields (2017)12.74
• A Dense Representation Framework For Lexical And Semantic Matching (2022)11.13
• Embedding Meta-textual Information For Improved Learning To Rank (2020)3.58
• Utilizing Embeddings For Ad-hoc Retrieval By Document-to-document Similarity (2017)0.00
• MRNN: A Multi-resolution Neural Network With Duplex Attention For Document Retrieval In The Context Of Question Answering (2019)0.00
• Incorporating Query Term Independence Assumption For Efficient Retrieval And Ranking Using Deep Neural Networks (2019)0.00
• Vector Representations Of Text Data In Deep Learning (2019)0.00