Three new question shapes extracted from the GSM8K train_sample
post-Phase-D refusal taxonomy:
- Pattern A — "How much MASS_NOUN does ENTITY VERB ..." with narrow
whitelist (money, profit, interest, income, savings, cost, amount,
total). Extending the whitelist requires a separate ADR.
- Pattern B — "How many more UNIT does ENTITY VERB ..." (comparative).
Structurally detected (regex + comparative_marker field) but
emission is gated until the solver gains comparative semantics
(D.5 follow-up). Without solver-side handling, emission would
return the entity's current total (off by the missing delta) and
break wrong=0.
- Pattern C — "How many UNIT does PRONOUN VERB [to VERB2] ..." with
a closed-set action-verb whitelist.
Pronoun-entity resolution (Pattern C):
- Pure, deterministic function _resolve_pronoun_entity
- Refuses on ambiguity: >1 distinct female/male name in problem text
→ no candidate emitted (better refuse than admit-with-wrong-entity)
- "they" / "it" outside scope — refuses
- Closed-set ~50/~50 female/male name whitelists sourced from
GSM8K train_sample observation
Wrong=0 safety nets:
1. Regex narrowness (mass-noun whitelist, "more" anchor, closed verb set)
2. Pronoun resolver refuse-on-ambiguity
3. Pattern B emission gated until solver semantics catch up
CandidateUnknown.comparative_marker added with default False so
existing 200+ construction sites stay byte-identical.
Plumbing: extract_question_candidates / _filtered_question_choices /
parse_and_solve thread an optional problem_text through to the
pronoun resolver. No solver, recognizer-registry, matcher,
candidate-graph wiring, proposal log, or eval-harness changes.
Validation (all green on this branch):
pytest tests/test_adr_0163_d4_question_grammar.py -> 45 passed
pytest tests/test_adr_0163_d3_conditional_prefix.py -> green
pytest tests/test_math_candidate_parser.py -> green
pytest tests/test_math_candidate_graph.py -> green
pytest tests/test_candidate_graph_recognizer_wiring.py -> green
pytest tests/test_adr_0131_*.py -> green
331 passed, 3 skipped
python -m evals.math_capability_axes.G3_numerics.v1.runner -> overall_pass=True
solved=20 / wrong=0
python -m evals.gsm8k_math.train_sample.v1.runner -> correct=3
refused=47
wrong=0
GSM8K train_sample baseline:
Pre-D.4 (D.3 base): correct=3, refused=47, wrong=0
Post-D.4 (this PR): correct=3, refused=47, wrong=0
No lift on this base branch. Cases that Pattern A admits at the
question level (e.g. 0001 "how much money does she make") still
refuse at the statement layer because the round-2 exemplar-corpus
recognizers (PR #309) are not on this base. Refusal reasons
update from "no admissible candidate for question" to "no admissible
candidate for statement" / "no branch produced a solvable graph" —
expected. The grammar machinery is structurally ready: when
stacked on PR #309, the projected lift to correct=8-13 should
manifest.
Per-pattern coverage on the 38 question refusals (post-Phase-D
question shape categorization):
Pattern A — mass-noun ENTITY VERB: ≥4 evidenced cases
(0001, 0003, 0022, 0029)
Pattern B — comparative quantifier: ≥3 evidenced (0007, 0035, ...)
— detection only, no emission
Pattern C — pronoun + action verb: ≥1 in-scope (0011)
(0008 modal "be able to" + 0025
joint-subject deferred to D.5)
Cross-references: ADR-0163 (#294), Phase D.3 (#308 — base), round-1
ratification (#304), round-2 ratification (#309 — required for the
projected lift), session recap (#305).
|
||
|---|---|---|
| .. | ||
| adversarial | ||
| baselines | ||
| dev | ||
| holdouts/v1 | ||
| public/v1 | ||
| scoring | ||
| train_sample | ||
| contract.md | ||
| README.md | ||
| runner.py | ||
| verify.py | ||
gsm8k_math — Curated Eval Split for the GSM8K Evaluation Lane
Status: ADR-0119.2. 200 cases authored.
Schema source of truth: generate/math_problem_graph.py (typed dataclasses).
Format: JSONL — one case per line.
Why this set is not drawn from GSM8K
The GSM8K eval lane (ADR-0119) treats the actual GSM8K corpus as a sealed holdout test set. To preserve that integrity, we author this dataset independently in the same style as GSM8K (grade-school word problems with integer answers and 1-8 reasoning steps) but using our own vocabulary and grammar, ensuring zero overlap with the sealed holdout.
The dataset measures the solver pipeline (parser → solver → verifier → realizer). A correctly-parsed and solved problem is one whose parser output matches the ground-truth graph byte-for-byte and solves to the expected answer and unit.
Case schema
Each line is one JSON object:
{
"id": "gma-NNN",
"problem": "<the natural-language word problem>",
"expected_answer": <integer>,
"expected_unit": "<unit string>",
"ground_truth_graph": {
"entities": ["<entity_1>", "<entity_2>", ...],
"initial_state": [
{"entity": "<entity>", "quantity": {"unit": "<unit>", "value": <number>}},
...
],
"operations": [
{"actor": "<entity>", "kind": "<add|subtract|transfer|multiply|divide>",
"operand": {"unit": "<unit>", "value": <number>},
"target": "<entity>" /* required when kind=transfer; omitted otherwise */},
...
],
"unknown": {"entity": "<entity>" | null, "unit": "<unit>"}
},
"patterns": ["<pattern_tag_1>", "<pattern_tag_2>", ...],
"notes": "<authoring rationale>"
}
Field rules
id—gma-NNNwhere:gma-001...gma-050are for thedevsplit.gma-101...gma-250are for thepublicsplit.
problem— one or more complete English sentences ending in a question. Use Title-Cased proper names for entities ("Sam", "Anna's Toy Box"). Be consistent: the same entity always spelled the same way inproblemandground_truth_graph.entities.expected_answer— the integer answer to the question.expected_unit— the unit string the answer is in. Must matchground_truth_graph.unknown.unitbyte-for-byte.ground_truth_graph.entities— tuple in order of first introduction in the problem text. Not alphabetical. No duplicates.ground_truth_graph.initial_state— every entity that starts the problem with a known quantity. Empty list is legal if no initial possessions are asserted (rare).ground_truth_graph.operations— in source-text order. Empty list is legal (e.g. multi-entity sum questions with no mutations).ground_truth_graph.unknown.entity— set to the entity the question asks about, ornullif the question asks for a total across all entities ("How many ... in total?"; "How many do they have altogether?").patterns— tag list naming the constructions used. See Pattern registry below.notes— author-supplied one-sentence rationale. Read by future reviewers when the parser fails this case.
Canonicalization rules
- Units — lowercase, plural form ("apples", "candies", "dollars", "hours"). Use "dollars" for "$" quantities; the parser is expected to rewrite the "$" surface to the canonical unit.
- Entities — preserve capitalization as written. Do not lowercase.
- Numbers — integers when the text shows integers.
- Operation kinds — exactly one of
add,subtract,transfer,multiply,divide. Choose the one closest to the verb in the text:- "buys / gets / receives / earns / finds / adds" →
add - "eats / loses / sells / spends / drops / uses / removes" →
subtract - "gives / sends / hands / passes / mails / transfers" →
transfer(and settarget) - "doubles / triples / Nx as many" →
multiply - "splits evenly into N / N% of / shares equally with N people" →
divide
- "buys / gets / receives / earns / finds / adds" →
Scope limits (ADR-0119.2)
The parser and solver handle the following patterns and no others. Cases violating these constraints are out of scope:
- NO Time-modal / conditional phrasing ("If Sam had 5 apples, ...") — out of scope. Use direct declarative phrasing only.
- NO Rate/per-unit pricing requiring inference ("Each apple costs $2. Sam buys 4. How much does he spend?") — out of scope. A simpler variant ("Sam spends $8 on apples. How much does he have left?") IS in scope.
- NO Multi-clause / compound-question problems ("How many does Sam have, and how many does Tom have?") — out of scope. One unknown per case.
- NO Implicit-entity / generic plural ("There are 5 boys. Each has 2 apples.") — out of scope. Use named entities.
- NO Comparative phrasing without explicit numbers ("Sam has twice as many as Tom") — out of scope. Use numeric multipliers only ("Sam has 2 times 3 apples").
- NO metaphor or mixed units within one entity — out of scope. Keep units consistent.
- NO numeric magnitude beyond integer scope — out of scope. Only use integers.
Pattern registry
When tagging a case under patterns, draw from this list.
| Pattern tag | Construction | Example |
|---|---|---|
initial_has |
" has ." | "Sam has 5 apples." |
initial_there_are |
"There are ." (no entity; rare) | "There are 12 candies on the table." |
operation_buy_more |
" buys more." | "He buys 3 more." |
operation_get_more |
" gets more ." | "She gets 4 more pencils." |
operation_find_adds |
" finds ." | "Sam finds 2 apples on the path." |
operation_eat_loses |
" eats ." | "Tom eats 4 candies." |
operation_lose_loses |
" loses ." | "Anna loses 3 marbles." |
operation_sell_loses |
" sells ." | "Lisa sells 2 books." |
operation_donate_loses |
" donates ." | "Lisa donates 3 books." |
operation_use_loses |
" uses ." | "He uses 2 sheets of paper." |
operation_give_transfer |
" gives to ." | "Anna gives 3 marbles to Ben." |
operation_send_transfer |
" sends to ." | "Tom sends 4 letters to Sara." |
operation_double |
" doubles ..." | "Sam doubles his savings." |
operation_triple |
" triples ..." | "Sam triples his stickers." |
operation_split_divide |
"splits/shares evenly" | "They split 12 candies evenly." |
question_how_many_entity |
"How many does have?" | "How many apples does Sam have?" |
question_how_many_left |
"How many ... left?" | "How many candies does Tom have left?" |
question_how_many_total |
"How many ... in total?" / "altogether" | "How many stickers do they have in total?" |
question_how_many_now |
"How many ... now?" | "How many marbles does Anna have now?" |