Overview
What this challenge is about.
Define a small typed lambda-calculus representation for linear equations and a small set of word-problem templates (rate, age, mixture). Build a parser that maps surface expressions to typed lambda forms, then connect to a symbolic solver (SymPy) for execution. Curate 250 training examples + 50 held-out. Evaluate execution accuracy (does the solver return the correct answer). Deliver the parser + 3-page methods note + a Notion runbook for the curriculum team that wants to add new templates.
The Brief
What you'll do, and what you'll demonstrate.
Build a lambda-calculus-based semantic parser for algebra equations + small word problems that achieves high execution accuracy and is extensible by non-engineers.
Earning criteria — what you'll demonstrate
- Design a typed lambda-calculus representation for a real domain
- Build a grammar-based parser with typed slot filling
- Connect a semantic parser to a symbolic solver
- Document the parser so non-engineers can extend it
Program Fit
Where this fits in your program.
Sharpens the same skills your degree expects you to demonstrate.
Skills
Skills you'll demonstrate.
Each one shows up on your verified credential.
Careers
Roles this prepares you for.
Real titles. Real skill bridges. Pick the one closest to your trajectory.
NLP Engineer
Type-safe semantic parsing connected to a symbolic backend is the NLP engineering work edtech, devtools, and structured-output AI companies hire for.
This challenge sharpens
- semantic-parsing
- lambda-calculus
- grammar-design
AI Engineer
Wiring a parser to a solver and documenting it for non-engineers is the AI-engineer-as-toolsmith role.
This challenge sharpens
- symbolic-reasoning
- grammar-design
- python
ML Researcher
Lambda-calculus semantic parsing is an active research area; this project is a credible publication-adjacent contribution.
This challenge sharpens
- lambda-calculus
- semantic-parsing
- evaluation