We formulate semantic parsing as a parsing problem on a synchronous context free grammar (SCFG) which is automatically built on the corpus of natural language sentences and the representation of semantic outputs. We then present an online learning framework for estimating the synchronous SCFG grammar. In addition, our online learning methods for semantic parsing problems are also extended to deal with the case, in which the semantic representation could be represented under λ-calculus. Experimental results in the domain of semantic parsing show advantages in comparison with previous works
Several recent stochastic parsers use bilexical grammars, where each word type idiosyncratically pre...
Computational systems that learn to transform natural-language sentences into semantic representatio...
It is often assumed that ‘grounded’ learning tasks are beyond the scope of grammatical inference tec...
Semantic parsing is the task of mapping a natural language sentence into a complete, formal meaning ...
How do we build a semantic parser in a new domain starting with zero training ex-amples? We introduc...
Semantic parsing maps a sentence in natu-ral language into a structured meaning rep-resentation. Pre...
Parsing is the process of assigning structure to sentences. The structure is obtained from the gramm...
Semantic parsing, which aims at mapping a natural language (NL) sentence into its formal meaning rep...
Research in semantic parsing has focused on developing computational systems capable of simultaneous...
We consider the problem of learning to parse sentences to lambda-calculus representations of their u...
Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata [1,2],...
We present a novel method for inducing synchronous context free grammars (SCFGs) from a corpus of pa...
We present a novel method for inducing synchronous context free grammars (SCFGs) from a corpus of pa...
This paper presents a novel method of semantic parsing that maps a natural language (NL) sentence to...
Synchronous grammars, which may be broadly characterized as sets of rules for generating sentence pa...
Several recent stochastic parsers use bilexical grammars, where each word type idiosyncratically pre...
Computational systems that learn to transform natural-language sentences into semantic representatio...
It is often assumed that ‘grounded’ learning tasks are beyond the scope of grammatical inference tec...
Semantic parsing is the task of mapping a natural language sentence into a complete, formal meaning ...
How do we build a semantic parser in a new domain starting with zero training ex-amples? We introduc...
Semantic parsing maps a sentence in natu-ral language into a structured meaning rep-resentation. Pre...
Parsing is the process of assigning structure to sentences. The structure is obtained from the gramm...
Semantic parsing, which aims at mapping a natural language (NL) sentence into its formal meaning rep...
Research in semantic parsing has focused on developing computational systems capable of simultaneous...
We consider the problem of learning to parse sentences to lambda-calculus representations of their u...
Synchronous Context-Free Grammars (SCFGs), also known as syntax-directed translation schemata [1,2],...
We present a novel method for inducing synchronous context free grammars (SCFGs) from a corpus of pa...
We present a novel method for inducing synchronous context free grammars (SCFGs) from a corpus of pa...
This paper presents a novel method of semantic parsing that maps a natural language (NL) sentence to...
Synchronous grammars, which may be broadly characterized as sets of rules for generating sentence pa...
Several recent stochastic parsers use bilexical grammars, where each word type idiosyncratically pre...
Computational systems that learn to transform natural-language sentences into semantic representatio...
It is often assumed that ‘grounded’ learning tasks are beyond the scope of grammatical inference tec...