What would larger narration chunks cost against speech policy 6, and at what latency?
还没有人认领这个 Issue。
评估
- 难度
- 5/5
- 预计耗时
- 一周以上
- 新手友好度
- 15/100
- Issue 类型
- 文档
- 描述清晰度
- 基本清楚
- 活跃度
- 活跃
- 领域
- ai, performance
调研方向
This is an estimation write-up, not a code change. Start with the narration eval fixtures and the derStandard, Anthropic and Cloudflare excerpts, then read the cost and overlap analysis in issue 317 and the chunk-size question in issue 324, since both set inputs. Read ADR 0008 and ADR 0011 for the whole-document synthesis and single-track constraints that define the latency and retry numbers. Done means each figure is labelled measured, estimated or unverified, with the assumptions stated.
由索引模型根据 Issue 内容生成。
描述
Question
What would larger narration chunks cost against speech policy 6, and what would they do to the slowest synthesis request and a failed segment's retry?
The baseline is speech policy 6, one request per synchronization unit. Overlap and cut, about 1.45× policy 6 because each segment boundary repeated the previous chunk's last sentence (How much overlap, and at what cost?), was withdrawn on 2026-11-13 (ADR 0028); its cost is now only the price of continuity that larger chunks are measured against. With the chunk size How long can one Gemini 3.8 TTS request get before a fresh start inside it? settles, estimate from the narration eval fixtures (and the derStandard, Anthropic and Cloudflare excerpts):
- synthesized audio per article against policy 6, plus speech recognition and the model-based placement step per chunk;
- the price change of Gemini 3.8 Flash-Lite TTS audio on 2027-01-01;
- the slowest synthesis request per article and the conversion's time until the narration track exists, given that the whole document is synthesized and the track exists only once every segment has audio (ADR 0008, ADR 0011);
- how much audio a failed segment's retry repeats, and what that does to cost at plausible failure rates.
Mark measured, estimated and unverified figures. Light paid probes are fine.
Part of Map: decouple speech synthesis from synchronization units.
- 主要语言
- TypeScript
- 星标
- 1
- 派生
- 0
- PR 合并指标
- 30 天内没有已合并 PR
环境准备
这个项目没有提供开发容器、Dockerfile 或贡献指南,环境需要你自己搭建:先看它的 README,通用步骤见我们的新手贡献指南。
从这里开始
- 先读完整个 Issue,再读项目的贡献指南。
- 在 Issue 下留言说明你要接手 —— 这能避免两个人做同样的事。
- Fork 仓库,在一个分支上完成修改。
- 提交 Pull Request,并在描述里引用这个 Issue 编号。
patricktree/cup 的其他 Issue
-
wayfinder:grilling
难度 2/5 1-3 小时 新手友好度 72/100
patricktree/cup#484 ·
-
wayfinder:grilling
难度 2/5 1-3 小时 新手友好度 48/100
patricktree/cup#487 ·
-
wayfinder:grilling
难度 5/5 一周以上 新手友好度 25/100
patricktree/cup#486 ·
-
wayfinder:grilling
难度 5/5 一周以上 新手友好度 25/100
patricktree/cup#485 ·
-
wayfinder:grilling
难度 5/5 一周以上 新手友好度 25/100
patricktree/cup#483 ·
相似的 Issue
-
难度 2/5 1-3 小时 新手友好度 72/100
维护者通常 1 天内回复
-
难度 2/5 1-3 小时 新手友好度 78/100
vercel-labs/ui#865 ·
维护者通常 1 天内回复
-
bug
难度 2/5 1-3 小时 新手友好度 63/100
outline/outline#14638 · 1 条评论 ·
维护者通常 1 天内回复
-
bot:ai-assisted component:platform-js status:untriaged
难度 2/5 1-3 小时 新手友好度 78/100
midnightntwrk/platform-js#69 ·
维护者通常 1 天内回复
-
bug
难度 2/5 1-3 小时 新手友好度 67/100
维护者通常 1 天内回复