Compositional Semantic Parsing on Semi-Structured Tables

@article{Pasupat2015CompositionalSP,
  title={Compositional Semantic Parsing on Semi-Structured Tables},
  author={Panupong Pasupat and Percy Liang},
  journal={ArXiv},
  year={2015},
  volume={abs/1508.00305}
}
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… Expand
Evaluating Semantic Parsing against a Simple Web-based Question Answering Model
TLDR
This paper proposes to evaluate semantic parsing-based question answering models by comparing them to a question answering baseline that queries the web and extracts the answer only from web snippets, without access to the target knowledge-base, and finds that this approach achieves reasonable performance. Expand
Neural Semantic Parsing with Type Constraints for Semi-Structured Tables
TLDR
A new semantic parsing model for answering compositional questions on semi-structured Wikipedia tables with a state-of-the-art accuracy and type constraints and entity linking are valuable components to incorporate in neural semantic parsers. Expand
Search-based Neural Structured Learning for Sequential Question Answering
TLDR
This work proposes a novel dynamic neural semantic parsing framework trained using a weakly supervised reward-guided search that effectively leverages the sequential context to outperform state-of-the-art QA systems that are designed to answer highly complex questions. Expand
Tables as Semi-structured Knowledge for Question Answering
TLDR
This paper first uses the structure of tables to guide the construction of a dataset of over 9000 multiple-choice questions with rich alignment annotations, then uses this annotated data to train a semi-structured feature-driven model for question answering that uses tables as a knowledge base. Expand
Answering Complicated Question Intents Expressed in Decomposed Question Sequences
TLDR
This work collects a dataset of 6,066 question sequences that inquire about semi-structured tables from Wikipedia, with 17,553 question-answer pairs in total, and proposes strategies to handle questions that contain coreferences to previous questions or answers. Expand
A Hybrid Semantic Parsing Approach for Tabular Data Analysis
This paper presents a novel approach to translating natural language questions to SQL queries for given tables, which meets three requirements as a real-world data analysis application: cross-domain,Expand
Abductive Matching in Question Answering
TLDR
A new way to apply the technique of semantic parsing is introduced by applying machine learning only to provide annotations that the system infers to be missing; all the other parsing logic is in the form of manually authored rules. Expand
TaPas: Weakly Supervised Table Parsing via Pre-training
TLDR
TaPas is presented, an approach to question answering over tables without generating logical forms that outperforms or rivals semantic parsing models by improving state-of-the-art accuracy on SQA and performing on par with the state of theart on WikiSQL and WikiTQ, but with a simpler model architecture. Expand
Answering Complex Questions Using Open Information Extraction
TLDR
This work develops a new inference model for Open IE that can work effectively with multiple short facts, noise, and the relational structure of tuples, and significantly outperforms a state-of-the-art structured solver on complex questions of varying difficulty. Expand
Iterative Search for Weakly Supervised Semantic Parsing
TLDR
A novel iterative training algorithm is proposed that alternates between searching for consistent logical forms and maximizing the marginal likelihood of the retrieved ones, thus dealing with the problem of spuriousness. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 40 REFERENCES
Semantic Parsing on Freebase from Question-Answer Pairs
TLDR
This paper trains a semantic parser that scales up to Freebase and outperforms their state-of-the-art parser on the dataset of Cai and Yates (2013), despite not having annotated logical forms. Expand
Large-scale Semantic Parsing without Question-Answer Pairs
TLDR
This paper introduces a novel semantic parsing approach to query Freebase in natural language without requiring manual annotations or question-answer pairs and converts sentences to semantic graphs using CCG and subsequently grounds them to Freebase guided by denotations as a form of weak supervision. Expand
Semantic Parsing via Paraphrasing
TLDR
This paper presents two simple paraphrase models, an association model and a vector space model, and trains them jointly from question-answer pairs, improving state-of-the-art accuracies on two recently released question-answering datasets. Expand
Scaling Semantic Parsers with On-the-Fly Ontology Matching
TLDR
A new semantic parsing approach that learns to resolve ontological mismatches, which is learned from question-answer pairs, uses a probabilistic CCG to build linguistically motivated logicalform meaning representations, and includes an ontology matching model that adapts the output logical forms for each target ontology. Expand
Paraphrase-Driven Learning for Open Question Answering
TLDR
This work demonstrates that it is possible to learn a semantic lexicon and linear ranking function without manually annotating questions and automatically generalizes a seed lexicon, and includes a scalable, parallelized perceptron parameter estimation scheme. Expand
Template-based question answering over RDF data
TLDR
A novel approach that relies on a parse of the question to produce a SPARQL template that directly mirrors the internal structure of theQuestion answering system, which is then instantiated using statistical entity identification and predicate detection. Expand
Open question answering over curated and extracted knowledge bases
TLDR
This paper presents OQA, the first approach to leverage both curated and extracted KBs, and demonstrates that it achieves up to twice the precision and recall of a state-of-the-art Open QA system. Expand
Online Learning of Relaxed CCG Grammars for Parsing to Logical Form
TLDR
A key idea is to introduce non-standard CCG combinators that relax certain parts of the grammar—for example allowing flexible word order, or insertion of lexical items— with learned costs. Expand
Large-scale Semantic Parsing via Schema Matching and Lexicon Extension
TLDR
A semantic parser for Freebase is developed based on a reduction to standard supervised training algorithms, schema matching, and pattern learning that is capable of parsing questions with an F1 that improves by 0.42 over a purely-supervised learning algorithm. Expand
Pythia: Compositional Meaning Construction for Ontology-Based Question Answering on the Semantic Web
TLDR
Pythia compositionally constructs meaning representations using a vocabulary aligned to the vocabulary of a given ontology, which relies on a deep linguistic analysis that allows to construct formal queries even for complex natural language questions. Expand
...
1
2
3
4
...