Start Free Trial
Advertisement
  1. SEJ
  2.  » 
  3. News

Google’s SMITH Algorithm Outperforms BERT

Google’s new SMITH algorithm understands long-form content better than BERT

Google’s SMITH Algorithm Outperforms BERT

Google recently published a research paper on a new algorithm called SMITH that it claims outperforms BERT for understanding long queries and long documents. In particular, what makes this new model better is that it is able to understand passages within documents in the same way BERT understands words and sentences, which enables the algorithm to understand longer documents.

On November 3, 2020 I read about a Google algorithm called Smith that claims to outperform BERT. I briefly discussed it on November 25th in Episode 395 of the SEO 101 podcast in late November.

I’ve been waiting until I had some time to write a summary of it because SMITH seems to be an important algorithm and deserved a thoughtful write up, which I humbly attempted.

So here it is, I hope you enjoy it and if you do please share this article.

Is Google Using the SMITH Algorithm?

Google does not generally say what specific algorithms it is using. Although the researchers say that this algorithm outperforms BERT, until Google formally states that the SMITH algorithm is in use to understand passages within web pages, it is purely speculative to say whether or not it is in use.

Advertisement
Continue Reading Below

What is the SMITH Algorithm?

SMITH is a new model for trying to understand entire documents. Models such as BERT are trained to understand words within the context of sentences.

In a very simplified description, the SMITH model is trained to understand passages within the context of the entire document.

While algorithms like BERT are trained on data sets to predict randomly hidden words are from the context within sentences, the SMITH algorithm is trained to predict what the next block of sentences are.

This kind of training helps the algorithm understand larger documents better than the BERT algorithm, according to the researchers.

BERT Algorithm Has Limitations

This is how they present the shortcomings of BERT:

“In recent years, self-attention based models like Transformers… and BERT …have achieved state-of-the-art performance in the task of text matching. These models, however, are still limited to short text like a few sentences or one paragraph due to the quadratic computational complexity of self-attention with respect to input text length.

In this paper, we address the issue by proposing the Siamese Multi-depth Transformer-based Hierarchical (SMITH) Encoder for long-form document matching. Our model contains several innovations to adapt self-attention models for longer text input.”

Advertisement
Continue Reading Below

According to the researchers, the BERT algorithm is limited to understanding short documents. For a variety of reasons explained in the research paper, BERT is not well suited for understanding long-form documents.

The researchers propose their new algorithm which they say outperforms BERT with longer documents.

They then explain why long documents are difficult:

“…semantic matching between long texts is a more challenging task due to a few reasons:

1) When both texts are long, matching them requires a more thorough understanding of semantic relations including matching pattern between text fragments with long distance;

2) Long documents contain internal structure like sections, passages and sentences. For human readers, document structure usually plays a key role for content understanding. Similarly, a model also needs to take document structure information into account for better document matching performance;

3) The processing of long texts is more likely to trigger practical issues like out of TPU/GPU memories without careful model design.”

Larger Input Text

BERT is limited to how long documents can be. SMITH, as you will see further down, performs better the longer the document is.

This is a known shortcoming with BERT.

This is how they explain it:

“Experimental results on several benchmark data for long-form text matching… show that our proposed SMITH model outperforms the previous state-of-the-art models and increases the maximum input text length from 512 to 2048 when comparing with BERT based baselines.”

This fact of SMITH being able to do something that BERT is unable to do is what makes the SMITH model intriguing.

The SMITH model doesn’t replace BERT.

The SMITH model supplements BERT by doing the heavy lifting that BERT is unable to do.

The researchers tested it and said:

“Our experimental results on several benchmark datasets for long-form document matching show that our proposed SMITH model outperforms the previous state-of-the-art models including hierarchical attention…, multi-depth attention-based hierarchical recurrent neural network…, and BERT.

Comparing to BERT based baselines, our model is able to increase maximum input text length from 512 to 2048.”

Long to Long Matching

If I am understanding the research paper correctly, the research paper states that the problem of matching long queries to long content has not been been adequately explored.

Advertisement
Continue Reading Below

According to the researchers:

“To the best of our knowledge, semantic matching between long document pairs, which has many important applications like news recommendation, related article recommendation and document clustering, is less explored and needs more research effort.”

Later in the document they state that there have been some studies that come close to what they are researching.

But overall there appears to be a gap in researching ways to match long queries to long documents. That is the problem the researchers are solving with the SMITH algorithm.

Details of Google’s SMITH

I won’t go deep into the details of the algorithm but I will pick out some general features that communicate a high level view of what it is.

The document explains that they use a pre-training model that is similar to BERT and many other algorithms.

First a little background information so the document makes more sense.

Algorithm Pre-training

