We present an approach to learning a model-theoretic semantics for natural language tied to Freebase. Crucially, our approach uses an open predicate vocabulary, enabling it to produce denotations for phrases such as “Re-publican front-runner from Texas ” whose se-mantics cannot be represented using the Free-base schema. Our approach directly converts a sentence’s syntactic CCG parse into a log-ical form containing predicates derived from the words in the sentence, assigning each word a consistent semantics across sentences. This logical form is evaluated against a learned probabilistic database that defines a distribu-tion over denotations for each textual pred-icate. A training phase produces this prob-abilistic database using a corpus of ...
This paper explores theoretical issues in constructing an adequate probabilistic semantics for natur...
One of the limitations of semantic parsing approaches to open-domain question answering is the lexic...
The problem of identifying a probabilistic context free grammar has two aspects: the first is determ...
Traditional semantic parsers map language onto compositional, executable queries in a fixed schema. ...
We consider the challenge of learning seman-tic parsers that scale to large, open-domain problems, s...
In this paper, we train a semantic parser that scales up to Freebase. Instead of relying on annotate...
Suppose we want to build a system that answers a natural language question by representing its seman...
The focus of this thesis is to incorporate linguistic theories of semantics into data-driven models ...
Abstract Computational semantics has long been seen as a field divided between logical and statistic...
In this paper we introduce a novel semantic parsing approach to query Freebase in natu-ral language ...
Answering natural language questions us-ing the Freebase knowledge base has re-cently been explored ...
The focus of this thesis is to incorporate linguistic theories of semantics into data-driven models ...
How do we build a semantic parser in a new domain starting with zero training ex-amples? We introduc...
Most recent question answering (QA) systems query large-scale knowledge bases (KBs) to answer a ques...
With better natural language semantic representations, computers can do more applications more effic...
This paper explores theoretical issues in constructing an adequate probabilistic semantics for natur...
One of the limitations of semantic parsing approaches to open-domain question answering is the lexic...
The problem of identifying a probabilistic context free grammar has two aspects: the first is determ...
Traditional semantic parsers map language onto compositional, executable queries in a fixed schema. ...
We consider the challenge of learning seman-tic parsers that scale to large, open-domain problems, s...
In this paper, we train a semantic parser that scales up to Freebase. Instead of relying on annotate...
Suppose we want to build a system that answers a natural language question by representing its seman...
The focus of this thesis is to incorporate linguistic theories of semantics into data-driven models ...
Abstract Computational semantics has long been seen as a field divided between logical and statistic...
In this paper we introduce a novel semantic parsing approach to query Freebase in natu-ral language ...
Answering natural language questions us-ing the Freebase knowledge base has re-cently been explored ...
The focus of this thesis is to incorporate linguistic theories of semantics into data-driven models ...
How do we build a semantic parser in a new domain starting with zero training ex-amples? We introduc...
Most recent question answering (QA) systems query large-scale knowledge bases (KBs) to answer a ques...
With better natural language semantic representations, computers can do more applications more effic...
This paper explores theoretical issues in constructing an adequate probabilistic semantics for natur...
One of the limitations of semantic parsing approaches to open-domain question answering is the lexic...
The problem of identifying a probabilistic context free grammar has two aspects: the first is determ...