Corpus ID: 6401679

Semantic Parsing on Freebase from Question-Answer Pairs

@inproceedings{Berant2013SemanticPO,
  title={Semantic Parsing on Freebase from Question-Answer Pairs},
  author={Jonathan Berant and Andrew K. Chou and Roy Frostig and Percy Liang},
  booktitle={EMNLP},
  year={2013}
}
In this paper, we train a semantic parser that scales up to Freebase. [...] Key Method We tackle this problem in two ways: First, we build a coarse mapping from phrases to predicates using a knowledge base and a large text corpus. Second, we use a bridging operation to generate additional predicates based on neighboring predicates. On the dataset of Cai and Yates (2013), despite not having annotated logical forms, our system outperforms their state-of-the-art parser. Additionally, we collected a more realistic…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
Paraphrase Generation from Latent-Variable PCFGs for Semantic Parsing
TLDR
A novel grammar model for paraphrase generation is introduced that does not require any sentence-aligned paraphrase corpus and is able to leverage the flexibility and scalability of latent-variable probabilistic context-free grammars to sample paraphrases. Expand
Compositional Semantic Parsing on Semi-Structured Tables
TLDR
This paper proposes a logical-form driven parsing algorithm guided by strong typing constraints and shows that it obtains significant improvements over natural baselines and is made publicly available. 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
Improving Semantic Parsing via Answer Type Inference
TLDR
The possibility of inferring the answer type before solving a factoid question and leveraging the type information to improve semantic parsing is shown and it is observed that if the authors convert a question into a statement form, the LSTM model achieves better accuracy. Expand
Single-Entity-Single-Relation Question Answering with Minimal Annotation
TLDR
A novel bag-of-words based approach that automatically constructs a semantic parsing based question answering (QA) system tailored to single-entity-single-relation questions is presented, believed to be one of the first of its kind. 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
An Effective Framework for Question Answering over Freebase via Reconstructing Natural Sequences
TLDR
This paper proposes an effective framework that bridges the gap between the given question and the answer entities, by reconstructing the intermediate natural sequences on the basis of the entities and relations in knowledge bases. Expand
SPARQA: Skeleton-based Semantic Parsing for Complex Questions over Knowledge Bases
TLDR
A novel skeleton grammar to represent the high-level structure of a complex question is proposed with a dedicated coarse-grained formalism with a BERT-based parsing algorithm to improve the accuracy of the downstream fine-graining semantic parsing. Expand
Large-Scale Question Answering with Joint Embedding and Proof Tree Decoding
TLDR
This paper frames the problem from a proof-theoretic perspective, and formulate it as a proof tree search problem that seamlessly unifies semantic parsing, logic reasoning, and answer ranking, and combines word entity joint embedding learned from web-scale data with other surface-form features to further boost accuracy improvements. Expand
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 46 REFERENCES
Learning Dependency-Based Compositional Semantics
TLDR
A new semantic formalism, dependency-based compositional semantics (DCS) is developed and a log-linear distribution over DCS logical forms is defined and it is shown that the system obtains comparable accuracies to even state-of-the-art systems that do require annotated logical forms. Expand
Weakly Supervised Training of Semantic Parsers
TLDR
This work presents a method for training a semantic parser using only a knowledge base and an unlabeled text corpus, without any individually annotated sentences, and demonstrates recovery of this richer structure by extracting logical forms from natural language queries against Freebase. 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
Driving Semantic Parsing from the World’s Response
TLDR
This paper develops two novel learning algorithms capable of predicting complex structures which only rely on a binary feedback signal based on the context of an external world and reformulates the semantic parsing problem to reduce the dependency of the model on syntactic patterns, thus allowing the parser to scale better using less supervision. 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
Grounded Unsupervised Semantic Parsing
TLDR
This work presents the first unsupervised approach for semantic parsing that rivals the accuracy of supervised approaches in translating natural-language questions to database queries, and adopts a novel grounded-learning approach to leverage database for indirect supervision. Expand
Natural Language Questions for the Web of Data
TLDR
This paper presents a methodology for translating natural language questions into structured SPARQL queries over linked-data sources, based on an integer linear program to solve several disambiguation tasks jointly. Expand
Using Semantic Unification to Generate Regular Expressions from Natural Language
TLDR
This model substantially outperforms a state-of-the-art semantic parsing baseline, yielding a 29% absolute improvement in accuracy. Expand
Modeling Relations and Their Mentions without Labeled Text
TLDR
A novel approach to distant supervision that can alleviate the problem of noisy patterns that hurt precision by using a factor graph and applying constraint-driven semi-supervision to train this model without any knowledge about which sentences express the relations in the authors' training KB. Expand
Lexical Generalization in CCG Grammar Induction for Semantic Parsing
TLDR
An algorithm for learning factored CCG lexicons, along with a probabilistic parse-selection model, which includes both lexemes to model word meaning and templates to model systematic variation in word usage are presented. Expand
...
1
2
3
4
5
...