articleJan 1, 2013GOLD OA

Semantic Parsing on Freebase from Question-Answer Pairs

Stanford University

Indexed incrossref

Abstract

In this paper, we train a semantic parser that scales up to Freebase.Instead of relying on annotated logical forms, which is especially expensive to obtain at large scale, we learn from question-answer pairs.The main challenge in this setting is narrowing down the huge number of possible logical predicates for a given question.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…

Citation impact

1,587
total citations
FWCI
115.63
Percentile
100%
References
41
Citations per year

Authors

4

Topics & keywords

Keywords
  • Computer science
  • Parsing
  • Bridging (networking)
  • Natural language processing
  • Logical consequence
  • Artificial intelligence
  • Logical form
  • Baseline (sea)
UN Sustainable Development Goals
  • Quality Education
No related works found for this paper.

Funding