CoChat

Fast WordPiece Tokenization

Open access
Song, Xinying, Salcianu, Alex, Song, Yang, Dopson, Dave, Zhou, Denny · 2021 · Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing
Cited by 172

The DOI matches its Crossref record; 5 of the 5 references it cites were found in a registry or an index.

Abstract

Tokenization is a fundamental preprocessing step for almost all NLP tasks.In this paper, we propose efficient algorithms for the Word-Piece tokenization used in BERT, from singleword tokenization to general text (e.g., sentence) tokenization.When tokenizing a single word, WordPiece uses a longest-matchfirst strategy, known as maximum matching.The best known algorithms so far are ( 2 ) (where is the input length) or ( ) (where is the maximum vocabulary token length).We propose a novel algorithm whose tokenization complexity is strictly ( ).Our method is inspired by the Aho-Corasick algorithm.We introduce additional linkages on top of the trie built from the vocabulary, allowing smart transitions when the trie matching cannot continue.For general text, we further propose an algorithm that combines pre-tokenization (splitting the text into words) and our linear-time Word-Piece method into a single pass.Experimental results show that our method is 8.2x faster than HuggingFace Tokenizers and 5.1x faster than TensorFlow Text on average for general text tokenization.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.18653/v1/2021.emnlp-main.160

Cites

5 of 5 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 5 references

Cited by

See all 172

Metadata

Authors
Song, X., Salcianu, A., Song, Y., Dopson, D., & Zhou, D.
Venue
Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing
Published
2021
Pages
2089-2103
OpenAlex
W3204880395
Cited by
172
References
5
FWCI
9.63
Type
conference paper
Language
en
Open access
hybrid

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Fast WordPiece Tokenization. https://app.cochat.ai/papers/10.18653/v1/2021.emnlp-main.160
The paper
Song, X., Salcianu, A., Song, Y., Dopson, D., & Zhou, D. (2021). Fast WordPiece Tokenization. Proceedings of the 2021 Conference on Empirical Methods in Natural Language Processing. https://doi.org/10.18653/v1/2021.emnlp-main.160

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.