NastępnyNastępny poradnik
Tokenizacja i kodowanie par bajtów
Techniczne
PRZEWODNIK Językowy AI
Byte-pair encoding builds larger symbols by repeatedly merging frequent adjacent pairs during training.
Posłuchaj tego przewodnikaOpowiadane przez sztuczną inteligencję · ~3 min
Its learned vocabulary and merge priorities support subword encoding, while byte-level variants use a byte alphabet rather than a character-only base.
BPE was developed for data compression and adapted to word segmentation in the translation research by Sennrich, Haddow, and Birch, published in 2016. In a common subword-training procedure, text is represented through initial symbols such as characters. Adjacent pairs are counted over the training representation, and a frequent pair is merged into a larger symbol. Repeating the procedure learns reusable pieces. More frequent sequences can gain larger units, while an unfamiliar word may remain split into smaller ones. The precise behavior depends on the training data and implementation; not every common word must become one token. Training produces a vocabulary and an ordered collection of merge rules. GPT-2's published encoder applies eligible pairs according to learned ranks rather than recounting the new input to invent a new vocabulary. It first represents UTF-8 bytes through a reversible byte-to-symbol mapping. The byte alphabet covers 256 values, permitting valid UTF-8 input to be represented through its constituent bytes when larger merged pieces are unavailable. This avoids the character-alphabet coverage limitation under that configuration, but encoding success does not establish that the model knows the text's meaning. Vocabulary accounting can be explicit. In an illustrative configuration with 256 base byte tokens, two distinct additional merge tokens, and one separate special token, the total is 259. Decoding has another important order: GPT-2's implementation joins decoded token pieces, reconstructs the complete byte sequence, then decodes that sequence as UTF-8. Individual pieces need not each correspond to an independently complete Unicode character.
Studying the BPE word-segmentation method in Sennrich and colleagues' translation research.
Inspecting GPT-2's published byte mapping and ranked merge implementation.
Calculating vocabulary size for a stated base, unique merges, and special-token allocation.
Reconstructing a byte sequence before decoding its UTF-8 text.
BPE configurations can be compared through sequence lengths, coverage, and effects on a trained model rather than assumed to be optimal for every language or input type. Changes to the byte alphabet, preprocessing, vocabulary, or merge rules alter the actual encoding. A reproducible comparison should preserve those details and identify any normalization applied before tokenization. Other segmentation methods offer different design choices, while byte-level coverage remains distinct from semantic understanding. Inspecting the learned pieces and reconstruction process is useful for diagnosing representational behavior without attributing every model failure to BPE alone.
Darmowy newsletter
Trzy zweryfikowane historie AI każdego poranka w dni robocze, napisane prostym angielskim. Bezpłatne na zawsze, bez reklam.
Jedno e‑mail każdego dnia roboczego. Wypisz się jednym kliknięciem. Nigdy nie sprzedajemy ani nie udostępniamy Twojego adresu.
Sprawdź się
Natychmiastowa informacja zwrotna na każde pytanie oraz udostępnialny certyfikat z weryfikowalnym ID po zaliczeniu kursu.
Wspieraj darmową edukację AI. AI Understanding jest organizacją non-profit 501(c)(3) — bez reklam, bez płatnej ściany, zawsze. Przekaż darowiznę
Byte-pair encoding builds larger symbols by repeatedly merging frequent adjacent pairs during training. Its learned vocabulary and merge priorities support subword encoding, while byte-level variants use a byte alphabet rather than a character-only base.
The training procedure counts adjacent symbol pairs and learns merges; encoding later uses the saved rules.
BPE zaczyna od najmniejszych jednostek (znaków lub nieprzetworzonych bajtów) i powiększa większe tokeny poprzez fuzje.
The complete byte alphabet supplies the stated fallback; this does not apply to every character-only subword vocabulary.
BPE wprowadzono jako technikę kompresji danych w 1994 r., a później zaadaptowano do tokenizacji podsłów w 2016 r.
Its implementation selects eligible pairs through saved BPE ranks rather than re-learning corpus frequencies at encoding time.
Ucz się dalej
Wybrano więcej przewodników na ten temat
NastępnyNastępny poradnik
Tokenizacja i kodowanie par bajtów
Techniczne