DeText: A Deep Text Ranking Framework with BERT

Ranking is the most important component in a search system. Mostsearch systems deal with large amounts of natural language data,hence an effective ranking system requires a deep understandingof text semantics. Recently, deep learning based natural languageprocessing (deep NLP) models have generated...

Full description

Saved in:
Bibliographic Details
Published in:arXiv.org 2020-08
Main Authors: Guo, Weiwei, Liu, Xiaowei, Wang, Sida, Gao, Huiji, Sankar, Ananth, Yang, Zimeng, Guo, Qi, Zhang, Liang, Long, Bo, Bee-Chung, Chen, Agarwal, Deepak
Format: Article
Language:English
Subjects:
Machine learning
On-line systems
Ranking
Searching
Semantics
System effectiveness
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Ranking is the most important component in a search system. Mostsearch systems deal with large amounts of natural language data,hence an effective ranking system requires a deep understandingof text semantics. Recently, deep learning based natural languageprocessing (deep NLP) models have generated promising results onranking systems. BERT is one of the most successful models thatlearn contextual embedding, which has been applied to capturecomplex query-document relations for search ranking. However,this is generally done by exhaustively interacting each query wordwith each document word, which is inefficient for online servingin search product systems. In this paper, we investigate how tobuild an efficient BERT-based ranking model for industry use cases.The solution is further extended to a general ranking framework,DeText, that is open sourced and can be applied to various rankingproductions. Offline and online experiments of DeText on threereal-world search systems present significant improvement overstate-of-the-art approaches.
ISSN:2331-8422