Compositional Semantic Parsing on Semi-Structured Tables

Panupong Pasupat, Percy Liang
8/3/2015
cs.CL

Official code: percyliang/sempre (842 stars, last commit 2023-05-01).

Abstract

Two important aspects of semantic parsing for question answering are the breadth of the knowledge source and the depth of logical compositionality. While existing work trades off one aspect for another, this paper simultaneously makes progress on both fronts through a new task: answering complex questions on semi-structured tables using question-answer pairs as supervision. The central challenge arises from two compounding factors: the broader domain results in an open-ended set of relations, and the deeper compositionality results in a combinatorial explosion in the space of logical forms. We propose a logical-form driven parsing algorithm guided by strong typing constraints and show that it obtains significant improvements over natural baselines. For evaluation, we created a new dataset of 22,033 complex questions on Wikipedia tables, which is made publicly available.

View on arXivView PDF

Code Implementations(1)

percyliang/sempreOfficial100%

Semantic Parser with Execution

842293CSS, HTMLSep 18, 20133 years agoNOASSERTION

Similar Papers

Cite this paper

@article{pasupat2015compositional,
  title  = {Compositional Semantic Parsing on Semi-Structured Tables},
  author = {Panupong Pasupat and Percy Liang},
  year   = {2015},
  eprint = {1508.00305},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/1508.00305}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/1508.00305.svg)](https://codeofpaper.com/paper/1508.00305)

Discussion