pith. sign in

arxiv: 1606.05378 · v1 · pith:KGN7QIH7new · submitted 2016-06-16 · 💻 cs.CL

Simpler Context-Dependent Logical Forms via Model Projections

classification 💻 cs.CL
keywords context-dependentformslogicalmodelsimplerdenotationsfullmodels
0
0 comments X
read the original 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. The Tsetlin Machine Goes Deep: Logical Learning and Reasoning With Graphs

    cs.LG 2025-07 unverdicted novelty 7.0

    GraphTM uses message passing on graphs to build nested deep clauses, achieving 3.86% higher accuracy than convolutional TM on CIFAR-10 and competitive results on action tracking, recommendations, and genome sequences.