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. |
Similar Papers
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. |
Semantic Linking in Convolutional Neural Networks for Answer Sentence Selection (D18-1)
Copied to clipboard
| Challenge: | Recent NLP approaches that model relations between text use complex architectures and attention. |
| Approach: | They propose to use labelled data to model semantic relations between two pieces of text . they use word representations to encode matching features directly in the word representation . |
| Outcome: | The proposed approach beats tree kernel models and neural models with similar input encodings while keeping the model simple and fast to train. |
Leveraging Abstract Meaning Representation for Knowledge Base Question Answering (2021.findings-acl)
Copied to clipboard
Pavan Kapanipathi, Ibrahim Abdelaziz, Srinivas Ravishankar, Salim Roukos, Alexander Gray, Ramón Fernandez Astudillo, Maria Chang, Cristina Cornelio, Saswati Dana, Achille Fokoue, Dinesh Garg, Alfio Gliozzo, Sairam Gurajada, Hima Karanam, Naweed Khan, Dinesh Khandelwal, Young-Suk Lee, Yunyao Li, Francois Luus, Ndivhuwo Makondo, Nandana Mihindukulasooriya, Tahira Naseem, Sumit Neelam, Lucian Popa, Revanth Gangi Reddy, Ryan Riegel, Gaetano Rossiello, Udit Sharma, G P Shrivatsa Bhargav, Mo Yu
| Challenge: | Existing approaches face challenges including complex question understanding and lack of large end-to-end training datasets. |
| Approach: | They propose a modular knowledge base question answering system that leverages AMR parses for task-independent question understanding. |
| Outcome: | The proposed system achieves state-of-the-art performance on two prominent KBQA datasets based on DBpedia. |
AMR Parsing with Latent Structural Information (2020.acl-main)
Copied to clipboard
| Challenge: | Abstract Meaning Representations (AMRs) capture sentence-level semantics structural representations to broad-coverage natural sentences. |
| Approach: | They investigate parsing AMR with explicit dependency structures and interpretable latent structures. |
| Outcome: | The proposed model achieves best results on both AMR 2.0 and AMR 1.0 . the proposed model has been adopted in downstream NLP tasks, including text summarization and question answering. |
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. |
AMR-To-Text Generation with Graph Transformer (2020.tacl-1)
Copied to clipboard
| Challenge: | Abstract meaning representation (AMR)-to-text generation is challenging task for natural language processing. |
| Approach: | They propose a graph-to-sequence model that directly encodes AMR graphs and learns node representations. |
| Outcome: | The proposed model outperforms the current state-of-the-art neural approach by 1.5 BLEU points on LDC2015E86 and 4.8 BLUE points on the LDC2017T10 and achieves new state- of-the art performance. |
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. |
Sequence-to-sequence AMR Parsing with Ancestor Information (2022.acl-short)
Copied to clipboard
| Challenge: | Abstract Meaning Representation (AMR) is a graph that encodes the semantic meaning of a sentence. |
| Approach: | They propose several strategies to add important ancestor information into a Transformer Decoder. |
| Outcome: | The proposed methods improve performance for both AMR 2.0 and AMR 3.0 datasets and achieve new state-of-the-art results. |
Uni-Parser: Unified Semantic Parser for Question Answering on Knowledge Base and Database (2022.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches on semantic parsing suffer from exponential growth of logical form candidates and can hardly generalize to unseen data. |
| Approach: | They propose a unified semantic parser for question answering on KB and DB . they define the primitive as the essential element in their framework . |
| Outcome: | The proposed framework can predict logical forms by altering and composing top-ranked primitives with different operations. |
Recognizing Semantic Relations by Combining Transformers and Fully Connected Models (2020.lrec-1)
Copied to clipboard
| Challenge: | Current approaches to recognizing semantic relations between words are limited and require a word-path model. |
| Approach: | They propose a distributional approach that is based on an attention-based transformer and a word path model that combines useful properties of a convolutional network with a fully connected language model. |
| Outcome: | The proposed model outperforms the state-of-the-art in terms of performance and data sources. |