paper-with-me

홈 › Papers

Transformer Based Language Models for Similar Text Retrieval and Ranking

2020-05-10 · Javed Qadrud-Din, Ashraf Bah Rabiou, Ryan Walker, Ravi Soni, Martin Gajek, Gabriel Pack, Akhil Rangaraj

Most approaches for similar text retrieval and ranking with long natural language queries rely at some level on queries and responses having words in common with each other. Recent applications of transformer-based neural language models to text retrieval and ranking problems have been very promising, but still involve a two-step process in which result candidates are first obtained through bag-of-words-based approaches, and then reranked by a neural transformer. In this paper, we introduce novel approaches for effectively applying neural transformer models to similar text retrieval and ranking without an initial bag-of-words-based step. By eliminating the bag-of-words-based step, our approach is able to accurately retrieve and rank results even when they have no non-stopwords in common with the query. We accomplish this by using bidirectional encoder representations from transformers (BERT) to create vectorized representations of sentence-length texts, along with a vector nearest neighbor search index. We demonstrate both supervised and unsupervised means of using BERT to accomplish this task.

📄 PDF Abstract BibTeX arXiv:2005.04588

Code (0)

등록된 구현이 없습니다.

Tasks

Natural Language QueriesRetrievalSentenceText Retrieval

Methods 이 논문이 사용한 방법론

Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
Absolute Position Encodings Absolute Position Encodings are a type of position embeddings for [Transformer-based models] where positional encodings are…
Position-Wise Feed-Forward Layer 설명 없음
Residual Connection 설명 없음
Attention Dropout Attention Dropout is a type of dropout used in attention-based architectures, where elements are randomly dropped out of the…
Linear Warmup With Linear Decay Linear Warmup With Linear Decay is a learning rate schedule in which we increase the learning rate linearly for $n$ updates and then linearly decay afterwards.
Weight Decay 설명 없음
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…

Similar Papers 제목 키워드 기반

HLATR: Enhance Multi-stage Text Retrieval with Hybrid List Aware Transformer Reranking

2022-05-21 · Yanzhao Zhang, Dingkun Long, Guangwei Xu, Pengjun Xie

Deep pre-trained language models (e,g. BERT) are effective at large-scale text retrieval task. Existing text retrieval systems with state-of-the-art performance usually adopt a retrieve-then-reranking architecture due to…

Passage RankingPassage Re-RankingRerankingRetrieval+1

Contextual Similarity Aggregation with Self-attention for Visual Re-ranking

2021-10-26 · NeurIPS 2021 12 · Jianbo Ouyang, Hui Wu, Min Wang, Wengang Zhou 외

In content-based image retrieval, the first-round retrieval result by simple visual feature comparison may be unsatisfactory, which can be refined by visual re-ranking techniques. In image retrieval, it is observed that …

Content-Based Image RetrievalData AugmentationImage RetrievalRe-Ranking+1

Pretrained Transformers for Text Ranking: BERT and Beyond

2020-10-13 · NAACL 2021 4 · Jimmy Lin, Rodrigo Nogueira, Andrew Yates

The goal of text ranking is to generate an ordered list of texts retrieved from a corpus in response to a query. Although the most common formulation of text ranking is search, instances of the task can also be found in …

Information RetrievalRerankingRetrievalSentence+1

Text Retrieval with Multi-Stage Re-Ranking Models

2023-11-14 · Yuichi Sasazawa, Kenichi Yokote, Osamu Imaichi, Yasuhiro Sogawa

The text retrieval is the task of retrieving similar documents to a search query, and it is important to improve retrieval accuracy while maintaining a certain level of retrieval speed. Existing studies have reported acc…

Language ModelingLanguage ModellingRe-RankingRetrieval+1

Brown University at TREC Deep Learning 2019

2020-09-08 · George Zerveas, Ruochen Zhang, Leila Kim, Carsten Eickhoff

This paper describes Brown University's submission to the TREC 2019 Deep Learning track. We followed a 2-phase method for producing a ranking of passages for a given input query: In the the first phase, the user's query …

Deep LearningInformation RetrievalLanguage ModelingLanguage Modelling+3