Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Context Transformer with Stacked Pointer Networks for Conversational Question Answering over Knowledge Graphs (2103.07766v2)

Published 13 Mar 2021 in cs.CL

Abstract: Neural semantic parsing approaches have been widely used for Question Answering (QA) systems over knowledge graphs. Such methods provide the flexibility to handle QA datasets with complex queries and a large number of entities. In this work, we propose a novel framework named CARTON, which performs multi-task semantic parsing for handling the problem of conversational question answering over a large-scale knowledge graph. Our framework consists of a stack of pointer networks as an extension of a context transformer model for parsing the input question and the dialog history. The framework generates a sequence of actions that can be executed on the knowledge graph. We evaluate CARTON on a standard dataset for complex sequential question answering on which CARTON outperforms all baselines. Specifically, we observe performance improvements in F1-score on eight out of ten question types compared to the previous state of the art. For logical reasoning questions, an improvement of 11 absolute points is reached.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (5)
  1. Joan Plepi (9 papers)
  2. Endri Kacupaj (10 papers)
  3. Kuldeep Singh (50 papers)
  4. Harsh Thakkar (13 papers)
  5. Jens Lehmann (80 papers)
Citations (22)

Summary

We haven't generated a summary for this paper yet.