BPE is a tokenization algorithm that starts with individual characters and iteratively merges the most frequent token pairs until a desired vocabulary size is reached. It balances word-level tokenization (huge vocabularies, no unknown words) and character-level (very long sequences). BPE is used by GPT, Llama, and most modern language models, handling English, French, Arabic, and code within a unified vocabulary.