Implicit Relation Linking for Question Answering over Knowledge Graph (2022.findings-acl)
Copied to clipboard
| Challenge: | Existing methods rely on textual similarities between NL and KG to build relation links. |
| Approach: | They propose an implicit relation linking method called ImRL which links relation phrases in NL to relation paths in KG. |
| Outcome: | The proposed method significantly outperforms state-of-the-art methods on two benchmarks and a newly-created datasets. |
Similar Papers
Inferring Implicit Relations in Complex Questions with Language Models (2022.findings-emnlp)
Copied to clipboard
| Challenge: | A prominent challenge for language understanding systems is the ability to answer implicit reasoning questions where the evidence for answering the question is not mentioned explicitly. |
| Approach: | They propose to decouple inference of reasoning steps from execution by evaluating models of implicit relation inference. |
| Outcome: | The proposed model fails on the implicit reasoning QA task, but infers implicit relations . the proposed model is compared with other models that fail on the same task . |
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. |
Large-Scale Relation Learning for Question Answering over Knowledge Bases with Pre-trained Language Models (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing KBQA methods focus on the natural language but ignore textual information carried by the nodes and edges. |
| Approach: | They propose to perform relation extraction, relation matching, and relation reasoning tasks to align the natural language expressions to the relations in the KB and reason over the missing connections. |
| Outcome: | Experiments on WebQSP show that the proposed model outperforms baselines even when the KB is incomplete. |
Enhancing Contextual Word Representations Using Embedding of Neighboring Entities in Knowledge Graphs (2022.coling-1)
Copied to clipboard
| Challenge: | Existing methods for pre-trained language models lack explicit grounding in real-world entities. |
| Approach: | They propose a mechanism that integrates the structure of a KG into recent PLM architectures by generalizing the embeddings of neighboring entities. |
| Outcome: | The proposed method improves a classification task, entity typing task and language comprehension tasks. |
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. |
Does Pre-trained Language Model Actually Infer Unseen Links in Knowledge Graph Completion? (2024.naacl-long)
Copied to clipboard
| Challenge: | Knowledge Graph Completion (KGC) is a task that infers unseen relationships between entities . traditional embedding-based methods infer missing links using only training data . a pre-trained language model (PLM)-based KGC may be ineffective in practical applications . |
| Approach: | They propose to use knowledge Graph Completion (KGC) to infer unseen relationships . traditional embedding-based KGC methods infer missing links only from training data . they argue that pre-trained language models acquire inference abilities through pre-training . |
| Outcome: | The proposed method improves performance even though it does not use memorized knowledge. |
Structure-Aware Zero-Shot Relational Learning for Knowledge Graphs without External Knowledge (2026.findings-acl)
Copied to clipboard
| Challenge: | Existing methods for Zero-shot Relational Learning depend on external knowledge, resulting in increased annotation costs and limited practical applicability. |
| Approach: | They propose a structure-aware paradigm that performs ZRL without external knowledge . it leverages intrinsic structural patterns in KGs to bridge semantic correlations for new relations with existing ones. |
| Outcome: | The proposed paradigm achieves 10.66% improvement in MRR while reducing annotation costs and enhancing practical applicability on three real-world benchmarks. |
OKGIT: Open Knowledge Graph Link Prediction with Implicit Types (2021.findings-acl)
Copied to clipboard
| Challenge: | Open Knowledge Graphs (OpenKGs) are sparse and not directly usable in an end task. |
| Approach: | They propose a method that bootstraps OpenKGs from a corpus using OpenIE tools. |
| Outcome: | The proposed method achieves state-of-the-art performance while producing type compatible NPs in the link prediction task. |
CSAGN: Conversational Structure Aware Graph Network for Conversational Semantic Role Labeling (2021.emnlp-main)
Copied to clipboard
| Challenge: | Existing CSRL parsers struggle to handle conversational structural information. |
| Approach: | They propose a conversational semantic role labeling task which explicitly encodes speaker dependent information and proposes a multi-task learning method to further improve the model. |
| Outcome: | The proposed model outperforms baselines on benchmark datasets on conversation-based tasks. |
Context Tracking Network: Graph-based Context Modeling for Implicit Discourse Relation Recognition (2021.naacl-main)
Copied to clipboard
| Challenge: | Existing models fail to fully utilize contextual information which plays an important role in interpreting sentences. |
| Approach: | They propose a graph-based Context Tracking Network to model the discourse context for IDRR. |
| Outcome: | The proposed model can integrate sentence-level and token-level contextual semantics better than existing models. |