Show HN: Document parsing 5B tokens on a single CPU thread
mit license: https://github.com/john-friedman/doc2struct doc2struct is an algorithm that can parse documents fast on one thread. For example it can parse every every 2025 annual report 19GB in 40s. It preserves nesting, does mild table cleaning, among other things. It succeeds my earlier document parser https://github.com/john-friedman/doc2dict
阅读原始来源
来源记录
指标快照
points · 1 votes
2026-11-06 09:45:15.073Z
cumulative since publication
研究分析
变化记录
来源描述：mit license: https://github.com/john-friedman/doc2struct doc2struct is an algorithm that can parse documents fast on one thread. For example it can parse every every 2025 annual report 19GB in 40s. It preserves nesting, does mild table cleaning, among other things. It succeeds my earlier document parser https://github.com/john-friedman/doc2dict
版本与成本证据
来源票数: 1 votes (2026年11月6日 UTC; cumulative since publication) 可供比较的近期同类记录：“Show HN: Models[.]Dev Index on a Globe” (Show HN, 2026年11月7日)；“Show HN: NLP capabilities of Opus, Astra, Argon measured by Codenames skills” (Show HN, 2026年11月7日)。主题相近仅用于导航，未核验其是否属于同一需求或独立证据。
适用与受影响对象
先明确变化影响的现有工作流，再判断是否升级。发布热度不证明效果提升；接口、价格或可用性变化也可能增加迁移工作。
缺失的比较信息
待补齐：新旧行为、受影响套餐与地区、生效时间、兼容性、回退路径及同一工作量下的成本。
采用与迁移验证
保存发布或政策原文，对新旧方案运行同一个任务并比较结果与完整账单；若涉及停服，先核验截止时间再安排迁移。