Semantic Structure Based Query Graph Prediction for Question Answering over Knowledge Graph (2022.coling-1)
Copied to clipboard
| Challenge: | Existing approaches for query graph generation ignore the semantic structure of a question . Existing methods ignore the structure of the question, resulting in noisy query graph candidates. |
| Approach: | They propose to build query graphs from natural language questions to predict semantic structure of a question. |
| Outcome: | The proposed method can predict the semantic structure of a question using six semantic structures from common questions in KGQA. |
Similar Papers
Improving Query Graph Generation for Complex Question Answering over Knowledge Base (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing Knowledge-based Question Answering methods use a query graph to find the answer to a question. |
| Approach: | They propose a method that starts with the entire knowledge base and gradually shrinks it to the desired query graph. |
| Outcome: | Experimental results show that the proposed method achieves state-of-the-art performance on ComplexWebQuestion dataset. |
Augmenting Reasoning Capabilities of LLMs with Graph Structures in Knowledge Base Question Answering (2024.findings-emnlp)
Copied to clipboard
Yuhang Tian, Dandan Song, Zhijing Wu, Changzhi Zhou, Hao Wang, Jun Yang, Jing Xu, Ruanmin Cao, HaoYu Wang
| Challenge: | Recent work uses Large Language Models (LLMs) for semantic parsing to address Knowledge Base Question Answering tasks. |
| Approach: | They propose a framework that augments reasoning capabilities of LLMs with Graph Structures in Knowledge Base Question Answering to retrieve question-related graph structures. |
| Outcome: | The proposed framework outperforms existing methods on GrailQA and WebQSP under the few-shot setting. |
Question-guided Knowledge Graph Re-scoring and Injection for Knowledge Graph Question Answering (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Knowledge graph question answering (KGQA) aims to provide factual answers to natural language questions by leveraging structured information stored in a knowledge graph. |
| Approach: | They propose a Question-guided Knowledge Graph Re-scoring method to eliminate noisy pathways for the input question, thereby focusing specifically on pertinent factual knowledge. |
| Outcome: | The proposed method eliminates noisy pathways for the input question, thereby focusing specifically on pertinent factual knowledge. |
Query Graph Generation for Answering Multi-hop Complex Questions from Knowledge Bases (2020.acl-main)
Copied to clipboard
| Challenge: | Existing work on complex knowledge base question answering addresses two types of complexity at the same time. |
| Approach: | They propose a modified staged query graph generation method that handles both types of complexity at the same time. |
| Outcome: | The proposed method achieves state-of-the-art on three benchmark KBQA datasets. |
Structure-aware Knowledge Graph-to-text Generation with Planning Selection and Similarity Distinction (2023.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods to generate knowledge graph-to-text (KG-to) text rely on pre-trained language models to bridge the gap between the different structures of the input KG and the target text. |
| Approach: | They propose a method that integrates graph structure-aware modules with pre-trained language models to capture the intricate topology information present in the KG. |
| Outcome: | The proposed model captures the topology information present in the knowledge graph and distinguishes similar input KGs through contrastive learning techniques. |
From Phrases to Subgraphs: Fine-Grained Semantic Parsing for Knowledge Graph Question Answering (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing approaches to knowledge graph question answering (KGQA) face semantic misalignment and reasoning noise. |
| Approach: | They propose a fine-grained semantic parsing framework for KGQA that maps natural language queries to executable logical forms. |
| Outcome: | The proposed framework achieves 18.5% performance improvement over the SOTA on a multi-hop CWQ dataset. |
Knowledge Base Question Answering via Encoding of Complex Query Graphs (D18-1)
Copied to clipboard
| Challenge: | Existing KBQA methods focus on simpler questions and do not work well on complex questions . a knowledge-based question answering approach is able to answer complex questions using a standard knowledge base . |
| Approach: | They propose to encode query structure into a uniform vector representation of a question and its semantic components into . |
| Outcome: | The proposed approach outperforms existing methods on complex questions while staying competitive on simple questions. |
ReasoningLM: Enabling Structural Subgraph Reasoning in Pre-trained Language Models for Question Answering over Knowledge Graph (2023.emnlp-main)
Copied to clipboard
| Challenge: | Question Answering over Knowledge Graph (KGQA) aims to find answer entities for natural language questions based on knowledge graphs. |
| Approach: | They propose a subgraph-aware self-attention mechanism to imitate the graph neural network (GNN) based module to perform multi-hop reasoning on KG. |
| Outcome: | The proposed method surpasses state-of-the-art models by a large margin even with fewer updated parameters and less training data. |
Enhancing Complex Reasoning in Knowledge Graph Question Answering through Query Graph Approximation (2025.findings-acl)
Copied to clipboard
| Challenge: | Existing knowledge-grounded question answering frameworks lack essential triplets related to the questions . Existing approaches to knowledge-based QA are incomplete in the context of KGs . |
| Approach: | They propose a framework to provide answers to structured queries by leveraging Knowledge Graphs. |
| Outcome: | The proposed framework outperforms existing methods on QA tasks where KGs are incomplete . the framework is based on a set of data from a dataset of QA questions . |
Constraint-based Multi-hop Question Answering with Knowledge Graph (2022.naacl-industry)
Copied to clipboard
| Challenge: | Recent work addresses multi-hop KGQA, which requires reasoning across numerous edges of the KG. |
| Approach: | They propose to use KG embeddings to reduce KG sparsity by performing missing link prediction. |
| Outcome: | Empirical results show that the proposed method produces state-of-the-art results on three KGQA datasets. |