Simpler Context-Dependent Logical Forms via Model Projections
Reginald Long, Panupong Pasupat, Percy Liang
TL;DR
This work tackles the problem of learning context-dependent semantic parsing from denotations without a seed lexicon. It introduces a projection framework that starts from a full anchored-logical-form model (Model A) and successively collapses to simpler spaces (Models B and C) to balance expressivity and computation, aided by a left-to-right parser capable of handling ellipsis and anaphora. Across three new datasets (Alchemy, Scene, Tangrams) grounded in world states, Model C shows strong performance under constrained computation, while Model A excels with ample compute and bootstrapping from the simpler models improves practicality. The results demonstrate a meaningful computation-expressivity tradeoff and offer a viable path to scalable context-dependent semantic parsing via projection and bootstrapping, with reproducible data and code.
Abstract
We consider the task of learning a context-dependent mapping from utterances to denotations. With only denotations at training time, we must search over a combinatorially large space of logical forms, which is even larger with context-dependent utterances. To cope with this challenge, we perform successive projections of the full model onto simpler models that operate over equivalence classes of logical forms. Though less expressive, we find that these simpler models are much faster and can be surprisingly effective. Moreover, they can be used to bootstrap the full model. Finally, we collected three new context-dependent semantic parsing datasets, and develop a new left-to-right parser.
