W
wiiiktor/chopper_demo
70-second video: youtu.be/KMvmdXCEOJU
★ 5·更新 2026-11-18
在 GitHub 查看 ↗直链 · 无中转页
我们没有从该仓库取到可核对的安装命令,也没有公开的远端端点。这两样都没有时,我们不出配置——编一条出来比不给更糟。 各客户端的接法 →
- ★ 数取值
- 5 ★ · wiiiktor/chopper_demo · 取自 GitHub 搜索 API · (2026-11-19 20:00:48 核对)
- 来源明细
- 收录自 punkpeye/awesome-mcp-servers 榜单(我们从中收集的条目之一) · 条目类型:MCP 服务
- 收录与活跃
- 收录于 2026-11-18 · 最近见到 2026-11-20 · 共见到 3 次 · 被 3 个来源列出
- 评分构成
- 综合分 300 · 5 ★ · 3 个来源 · mcp
常见问题(答案都来自我们的记录)
它适合谁 / 用来做什么?
我们把它归在这些标签下: MCP 服务。标签来自条目自身,不是我们强加的分类。
谁维护它、还在更新吗?
仓库
wiiiktor/chopper_demo;我们收录于 2026-11-18;最近见到 2026-11-20。这里没有"官方认证"或"质量评级"——我们只记录来源与时间。README 原文(英文,未翻译) · 在 GitHub 读完整 README →
70-second video: youtu.be/KMvmdXCEOJU
以下摘录自该仓库的 README(片段)
Try it in your browser, nothing to install: English demo · Polish demo They run the recommended base chopper (0.31B) on your CPU, with small (0.14B) as a faster option.
See it on real examples: 20 English questions, Chopper vs Opus 5.5 vs gold (PDF)
> Where this is going. The standalone chopper is a first, practical step. The main idea is an integrated chopper: chopping built into the answering LLM itself, reading the model's own cache of the session instead of re-encoding the text in a second model, which should give the highest possible quality and speed. A proof of concept with MiniCPM3-4B is described here.
## Chopper 0.3B close to Opus 5.5 in cutting out the best pieces
Chops are pieces cut out of the original text snippets retrieved from a database or a long conversation: exact quotes,
never rewritten. The chopper (mmBERT, 0.31B) makes them; for comparison, Claude Opus 5.5 makes them too, also forced to
quote directly.
> What is new: a new method, invented in November 2026 in Poland (EU). The chopper is not an LLM summarising the snippets:
> a small encoder reads the question and all 20 snippets together in one pass and marks every word keep or drop. There is no
> text generation, so it is fast: 50 ms per question (20 snippets, ~2,400 tokens) on a consumer-grade GPU (RTX 3090), 36 ms with mmBERT-small.
> One database retrieval per question, even at 4 hops. Every result below uses a single retrieval: each question gets its
> 20 snippets once, the chopper cuts them once, and Qwen3-14B answers once. There are no follow-up searches and no second
> rounds, so a 4-hop question has to be chained from one cut.
### A reranker that also gives you the chops
One model replaces both the reranker and the compressor. Full comparison: below.
### Qwen3-14B answering from full snippets or just short chops
400 MuSiQue questions, 100 each at 1, 2, 3 and 4 hops, each with its own 20 retrieved snippets. Qwen3-14B (4-bit, no fine-tuning,
no thinking mode) answers from the given text only; gpt-5.6-luna judges. Length = prompt tokens. Each score counts every correct
answer, including those from incomplete chops; the number in brackets counts only questions whose chops kept every hop and the answer.
### Qwen3-14B: all snippets vs chops from the chopper vs chops from Opus 5.5
Read each diagram like website traffic: questions flow left to right, and at every hop the ones whose fact the chops missed drop
out; the last stage is Qwen3-14B answering correctly. Top: all 20 retrieved snippets. Middle: the chopper's chops. Bottom: Opus 5.5's chops.
The last stage is the table's score; the lighter block under it counts answers Qwen got right from incomplete chops, and the
number in brackets leaves them out. More: docs/DETAILS.md §7.
### Also a reranker: ranking and chopping in one pass
The chopper scores every passage while it chops (mean p(KEEP) of the passage's 16 most likely tokens). On the
8-language rerank holdout (400 queries, 16 passages each, never trained on), ranked against dedicated rerankers:
| ranking 16 passages | nDCG@10 | Hit@1 | GPU time per query (RTX 3090) |
| chopper, mmBERT-base (0.31B), one pass | 0.973 | 0.972 | 0.20 s, chops + ANSWER/SEARCH included |
See it on real examples: 20 English questions, Chopper vs Opus 5.5 vs gold (PDF)
> Where this is going. The standalone chopper is a first, practical step. The main idea is an integrated chopper: chopping built into the answering LLM itself, reading the model's own cache of the session instead of re-encoding the text in a second model, which should give the highest possible quality and speed. A proof of concept with MiniCPM3-4B is described here.
## Chopper 0.3B close to Opus 5.5 in cutting out the best pieces
Chops are pieces cut out of the original text snippets retrieved from a database or a long conversation: exact quotes,
never rewritten. The chopper (mmBERT, 0.31B) makes them; for comparison, Claude Opus 5.5 makes them too, also forced to
quote directly.
> What is new: a new method, invented in November 2026 in Poland (EU). The chopper is not an LLM summarising the snippets:
> a small encoder reads the question and all 20 snippets together in one pass and marks every word keep or drop. There is no
> text generation, so it is fast: 50 ms per question (20 snippets, ~2,400 tokens) on a consumer-grade GPU (RTX 3090), 36 ms with mmBERT-small.
> One database retrieval per question, even at 4 hops. Every result below uses a single retrieval: each question gets its
> 20 snippets once, the chopper cuts them once, and Qwen3-14B answers once. There are no follow-up searches and no second
> rounds, so a 4-hop question has to be chained from one cut.
### A reranker that also gives you the chops
One model replaces both the reranker and the compressor. Full comparison: below.
### Qwen3-14B answering from full snippets or just short chops
400 MuSiQue questions, 100 each at 1, 2, 3 and 4 hops, each with its own 20 retrieved snippets. Qwen3-14B (4-bit, no fine-tuning,
no thinking mode) answers from the given text only; gpt-5.6-luna judges. Length = prompt tokens. Each score counts every correct
answer, including those from incomplete chops; the number in brackets counts only questions whose chops kept every hop and the answer.
### Qwen3-14B: all snippets vs chops from the chopper vs chops from Opus 5.5
Read each diagram like website traffic: questions flow left to right, and at every hop the ones whose fact the chops missed drop
out; the last stage is Qwen3-14B answering correctly. Top: all 20 retrieved snippets. Middle: the chopper's chops. Bottom: Opus 5.5's chops.
The last stage is the table's score; the lighter block under it counts answers Qwen got right from incomplete chops, and the
number in brackets leaves them out. More: docs/DETAILS.md §7.
### Also a reranker: ranking and chopping in one pass
The chopper scores every passage while it chops (mean p(KEEP) of the passage's 16 most likely tokens). On the
8-language rerank holdout (400 queries, 16 passages each, never trained on), ranked against dedicated rerankers:
| ranking 16 passages | nDCG@10 | Hit@1 | GPU time per query (RTX 3090) |
| chopper, mmBERT-base (0.31B), one pass | 0.973 | 0.972 | 0.20 s, chops + ANSWER/SEARCH included |
收录徽章(可选)
想把收录标记放进 README 就复制这行,可选,不影响收录。
[](https://anclum.com/zh/s/wiiiktor-chopper-demo/)
- 来源
- awesome · https://github.com/wiiiktor/chopper_demo
- 按领域浏览
- MCP 服务
- Traction
- 5 ★
- 收录来源
- 3 个独立来源
- 收录于
- 今天
更多 MCP 服务器
所属领域与标签
每个标签都能点进去看同类的全部条目。数字是当前库里的真实条数。