Semantic Parsing of Ambiguous Input through Paraphrasing and Verification
We propose a new method for semantic parsing of ambiguous and ungrammatical input, such as search queries. We do so by building on an existing semantic parsing framework that uses synchronous context free grammars (SCFG) to jointly model the input sentence and output meaning representation. We generalize this SCFG framework to allow not one, but multiple outputs. Using this formalism, we construct a grammar that takes an ambiguous input string and jointly maps it into both a meaning representation and a natural language paraphrase that is less ambiguous than the original input. This paraphrase can be used to disambiguate the meaning representation via verification using a language model that calculates the probability of each paraphrase.
Code (0)
등록된 구현이 없습니다.
Tasks
Language ModelingLanguage ModellingSemantic ParsingSentenceSimilar Papers 제목 키워드 기반
From Paraphrasing to Semantic Parsing: Unsupervised Semantic Parsing via Synchronous Semantic Decoding
Semantic parsing is challenging due to the structure gap and the semantic gap between utterances and logical forms. In this paper, we propose an unsupervised semantic parsing method - Synchronous Semantic Decoding (SSD),…
FormSemantic ParsingUnsupervised semantic parsingSemantic Parsing via Paraphrasing
Bootstrapping a Crosslingual Semantic Parser
Recent progress in semantic parsing scarcely considers languages other than English but professional translation can be prohibitively expensive. We adapt a semantic parser trained on a single language, such as English, t…
Machine TranslationSemantic ParsingTranslationCross-domain Semantic Parsing via Paraphrasing
Existing studies on semantic parsing mainly focus on the in-domain setting. We formulate cross-domain semantic parsing as a domain adaptation problem: train a semantic parser on some source domains and then adapt it to t…
DiversityDomain AdaptationSemantic ParsingWord EmbeddingsUnsupervised Dual Paraphrasing for Two-stage Semantic Parsing
One daunting problem for semantic parsing is the scarcity of annotation. Aiming to reduce nontrivial human labor, we propose a two-stage semantic parsing framework, where the first stage utilizes an unsupervised paraphra…
Semantic ParsingVocal Bursts Valence Prediction