SPARQA: Skeleton-based Semantic Parsing for Complex Questions over Knowledge Bases

• URL: http://arxiv.org/abs/2003.13956v1
• Date: Tue, 31 Mar 2020 05:12:31 GMT
• Title: SPARQA: Skeleton-based Semantic Parsing for Complex Questions over Knowledge Bases
• Authors: Yawei Sun, Lingling Zhang, Gong Cheng, Yuzhong Qu
• Abstract summary: We propose a novel skeleton grammar to represent the high-level structure of a complex question. This dedicated coarse-grained formalism with a BERT-based parsing algorithm helps to improve the accuracy of the downstream fine-grained semantic parsing. Our approach shows promising performance on several datasets.
• Score: 27.343078784035693
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Semantic parsing transforms a natural language question into a formal query over a knowledge base. Many existing methods rely on syntactic parsing like dependencies. However, the accuracy of producing such expressive formalisms is not satisfying on long complex questions. In this paper, we propose a novel skeleton grammar to represent the high-level structure of a complex question. This dedicated coarse-grained formalism with a BERT-based parsing algorithm helps to improve the accuracy of the downstream fine-grained semantic parsing. Besides, to align the structure of a question with the structure of a knowledge base, our multi-strategy method combines sentence-level and word-level semantics. Our approach shows promising performance on several datasets.

Related papers

• Semantic Parsing for Question Answering over Knowledge Graphs [3.10647754288788]
  We introduce a novel method with graph-to-segment mapping for question answering over knowledge graphs. This method centers on semantic parsing, a key approach for interpreting these utterances. Our framework employs a combination of rule-based and neural-based techniques to parse and construct semantic segment sequences.
  arXiv  Detail & Related papers  (2023-12-01T20:45:06Z)
• HPE:Answering Complex Questions over Text by Hybrid Question Parsing and Execution [92.69684305578957]
  We propose a framework of question parsing and execution on textual QA. The proposed framework can be viewed as a top-down question parsing followed by a bottom-up answer backtracking. Our experiments on MuSiQue, 2WikiQA, HotpotQA, and NQ show that the proposed parsing and hybrid execution framework outperforms existing approaches in supervised, few-shot, and zero-shot settings.
  arXiv  Detail & Related papers  (2023-05-12T22:37:06Z)
• From Parse-Execute to Parse-Execute-Refine: Improving Semantic Parser for Complex Question Answering over Knowledge Base [11.72232145568396]
  KoPL has been proposed to explicitly model the reasoning processes, which achieved the state-of-the-art on complex KBQA. We show that such simple strategy can significantly improve the ability of complex reasoning.
  arXiv  Detail & Related papers  (2023-05-05T08:20:09Z)
• Knowledge Base Question Answering by Case-based Reasoning over Subgraphs [81.22050011503933]
  We show that our model answers queries requiring complex reasoning patterns more effectively than existing KG completion algorithms. The proposed model outperforms or performs competitively with state-of-the-art models on several KBQA benchmarks.
  arXiv  Detail & Related papers  (2022-02-22T01:34:35Z)
• Analyzing Semantics of Aggregate Answer Set Programming Using Approximation Fixpoint Theory [1.295566630218982]
  We introduce the notion of a ternary satisfaction relation and define stable semantics in terms of it. We show that ternary satisfaction relations bridge the gap between the standard Gelfond-Lifschitz reduct, and stable semantics as defined in the framework of AFT.
  arXiv  Detail & Related papers  (2021-04-30T07:06:27Z)
• Hierarchical Poset Decoding for Compositional Generalization in Language [52.13611501363484]
  We formalize human language understanding as a structured prediction task where the output is a partially ordered set (poset) Current encoder-decoder architectures do not take the poset structure of semantics into account properly. We propose a novel hierarchical poset decoding paradigm for compositional generalization in language.
  arXiv  Detail & Related papers  (2020-10-15T14:34:26Z)
• Pareto Probing: Trading Off Accuracy for Complexity [87.09294772742737]
  We argue for a probe metric that reflects the fundamental trade-off between probe complexity and performance. Our experiments with dependency parsing reveal a wide gap in syntactic knowledge between contextual and non-contextual representations.
  arXiv  Detail & Related papers  (2020-10-05T17:27:31Z)
• A Comparative Study on Structural and Semantic Properties of Sentence Embeddings [77.34726150561087]
  We propose a set of experiments using a widely-used large-scale data set for relation extraction. We show that different embedding spaces have different degrees of strength for the structural and semantic properties. These results provide useful information for developing embedding-based relation extraction methods.
  arXiv  Detail & Related papers  (2020-09-23T15:45:32Z)
• Syn-QG: Syntactic and Shallow Semantic Rules for Question Generation [49.671882751569534]
  We develop SynQG, a set of transparent syntactic rules which transform declarative sentences into question-answer pairs. We utilize PropBank argument descriptions and VerbNet state predicates to incorporate shallow semantic content. In order to improve syntactic fluency and eliminate grammatically incorrect questions, we employ back-translation over the output of these syntactic rules.
  arXiv  Detail & Related papers  (2020-04-18T19:57:39Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.