Word-Entity Duet Representations for Document Ranking
This paper presents a word-entity duet framework for utilizing knowledge bases in ad-hoc retrieval. In this work, the query and documents are modeled by word-based representations and entity-based representations. Ranking features are generated by the interactions between the two representations, incorporating information from the word space, the entity space, and the cross-space connections through the knowledge graph. To handle the uncertainties from the automatically constructed entity representations, an attention-based ranking model AttR-Duet is developed. With back-propagation from ranking labels, the model learns simultaneously how to demote noisy entities and how to rank documents with the word-entity duet. Evaluation results on TREC Web Track ad-hoc task demonstrate that all of the four-way interactions in the duet are useful, the attention mechanism successfully steers the model away from noisy entities, and together they significantly outperform both word-based and entity-based learning to rank systems.
Code (0)
등록된 구현이 없습니다.
Tasks
Document RankingLearning-To-RankRetrievalSimilar Papers 제목 키워드 기반
Entity-Duet Neural Ranking: Understanding the Role of Knowledge Graph Semantics in Neural Information Retrieval
This paper presents the Entity-Duet Neural Ranking Model (EDRM), which introduces knowledge graphs to neural search systems. EDRM represents queries and documents by their words and entity annotations. The semantics from…
Information RetrievalKnowledge GraphsRetrievalLearning to Match Using Local and Distributed Representations of Text for Web Search
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 re…
Document RankingInformation RetrievalRetrievalIncorporating Query Term Independence Assumption for Efficient Retrieval and Ranking using Deep Neural Networks
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 …
Information RetrievalPassage RankingRe-RankingRetrievalDuet at TREC 2019 Deep Learning Track
This report discusses three submissions based on the Duet architecture to the Deep Learning track at TREC 2019. For the document retrieval task, we adapt the Duet model to ingest a "multiple field" view of documents---we…
Deep LearningLearning-To-RankPassage RetrievalRetrievalAn Updated Duet Model for Passage Re-ranking
We propose several small modifications to Duet---a deep neural ranking model---and evaluate the updated model on the MS MARCO passage ranking task. We report significant improvements from the proposed changes based on an…
modelPassage RankingPassage Re-RankingRe-Ranking