I have been experimenting with structural reasoning and built a small engine that learns rewrite rules from only two examples. You provide a pair of before and after expressions and it works out the transformation and applies it to new inputs. There is no LLM, no regex and no hard coded logic.
The demo includes:
TEACH (learn a rule from two examples)
COMPOSE (several learned rules used together) TRANSFER (a rule learned in algebra also works in logic and sets)
SIMPLIFY (multi step deterministic rewriting with a visible trace)
CODEMOD (teaching a codemod from two examples)
It runs on a CPU and produces a reasoning trace for every step. I would be interested to know what people think or where it breaks.
Demo: https://re.heavyweather.io
Comments URL: https://news.ycombinator.com/item?id=46170265
Points: 3
# Comments: 2