가이드 연계 퀴즈 · 중간 레벨
바이트 쌍 인코딩 퀴즈
BPE 병합, 시작 기호, 바이트 범위, 압축 원본, 순위 인코딩, 희귀 단어 조각, 어휘 산술 및 UTF-8 디코딩을 검토합니다.
질문 1 의 8
Which adjacent-symbol operation is repeated in common BPE vocabulary training?
모든 질문 미리보기8 질문
퀴즈를 풀면 정답과 설명이 나타납니다.
- 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
- BPE는 훈련을 시작할 때 텍스트를 어떻게 처리합니까?
- 전체 문장
- 고정 8개 토큰 블록
- 개별 문자 또는 바이트
- 사전 번역된 문구
- 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
- NLP가 BPE 알고리즘을 채택하기 전에 원래 BPE 알고리즘은 어디에서 왔습니까?
- 이미지 압축
- 오디오 인코딩
- 데이터베이스 인덱싱
- 데이터 압축
- 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