arXiv (All)
open access
Provably Tractable NFA-Constrained Language Generation via HMMs
Constrained generation aims to sample from language models (LMs) conditioned on hard constraints. Existing constrained-generation techniques for nondeterministic finite automaton (NFA) constraints either distort the distribution or sacrifice efficiency. Theoretically, this task reduces to counting t
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- (Towards) Scalable Reliable Automated Evaluation with Large Language Models#414122
- Beyond the Final Layer: Intermediate Representations for Better Multilingual Calibration in Large Language Models#798653
- Beyond the Final Layer: Intermediate Representations for Better Multilingual Calibration in Large Language Models#797239
- Scaling Unsupervised Word Alignment to Documents via Structural Constraints#662203
- Scaling Unsupervised Word Alignment to Documents via Structural Constraints#661153
Record · ID 1154450
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive