Search icon CANCEL
Arrow left icon
Explore Products
Best Sellers
New Releases
Books
Videos
Audiobooks
Learning Hub
Conferences
Free Learning
Arrow right icon
Arrow up icon
GO TO TOP
Getting Started with Google BERT

You're reading from   Getting Started with Google BERT Build and train state-of-the-art natural language processing models using BERT

Arrow left icon
Product type Paperback
Published in Jan 2021
Publisher Packt
ISBN-13 9781838821593
Length 352 pages
Edition 1st Edition
Languages
Tools
Arrow right icon
Author (1):
Arrow left icon
Sudharsan Ravichandiran Sudharsan Ravichandiran
Author Profile Icon Sudharsan Ravichandiran
Sudharsan Ravichandiran
Arrow right icon
View More author details
Toc

Table of Contents (15) Chapters Close

Preface 1. Section 1 - Starting Off with BERT
2. A Primer on Transformers FREE CHAPTER 3. Understanding the BERT Model 4. Getting Hands-On with BERT 5. Section 2 - Exploring BERT Variants
6. BERT Variants I - ALBERT, RoBERTa, ELECTRA, and SpanBERT 7. BERT Variants II - Based on Knowledge Distillation 8. Section 3 - Applications of BERT
9. Exploring BERTSUM for Text Summarization 10. Applying BERT to Other Languages 11. Exploring Sentence and Domain-Specific BERT 12. Working with VideoBERT, BART, and More 13. Assessments 14. Other Books You May Enjoy

Chapter 3, Getting Hands-On with BERT

  1. We can use the pre-trained model in the following two ways:
  • As a feature extractor by extracting embeddings
  • By fine-tuning the pre-trained BERT model on downstream tasks such as text classification, question-answering, and more
  1. The [PAD] token is used to match the token length.
  2. To make our model understand that the [PAD] token is added only to match the tokens length and that it is not part of the actual tokens, we use an attention mask. We set the attention mask value to 1 in all positions and 0 for the position where we have the [PAD] token.
  3. Fine-tuning implies that we are not training BERT from scratch; instead, we are using the already-trained BERT and updating its weights according to our task.
  4. For each token , we compute the dot product between the representation of the token and the start vector . Next, we apply the softmax function to the dot product and obtain the probability: . Next, we compute the starting index by selecting...
lock icon The rest of the chapter is locked
Register for a free Packt account to unlock a world of extra content!
A free Packt account unlocks extra newsletters, articles, discounted offers, and much more. Start advancing your knowledge today.
Unlock this book and the full library FREE for 7 days
Get unlimited access to 7000+ expert-authored eBooks and videos courses covering every tech area you can think of
Renews at €18.99/month. Cancel anytime