가이드 연계 퀴즈 · 중간 레벨

제한적이고 문법에 기반한 생성 퀴즈

공식적인 디코딩 규칙과 파서 상태를 검토한 다음 JSON 및 마스크 샘플링 예제를 통해 완료 조건과 확률 변화를 평가합니다.

관련 가이드 경로제한된 문법 기반 생성
질문 1 의 8

At which stage does the described hard grammar constraint restrict a language model's continuation choices?

모든 질문 미리보기8 질문

퀴즈를 풀면 정답과 설명이 나타납니다.

  1. At which stage does the described hard grammar constraint restrict a language model's continuation choices?
    • Only while collecting pretraining documents
    • Only after executing every emitted instruction
    • Decoding, before the next token is selected
    • By retraining the model weights after every user request
  2. Which formal rule representations are discussed in the cited grammar-guided generation research?
    • Only image-file color palettes
    • Only a spreadsheet of model parameter counts
    • Only an alphabetical list of document filenames
    • Regular expressions and context-free grammars
  3. Why is a simple finite-state machine not a complete description of every general nested context-free grammar decoder?
    • General nested structure can require stack-like or richer parser state
    • All nested grammars must be regular expressions by definition
    • A grammar can never describe nesting
    • Every parser must discard its current state after each token
  4. 토큰 수준 제약 조건을 구현하는 데 있어 주요 기술적 어려움은 무엇입니까?
    • 모델의 메모리가 즉시 부족해집니다.
    • 토크나이저 경계가 문법 경계와 일치하지 않을 수 있습니다.
    • JSON에는 문법을 작성할 수 없습니다.
    • GPU는 행렬을 곱할 수 없습니다
  5. What structure claim is justified for an output that successfully completes under a correctly implemented supported grammar constraint?
    • Every fact inside it is necessarily true
    • Every possible interruption leaves a complete accepted output
    • Every downstream application rule is automatically covered
    • It satisfies the constraints covered by that grammar
  6. Which named research engine studies flexible and efficient structured generation for language models?
    • A photo-upscaling file format
    • An audio loudness unit
    • XGrammar
    • A required model-weight encryption algorithm
  7. Generation stops after only an opening JSON object brace. What can be concluded about that text?
    • It must already be a complete JSON object
    • It can be a permitted prefix without being a complete valid object
    • The interruption proves no JSON grammar exists
    • Every such prefix is necessarily forbidden from the start
  8. A stated distribution assigns A 0.2, B 0.3, and C 0.5. After C is masked and the remaining choices are renormalized, what is A's probability?
    • 0.4
    • 0.2
    • 0.5
    • 0.6