Semantic Parsing on Freebase from Question-Answer Pairs
Code (0)
등록된 구현이 없습니다.
Tasks
Semantic ParsingSimilar Papers 제목 키워드 기반
Large-scale Semantic Parsing without Question-Answer Pairs
In this paper we introduce a novel semantic parsing approach to query Freebase in natural language without requiring manual annotations or question-answer pairs. Our key insight is to represent natural language via seman…
Graph MatchingSemantic ParsingFreebaseQA: A New Factoid QA Data Set Matching Trivia-Style Question-Answer Pairs with Freebase
In this paper, we present a new data set, named FreebaseQA, for open-domain factoid question answering (QA) tasks over structured knowledge bases, like Freebase. The data set is generated by matching trivia-type question…
Question Answeringset matchingTAGQuestion Answering on Freebase via Relation Extraction and Textual Evidence
Existing knowledge-based question answering systems often rely on small annotated training data. While shallow methods like relation extraction are robust to data scarcity, they are less expressive than the deep meaning …
Question AnsweringRelationRelation ExtractionSemantic ParsingEvaluating Induced CCG Parsers on Grounded Semantic Parsing
We compare the effectiveness of four different syntactic CCG parsers for a semantic slot-filling task to explore how much syntactic supervision is required for downstream semantic analysis. This extrinsic, task-based eva…
Semantic Parsingslot-fillingSlot FillingParaphrase Generation from Latent-Variable PCFGs for Semantic Parsing
One of the limitations of semantic parsing approaches to open-domain question answering is the lexicosyntactic gap between natural language questions and knowledge base entries -- there are many ways to ask a question, a…
Open-Domain Question AnsweringParaphrase GenerationQuestion AnsweringSemantic Parsing+1