Our inference includes an execution component and a parser.
we show that, given only a small seed lexicon and a task-specific executor, we can induce high quality models for interpreting complex instructions.