tobi/grammar-inference-engine
1
0
Fork 0
Code Issues Pull requests Projects Releases Packages Wiki Activity Actions

gif 50% bigger than 37.5% = 56.25%

Browse source
This commit is contained in:
tobjend 2026-07-01 11:40:09 +02:00
parent 0c91e11d4b
commit 2b7541a8b1
1 changed files with 2 additions and 2 deletions
Show stats Download patch file Download diff file Expand all files Collapse all files

4
README.md
View file

@ -15,7 +15,7 @@ Dervish replaces both with a **one-call MCP tool**: pass your sequences, get bac
**Without Dervish:** token cost scales linearly with examples. **With Dervish:** one compact grammar describes them all — a ~60–200 token rule instead of thousands of tokens of raw examples. Try it out and you too will say:
<p align="center"><img src="dervish.gif" alt="Dervish animation" width="75%"></p>
<p align="center"><img src="dervish.gif" alt="Dervish animation" width="56.25%"></p>
## MCP Server
@ -142,7 +142,7 @@ The sweet spot: **multiple implementations of the same abstract task** with a sh
## Token savings
<p align="center">
<img src="chart_token_savings.png" alt="Token savings per dataset" width="75%">
<img src="chart_token_savings.png" alt="Token savings per dataset" width="56.25%">
</p>
Across all public benchmarks, Dervish delivers **40–83× compression**. The grammar is smaller than a single example file would be — and it represents the entire dataset.