Tag
This paper introduces the trie automaton, a specialized constrained decoding mechanism for finite sets that precomputes token masks via Aho-Corasick matching, achieving up to 29x end-to-end throughput improvements over XGrammar in vLLM batch serving while guaranteeing 100% output validity.