
Codearia Sieve
io.github.AntonG87由 GitHub 账号 AntonG87 发布v0.2.2更新于 Oct 24, 2026
Web pages into decision-ready state: dates, numbers with units, budgeted chunks. No model, no key.
概览
抓取网页并返回结构化状态——带类型的日期、带单位的数字,以及符合 token 预算、带锚点的分块——供决策模型使用。
- 可以做什么
- codearia-sieve 把网页解析成紧凑的、带类型的表示,而不是散文。它规范化日期(例如把 "Published September 15, 2026" 变成 "2026-09-15"),只在存在单位时才把数字变成事实,并把正文切成能放进模型上下文窗口的分块,每块都带有 token 与字符大小以及指回原页面的锚点。它还会报告用量(原始 token 与状态 token 对比)以及具名警告,例如 robots-disallowed、blocked、paywall 或 empty-without-js。主要工具是 sieve_page,接受 URL 或 HTML 并返回结构化内容;以及 sieve_chunk,无需重新抓取即可返回该 URL 上次结果中某个分块的文本。
- 适用场景
- 当智能体需要读取网页且 token 开销很重要时,或者当廉价的分类、排序或评判模型需要干净、可核查的输入而不是原始 HTML 时,适合使用。它也适合每个抽取事实都必须指回其来源块或锚点的工作流。它不面向由 JavaScript 渲染的文章、首页或列表页,这些只会返回警告而不是内容。
- 运行要求
- 通过 stdio 在本地运行,通常使用 npx codearia-sieve,或作为 npm 库使用。未声明任何 API 密钥、账号或环境变量。需要网络访问以抓取页面,npm 包需要 Node.js 运行时。
安装
在 SourceWeft 中
- 打开 控制台中的 Codearia Sieve,将其添加到工作区。
- 为需要使用其工具的对话启用该服务。
Desktop only,通过 STDIO。 STDIO 服务会启动本地进程,因此需要 SourceWeft 桌面宿主。
其他 MCP 客户端
参照 仓库 中的启动说明。
README
[codearia-sieve — web pages into decision-ready state]
codearia-sieve
Parses a web page into the exact format a decision model needs.
Dates as dates. Numbers with units. Text in chunks that fit the model's window, each pointing back to where it came from.
One call — and the token bill, before and after.
[MCP server] [TypeScript] [MCP Registry] [npm] [MIT] [Tests] [No model, no key]
Measured, not promised. A live run over random pages picked the same day — fresh news from RSS feeds in several languages, random Wikipedia articles, docs, blogs, government sites, recipes, shops. Every row is in bench/analytics/, and npm run analytics reruns the whole thing. The output was then put in front of a decision model: see Checked by a judge.
What it does
An agent that needs a web page fetches the whole thing: navigation, cookie banner, footer, ad slots, a megabyte of framework markup. Then a model paid per token digs through the pile for one paragraph.
codearia-sieve does the digging before the model sees anything — and returns the page as state, not prose:
Everything else — menus, footers, banners, tag rows, "read more" — is removed, and with trace: true you get the list of what was removed and why.
Who it is for
People who build agents and have seen the bill. Every fetched page costs tens of thousands of tokens before the agent has read a word of it. Median page in the sample: 53 718 tokens in, 1 106 out.
People who run cheap decision models. Classifiers, rankers, System One models like Jev that judge instead of write. They are nearly free and very fast, and they have hard edges: they cannot count, they read dates as text, and their accuracy drops as irrelevant material fills the context. Every "page to markdown" tool prepares input for a reader. This one prepares input for a judge.
People who need answers they can check. A verdict from scraped text is unprovable unless each piece points back to its source. Here every fact names its block and every chunk carries an anchor.
How it works
Eight steps of ordinary code. No model runs unless you plug one in. The same HTML gives the same JSON, byte for byte.
- Fetch —
robots.txtfirst; a refusal is reported, not bypassed. Plain HTTP, honest user agent. - Parse — HTML into a DOM with
linkedom. No browser. - Dates and ids from the untouched tree — cleaning strips
<head>, bylines and attributes, so both are read before it runs. - Clean — Defuddle removes chrome; Readability takes over if it comes back empty. Inline elements get a space first, so
<span>20 Sept</span><span>10 min</span>never becomes202610 min. - Blocks — headings, paragraphs, lists, tables, code, quotes, in order, with positional ids. Old pages set with
<br><br>become paragraphs too; table rows keep their column headers. - Facts and anchors — ids restored; numbers become facts only beside a unit; ranges keep both ends.
- Chunk — greedy, in order, under two budgets at once: 20 000 tokens and 50 000 characters by default.
- Assemble —
state,markdown,usage,warnings, and the trace on request.
What the result looks like
Expected outcomes never throw. They come back as warnings, each named:
Use it from an agent
You say what you want in plain words. The agent finds the pages, calls sieve_page for each, hands the state to a decision model with a typed question, and writes up the result. Sieve prepares. The judge judges. The agent writes.
Listed in the official MCP Registry as io.github.AntonG87/codearia-sieve; clients that read the registry can install it by name.
Pairs with jev-mcp: chunks are sized to fit its fields, so state goes straight into a typed question.
Checked by a judge
The claim is that a decision model gets better input from Sieve than from raw text. So the output was handed to one. examples/jev.ts drives both MCP servers with the official client — codearia-sieve prepares six pages (API docs, a release note, two Wikipedia articles in two languages, two pricing pages), Jev judges them through jev-mcp. Same run, 21 September 2026:
The first pass of this test did its job the other way round: Jev sent three facts to review and contradicted one. All four traced to Sieve — a table row labelled by its column header instead of its row header, two rates in one header left unpaired, and a Russian bibliographic "256 с." read as seconds. Fixed, tested, rerun: 11 of 11. A judge that can tell you when your parser is wrong is the point of the whole pairing.
Use it as a library
parseDate, findDates and the vendor limits (JEV, JEV_MCP, DEFAULT_BUDGET) are exported too.
Where it stops
- Front pages, listings and product pages have no article to find. You get the headlines and a
thin-contentwarning, not a fake win. - Articles rendered by JavaScript come back as
empty-without-jswhen the container is empty. A site that ships a teaser and streams the rest cannot be told apart without a browser; you get the teaser. - Text-heavy pages save less. A whole novel saves 22 %, an RFC 84 %: there is no wrapping to remove and the text is kept in full. That is the tool working.
- A pricing grid is not a table. A fact knows the block it came from, not the plan column it sits under; Sieve does not guess the pairing. Send the chunk — a pricing page is about a thousand tokens after cleaning — and let the judge read it:
examples/pricing-watch.ts. - Tokens are counted with o200k as an approximation. Pages over a megabyte get a sampled count and
usage.rawTokensEstimated: true.
Develop
Design notes — vision and architecture — are in docs/.
MIT © 2026 Anton Evelson · Codearia Academy
来源:README.md,提交 f8a2757
工具
0版本历史
1- v0.2.2最新Sep 22, 2026
评分
已满足适用检查项的 50%
该评分衡量此收录条目的完整程度,依据注册中心条目、端点与公开来源计算得出。它不是对服务器本身的评价,也不表示服务器安全或当前可用:可连通性是带日期的检查结果,评分也不包含安装量或用户评价。
- 近 30 天内可连通25 分
请保持端点能够响应 MCP 握手;SourceWeft 每 30 天探测一次。
- 已声明认证方式10 分
请在注册中心条目中声明凭据请求头,或保持端点能够响应探测,以便判定其认证方式。
- 已列出工具15 分
请让服务器在无凭据时响应 tools/list,或发布可在沙箱中无凭据启动的软件包。
- 描述必需15 分
- 图标10 分
- 文档15 分
- 许可证10 分