Unverified70% confidenceFactExact time
The underlying implementation of constrained decoding relies on finite state machines (FSM) or context-free grammars (CFG).
2
Sources
70%
Confidence
Long-term
Relevance
7/15/2026
First Seen
Sources
Related Claims
UnverifiedStructured output applies constraints to the model's token sampling via constrained decoding, typically based on finite-state automata (FSA) or context-free grammars (CFG).79% similarUnverifiedConstrained decoding relies on finite state machines (FSM) or pushdown automata to express the complete set of valid outputs, pre-compiling the schema into a state transition graph.77% similarUnverifiedOutlines pre-compiles constraints into an FSM before inference, and offline-maps the tokenizer's complete vocabulary to each FSM state to generate an index table of valid token sets per state.72% similarUnverifiedCFG 约束可以描述括号匹配、嵌套结构等编程语言语法，但相比正则约束其编译和推理成本会有所上升70% similarUnverifiedOutlines pre-compiles constraints into an FSM before inference and performs an offline mapping between the tokenizer vocabulary and each state of the FSM; during inference, hard constraints are enforced by setting the logits of illegal tokens to negative infinity (logits masking).68% similar
Cite This Claim
Stable URI
https://kongchang.com/claim/520744API
curl https://kongchang.com/api/v1/knowledge/claims/520744MCP
get_claim(id=520744)