Modeling Semantics with Gated Graph Neural Networks for Knowledge Base Question Answering (C18-1)
Copied to clipboard
| Challenge: | Existing approaches to Knowledge Base Question Answering focus on semantic parsing . previous work focused on selecting the correct semantic relations and not on the structure of the semantic parses . |
| Approach: | They propose to use Gated Graph Neural Networks to encode the graph structure of the semantic parse. |
| Outcome: | The proposed approach outperforms baseline models that do not explicitly model the structure. |
Similar Papers
Semantic Parsing for Conversational Question Answering over Knowledge Graphs (2023.eacl-main)
Copied to clipboard
| Challenge: | Recent years have seen an increasing number of applications aiming to build conversational interfaces based on information retrieval and user recommendation. |
| Approach: | They develop a dataset where user questions are annotated with Sparql parses and system answers correspond to execution results thereof. |
| Outcome: | The proposed parsers can be used to ground questions into queries over definitions in a knowledge graph with large vocabularies. |
A Semantics-aware Transformer Model of Relation Linking for Knowledge Base Question Answering (2021.acl-short)
Copied to clipboard
Tahira Naseem, Srinivas Ravishankar, Nandana Mihindukulasooriya, Ibrahim Abdelaziz, Young-Suk Lee, Pavan Kapanipathi, Salim Roukos, Alfio Gliozzo, Alexander Gray
| Challenge: | Existing knowledge base question answering systems do not leverage the explicit semantic parse of the question text. |
| Approach: | They propose a transformer-based neural model that leverages the AMR semantic parse of a sentence. |
| Outcome: | The proposed model outperforms the state-of-the-art on 4 popular benchmark datasets. |
Conversational Question Answering over Knowledge Graphs with Transformer and Graph Attention Networks (2021.eacl-main)
Copied to clipboard
| Challenge: | Existing knowledge graphs are widely used for (complex) conversational question answering . LASAGNE improves the F1-score on eight out of ten question types . |
| Approach: | They propose a multi-task neural semantic parsing approach for (complex) conversational question answering over a knowledge graph using a transformer model and a Graph Attention Networks model. |
| Outcome: | The proposed approach outperforms baselines on eight out of ten question types on a standard dataset for complex sequential question answering. |
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. |
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. |
A Graph-Based Neural Model for End-to-End Frame Semantic Parsing (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing studies focus on frame semantic parsing as a graph construction problem. |
| Approach: | They propose an end-to-end neural model to tackle frame semantic parsing jointly. |
| Outcome: | The proposed model is highly competitive and performs better than pipeline models on two benchmark datasets. |
Graph-to-Sequence Learning using Gated Graph Neural Networks (P18-1)
Copied to clipboard
| Challenge: | Existing approaches to graph-to-sequence learning ignore the full graph structure, discarding key information. |
| Approach: | They propose a graph-to-sequence learning model that encodes the full graph structure and an input transformation that allows nodes and edges to have their own hidden representations. |
| Outcome: | The proposed model outperforms baselines in generation from AMR graphs and syntax-based neural machine translation while retaining the full graph structure. |
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. |
Question Answering by Reasoning Across Documents with Graph Convolutional Networks (N19-1)
Copied to clipboard
| Challenge: | Recent research in reading comprehension has focused on answering questions based on individual documents or even single paragraphs. |
| Approach: | They propose a neural model which integrates and reasons relying on information spread within documents and across multiple documents. |
| Outcome: | The proposed model achieves state-of-the-art on a multi-document question answering dataset, WikiHop. |
Graph-to-Tree Neural Networks for Learning Structured Input-Output Translation with Applications to Semantic Parsing and Math Word Problem (2020.findings-emnlp)
Copied to clipboard
| Challenge: | Graph2Tree model encodes graph-structured input and decodes tree-structures output. |
| Approach: | They propose a novel Graph-to-Tree Neural Network consisting of a graph encoder and a hierarchical tree decoder that encodes an augmented graph-structured input and decodes a tree-structure-output. |
| Outcome: | The proposed model outperforms or matches the performance of other state-of-the-art models on two problems, neural semantic parsing and math word problem. |