| Challenge: | Knowledge graph based simple question answering is a major area of research in question answering. |
| Approach: | They propose a framework to describe and analyze existing knowledge graph based simple question answering approaches. |
| Outcome: | The proposed model achieves a state-of-the-art (85.44% accuracy) on the SimpleQuestions dataset. |
Similar Papers
Strong Baselines for Simple Question Answering over Knowledge Graphs with and without Neural Networks (N18-2)
Copied to clipboard
| Challenge: | Existing work on simple question answering over knowledge graphs involves increasingly complex NN architectures. |
| Approach: | They propose to decompose the problem into entity detection, entity linking, relation prediction, evidence combination and heuristics. |
| Outcome: | The proposed approach outperforms existing models and benchmarks on a simple QA task. |
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. |
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. |
Subgraph Retrieval Enhanced Model for Multi-hop Knowledge Base Question Answering (2022.acl-long)
Copied to clipboard
| Challenge: | Existing retrieval methods for knowledge base question answering are either heuristic or interwoven with the reasoning, causing reasoning on the partial subgraphs. |
| Approach: | They propose a subgraph retrieval framework that decouples the retrieval from the subsequent reasoning process and trains subgraphs for easier reasoning. |
| Outcome: | The proposed framework improves retrieval and QA performance over existing methods. |
Graph Reasoning for Question Answering with Triplet Retrieval (2023.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to answer complex questions require reasoning over knowledge graphs (KGs) state-of-the-art methods constrain retrieved knowledge in local subgraphs and discard more diverse triplets that are disconnected but useful for question answering. |
| Approach: | They propose a method to retrieve the most relevant triplets from KGs and then rerank them, which are then concatenated with questions to be fed into language models. |
| Outcome: | The proposed method outperforms state-of-the-art methods on commonsenseQA and OpenbookQA datasets with 4.6% absolute accuracy. |
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. |
Retrieval, Re-ranking and Multi-task Learning for Knowledge-Base Question Answering (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing work on question answering over knowledge bases limited the search space to a subset of KBs . a retrieval-and-rerank framework is used to access KB and rerank retrieved candidates with more powerful neural networks. |
| Approach: | They propose to share a BERT encoder across all three sub-tasks and define task-specific layers on top of the shared layer. |
| Outcome: | The proposed method improves accuracy and accuracy on the SimpleQuestions dataset and the FreebaseQA dataset. |
Graph-augmented Learning to Rank for Querying Large-scale Knowledge Graph (2022.aacl-main)
Copied to clipboard
| Challenge: | Existing knowledge graph question answering methods only search for the answer in a large knowledge graph. |
| Approach: | They propose to partition retrieved knowledge subgraphs into smaller sub-KSGs and then use a graph-augmented learning to rank method to select the top-ranked sub-kSGs. |
| Outcome: | The proposed method can capture global interactions in question and subgraphs and local interactions on the full KSG and top-ranked sub-KSGs respectively. |
Pattern-revising Enhanced Simple Question Answering over Knowledge Bases (C18-1)
Copied to clipboard
| Challenge: | Simple question answering over knowledge bases is one of the most important natural language processing tasks. |
| Approach: | They propose to conduct pattern extraction and entity linking first and put forward pattern revising procedure to mitigate the error propagation problem. |
| Outcome: | The proposed method outperforms the current state-of-the-art in this task by an absolute large margin. |
Knowledge Base Question Answering through Recursive Hypergraphs (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing methods for Knowledge Base Question Answering (KBQA) do not explicitly incorporate the recursive relational group structure in the given knowledge base. |
| Approach: | They propose a method to model KBs through recursive hypergraphs using hypergraph data. |
| Outcome: | The proposed method is based on recursive hypergraphs and has been released on multiple benchmarks. |