ガイド連動クイズ · 中 レベル

制約と文法に基づいた生成クイズ

正式なデコード ルールとパーサーの状態を確認し、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