Pre-training is where an algorithm is trained on a data set. For typical pre-training of these kinds of algorithms, the engineers will mask (hide) random words within sentences. The algorithm tries to predict the masked words.

Advertisement
Continue Reading Below

As an example, if a sentence is written as, “Old McDonald had a ____,” the algorithm when fully trained might predict, “farm” is the missing word.

As the algorithm learns, it eventually becomes optimized to make less mistakes on the training data.

The pre-training is done for the purpose of training the machine to be accurate and make less mistakes.

Here’s what the paper says:

“Inspired by the recent success of language model pre-training methods like BERT, SMITH also adopts the “unsupervised pre-training + fine-tuning” paradigm for the model training.

For the Smith model pre-training, we propose the masked sentence block language modeling task in addition to the original masked word language modeling task used in BERT for long text inputs.”

Blocks of Sentences are Hidden in Pre-training

Here is where the researchers explain a key part of the algorithm, how relations between sentence blocks in a document are used for understanding what a document is about during the pre-training process.

Advertisement
Continue Reading Below

“When the input text becomes long, both relations between words in a sentence block and relations between sentence blocks within a document becomes important for content understanding.

Therefore, we mask both randomly selected words and sentence blocks during model pre-training.”

The researchers next describe in more detail how this algorithm goes above and beyond the BERT algorithm.

What they’re doing is stepping up the training to go beyond word training to take on blocks of sentences.

Here’s how it is described in the research document:

“In addition to the masked word prediction task in BERT, we propose the masked sentence block prediction task to learn the relations between different sentence blocks.”

The SMITH algorithm is trained to predict blocks of sentences. My personal feeling about that is… that’s pretty cool.

This algorithm is learning the relationships between words and then leveling up to learn the context of blocks of sentences and how they relate to each other in a long document.

Advertisement
Continue Reading Below

Section 4.2.2, titled, “Masked Sentence Block Prediction” provides more details on the process (research paper linked below).

Results of SMITH Testing

The researchers noted that SMITH does better with longer text documents.

“The SMITH model which enjoys longer input text lengths compared with other standard self-attention models is a better choice for long document representation learning and matching.”

In the end, the researchers concluded that the SMITH algorithm does better than BERT for long documents.

Why SMITH Research Paper is Important

One of the reasons I prefer reading research papers over patents is that the research papers share details of whether the proposed model does better than existing and state of the art models.

Many research papers conclude by saying that more work needs to be done. To me that means that the algorithm experiment is promising but likely not ready to be put into a live environment.

A smaller percentage of research papers say that the results outperform the state of the art. These are the research papers that in my opinion are worth paying attention to because they are likelier to make it into Google’s algorithm.

Advertisement
Continue Reading Below

When I say likelier, I don’t mean that the algorithm is or will be in Google’s algorithm.

What I mean is that, relative to other algorithm experiments, the research papers that claim to outperform the state of the art are more likely to make it into Google’s algorithm.

SMITH Outperforms BERT for Long Form Documents

According to the conclusions reached in the research paper, the SMITH model outperforms many models, including BERT, for understanding long content.

“The experimental results on several benchmark datasets show that our proposed SMITH model outperforms previous state-of-the-art Siamese matching models including HAN, SMASH and BERT for long-form document matching.

Moreover, our proposed model increases the maximum input text length from 512 to 2048 when compared with BERT-based baseline methods.”

Is SMITH in Use?

As written earlier, until Google explicitly states they are using SMITH there’s no way to accurately say that the SMITH model is in use at Google.

That said, research papers that aren’t likely in use are those that explicitly state that the findings are a first step toward a new kind of algorithm and that more research is necessary.

Advertisement
Continue Reading Below

This is not the case with this research paper. The research paper authors confidently state that SMITH beats the state of the art for understanding long-form content.

That confidence in the results and the lack of a statement that more research is needed makes this paper more interesting than others and therefore well worth knowing about in case it gets folded into Google’s algorithm sometime in the future or in the present.

Citation

Read the original research paper:

Description of the SMITH Algorithm

Download the SMITH Algorithm PDF Research Paper:

Beyond 512 Tokens: Siamese Multi-depth Transformer-based Hierarchical Encoder for Long-Form Document Matching (PDF)

CategoryNewsSEO
ADVERTISEMENT

Subscribe to SEJ

Get our daily newsletter from SEJ's Founder Loren Baker about the latest news in the industry!

Topic(s) of Interest*
Ebook

Roger Montti

Owner at Martinibuster.com

Roger Montti is a search marketer with 20 years experience. He provides site audits, phone consultations and content and link ... [Read full bio]

ADVERTISEMENT
Advertisement
Read the Next Article
Read the Next