Papers › Neural Semantic Parsing with Type Constraints for Semi-Structured Tables

Neural Semantic Parsing with Type Constraints for Semi-Structured Tables

1 Sep 2017EMNLP 2017 9archive 2025-07-28

Jayant Krishnamurthy, Pradeep Dasigi, Matt Gardner

We present a new semantic parsing model for answering compositional questions on semi-structured Wikipedia tables. Our parser is an encoder-decoder neural network with two key technical innovations: (1) a grammar for the decoder that only generates well-typed logical forms; and (2) an entity embedding and linking module that identifies entity mentions while generalizing across tables. We also introduce a novel method for training our neural model with question-answer supervision. On the WikiTableQuestions data set, our parser achieves a state-of-the-art accuracy of 43.3{%} for a single model and 45.9{%} for a 5-model ensemble, improving on the best prior score of 38.7{%} set by a 15-model ensemble. These results suggest that type constraints and entity linking are valuable components to incorporate in neural semantic parsers.

PaperPDFCode

Code

allenai/pnp official report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

DecoderEntity LinkingQuestion AnsweringSemantic ParsingVocal Bursts Type Prediction

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections