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. |
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. |
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. |
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. |
Improving Multi-hop Question Answering over Knowledge Graphs using Knowledge Base Embeddings (2020.acl-main)
Copied to clipboard
| Challenge: | Existing multi-hop KGQA methods impose heuristic neighborhood limits, which often make it much harder to answer the input NL question. |
| Approach: | They propose to use knowledge Graphs (KG) to answer natural language queries over the KG. |
| Outcome: | The proposed method is particularly effective in performing multi-hop KGQA over sparse KGs. |
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 . |
Exploiting Hybrid Semantics of Relation Paths for Multi-hop Question Answering over Knowledge Graphs (2022.coling-1)
Copied to clipboard
| Challenge: | Existing approaches to answer natural language questions on knowledge graphs (KGQA) use large-scale entity-related text corpus or knowledge graph embeddings as auxiliary information to facilitate answer selection. |
| Approach: | They propose to integrate explicit textual information and implicit KG structural features of relation paths into a novel rotate-and-scale entity link prediction framework. |
| Outcome: | The proposed method is superior to existing methods on three KGQA datasets and shows that it can be used to identify answer entities. |
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. |
Towards Graph-hop Retrieval and Reasoning in Complex Question Answering over Textual Database (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing benchmarks for textual question answering only focus on single-chain or single-hop retrieval . Existing approaches to answer complex questions have limitations . |
| Approach: | They propose to conduct Graph-Hop, a novel multi-chains and multi-hops retrieval paradigm in complex question answering. |
| Outcome: | The proposed model provides explicit and fine-grained evidence graphs for complex question to support comprehensive and detailed reasoning. |
RUBY: An Effective Framework for Multi-Constraint Multi-Hop Question Generation (2025.acl-long)
Copied to clipboard
| Challenge: | Existing frameworks for multi-hop question generation lack high-dimensional semantic constraints. |
| Approach: | They propose a framework which incorporates constraints into every hop of a multi-hop question . they propose dimensional constraint dimension reduction and divide-and-conquer-based dynamic projection . |
| Outcome: | The proposed framework outperforms baseline models in capturing and integrating constraints . it reduces randomness with added constraints, leading to more focused questions and fewer hop errors . |
CQG: A Simple and Effective Controlled Generation Framework for Multi-hop Question Generation (2022.acl-long)
Copied to clipboard
| Challenge: | Current models can not ensure the complexity of generated questions, so they may generate shallow questions that can be answered without multi-hop reasoning. |
| Approach: | They propose a controlled framework to generate multi-hop questions that contain key entities in multi- hop reasoning chains and a novel Transformer-based decoder to guarantee that key entities appear in the questions. |
| Outcome: | The proposed model outperforms the state-of-the-art model 25% on HotpotQA. |