资源论文Complex Question Decomposition for Semantic Parsing

Complex Question Decomposition for Semantic Parsing

2019-09-18 | |  110 |   65 |   0 0 0
Abstract In this work, we focus on complex question semantic parsing and propose a novel Hierarchical Semantic Parsing (HSP) method, which utilizes the decompositionality of complex questions for semantic parsing. Our model is designed within a three-stage parsing architecture based on the idea of decompositionintegration. In the first stage, we propose a question decomposer which decomposes a complex question into a sequence of subquestions. In the second stage, we design an information extractor to derive the type and predicate information of these questions. In the last stage, we integrate the generated information from previous stages and generate a logical form for the complex question. We conduct experiments on COMPLEXWEBQUESTIONS which is a large scale complex question semantic parsing dataset, results show that our model achieves significant improvement compared to state-of-the-art methods.

上一篇:Attention Is (not) All You Need for Commonsense Reasoning

下一篇:Constructing Interpretive Spatio-Temporal Features for Multi-TurnResponses Selection

用户评价
全部评价

热门资源

  • The Variational S...

    Unlike traditional images which do not offer in...

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...