Quiz collegato alla guida · Medio Livello
Quiz sulla codifica della coppia di byte
Esamina le unioni BPE, i simboli iniziali, la copertura dei byte, le origini di compressione, la codifica classificata, le parti di parole rare, l'aritmetica del vocabolario e la decodifica UTF-8.
Domanda 1 di 8
Which adjacent-symbol operation is repeated in common BPE vocabulary training?
Anteprima di ogni domanda8 domande
Le risposte e le spiegazioni vengono visualizzate mentre rispondi al quiz.
- Which adjacent-symbol operation is repeated in common BPE vocabulary training?
- Deleting all low-frequency words from the language
- Merging a most-frequent pair into a larger symbol
- Sorting complete documents by title
- Selecting pairs solely by their alphabetical spelling
- In che modo BPE tratta il testo quando inizia la formazione?
- Frasi intere
- Risolti i blocchi da 8 gettoni
- Singoli caratteri o byte
- Frasi pretradotte
- In a byte-level BPE configuration covering all 256 base byte values, how can unfamiliar valid UTF-8 text be represented?
- Through its constituent bytes when larger pieces are unavailable
- By storing every possible complete word in the finite vocabulary
- By requiring the input to be translated into English first
- By assigning every unseen character one shared unknown ID
- Da dove proveniva originariamente l’algoritmo BPE prima che la PNL lo adottasse?
- Compressione delle immagini
- Codifica audio
- Indicizzazione dei database
- Compressione dei dati
- When GPT-2's published BPE encoder finds multiple eligible adjacent pairs, what determines its merge choice?
- A new random vocabulary fit on that one input
- The text file's creation date
- The priorities in the learned merge ranks
- The order of a human-written list of target meanings
- What can happen when an unfamiliar word lacks larger learned BPE pieces?
- It must be replaced by an unrelated synonym
- It remains represented by several smaller available pieces
- It necessarily becomes one new learned token during inference
- It is always silently removed from the input
- An illustrative BPE vocabulary has 256 base byte tokens, two distinct added merge tokens, and one separate special token. What is its total size?
- 256
- 258
- 512
- 259
- In GPT-2's published decoder, what is reconstructed before converting the result from UTF-8 into text?
- The complete byte sequence represented by the token pieces
- An independent Unicode character from every individual token first
- A new corpus-frequency table for training merges
- The model's output-label probabilities