3 ms·
This may be possible as constraints using constrained beam search, which huggingface has quietly supported for a long time.
by Der_Einzige 4y ago
This may be possible as constraints using constrained beam search, which huggingface has quietly supported for a long time.
- gamegoblin 4y agoWouldn't even need to beam search if you restrict it to deterministic context free grammars, which would satisfy > 95% of these "generate some JSON schema" use-cases. For DCFGs you can just zero-out the probability for any token that is invalid in the context, no lookahead or search needed. Wouldn't work for truly context free things like most programming languages, though.