Fr. 109.00

Pretrained Transformers for Text Ranking - BERT and Beyond

Anglais · Livre de poche

Expédition généralement dans un délai de 1 à 2 semaines (titre imprimé sur commande)

Description

En savoir plus

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 many natural language processing (NLP) applications.This book provides an overview of text ranking with neural network architectures known as transformers, of which BERT (Bidirectional Encoder Representations from Transformers) is the best-known example. The combination of transformers and self-supervised pretraining has been responsible for a paradigm shift in NLP, information retrieval (IR), and beyond. This book provides a synthesis of existing work as a single point of entry for practitioners who wish to gain a better understanding of how to apply transformers to text ranking problems and researchers who wish to pursue work in this area. It covers a wide range of modern techniques, grouped into two high-level categories: transformer models that perform reranking inmulti-stage architectures and dense retrieval techniques that perform ranking directly. Two themes pervade the book: techniques for handling long documents, beyond typical sentence-by-sentence processing in NLP, and techniques for addressing the tradeoff between effectiveness (i.e., result quality) and efficiency (e.g., query latency, model and index size). Although transformer architectures and pretraining techniques are recent innovations, many aspects of how they are applied to text ranking are relatively well understood and represent mature techniques. However, there remain many open research questions, and thus in addition to laying out the foundations of pretrained transformers for text ranking, this book also attempts to prognosticate where the field is heading.

Table des matières

Preface.- Acknowledgments.- Introduction.- Setting the Stage.- Multi-Stage Architectures for Reranking.- Refining Query and Document Representations.- Learned Dense Representations for Ranking.- Future Directions and Conclusions.- Bibliography.- Authors' Biographies.

A propos de l'auteur










Jimmy Lin holds the David R. Cheriton Chair in the David R. Cheriton School of Computer Science at the University of Waterloo. Prior to 2015, he was a faculty at the University of Maryland, College Park. Lin received his Ph.D. in Electrical Engineering and Computer Science from the Massachusetts Institute of Technology in 2004.Rodrigo Nogueira is a post-doctoral researcher at the University of Waterloo, an adjunct professor at the University of Campinas (UNICAMP), and a senior research scientist at NeuralMind, a startup focused on applying deep learning to document and image analysis. Nogueira received his Ph.D. in Computer Science from the New York University in 2019.Andrew Yates is an assistant professor in the Informatics Institute at the University of Amsterdam. Prior to 2021, he was a post-doctoral researcher and then senior researcher at the Max Planck Institute for Informatics. Yates received his Ph.D. in Computer Science from Georgetown University in 2016.

Détails du produit

Auteurs Jimmy Lin, Rodrigo Nogueira, Andrew Yates
Edition Springer, Berlin
 
Titre original Pretrained Transformers for Text Ranking
Langues Anglais
Format d'édition Livre de poche
Sortie 01.01.2021
 
EAN 9783031010538
ISBN 978-3-0-3101053-8
Pages 307
Dimensions 191 mm x 17 mm x 235 mm
Illustrations XVII, 307 p.
Thème Synthesis Lectures on Human Language Technologies
Catégorie Sciences naturelles, médecine, informatique, technique > Informatique, ordinateurs > Informatique

Commentaires des clients

Aucune analyse n'a été rédigée sur cet article pour le moment. Sois le premier à donner ton avis et aide les autres utilisateurs à prendre leur décision d'achat.

Écris un commentaire

Super ou nul ? Donne ton propre avis.

Pour les messages à CeDe.ch, veuillez utiliser le formulaire de contact.

Il faut impérativement remplir les champs de saisie marqués d'une *.

En soumettant ce formulaire, tu acceptes notre déclaration de protection des données.