Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
102 tokens/sec
GPT-4o
59 tokens/sec
Gemini 2.5 Pro Pro
43 tokens/sec
o3 Pro
6 tokens/sec
GPT-4.1 Pro
50 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Semantic Framework based Query Generation for Temporal Question Answering over Knowledge Graphs (2210.04490v3)

Published 10 Oct 2022 in cs.CL

Abstract: Answering factual questions with temporal intent over knowledge graphs (temporal KGQA) attracts rising attention in recent years. In the generation of temporal queries, existing KGQA methods ignore the fact that some intrinsic connections between events can make them temporally related, which may limit their capability. We systematically analyze the possible interpretation of temporal constraints and conclude the interpretation structures as the Semantic Framework of Temporal Constraints, SF-TCons. Based on the semantic framework, we propose a temporal question answering method, SF-TQA, which generates query graphs by exploring the relevant facts of mentioned entities, where the exploring process is restricted by SF-TCons. Our evaluations show that SF-TQA significantly outperforms existing methods on two benchmarks over different knowledge graphs.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (4)
  1. Wentao Ding (12 papers)
  2. Hao Chen (1006 papers)
  3. Huayu Li (34 papers)
  4. Yuzhong Qu (30 papers)
Citations (1)

Summary

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