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.

Similar Papers

Relation-Aware Question Answering for Heterogeneous Knowledge Graphs (2023.findings-emnlp)

Copied to clipboard

Challenge: Existing retrieval-based approaches to solve multihop Knowledge Base Question Answering (KBQA) fail to utilize information from head-tail entities and the semantic connection between relations to enhance the information capturing of relations in KGs.
Approach: They propose to use a dual relation graph to find the answer entity in a knowledge graph . they use primal entity graph reasoning, dual relation grafitment and interaction .
Outcome: The proposed approach achieves significant performance gain over the prior state-of-the-art on two public datasets, WebQSP and CWQ.
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.
Scalable Multi-Hop Relational Reasoning for Knowledge-Aware Question Answering (2020.emnlp-main)

Copied to clipboard

Challenge: Existing work on augmenting question answering models with external knowledge (e.g., knowledge graphs) lacks transparency into the model’s prediction rationale.
Approach: They propose a knowledge-aware approach that equips pre-trained language models with a multi-hop relational reasoning module that performs multi-relational reasoning over subgraphs extracted from external knowledge graphs.
Outcome: The proposed model performs multi-hop, multi-relational reasoning over subgraphs extracted from external knowledge graphs.
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.
Improving Multi-hop Logical Reasoning in Knowledge Graphs with Context-Aware Query Representation Learning (2024.findings-acl)

Copied to clipboard

Challenge: Existing methods rely on linear sequential operations to solve First-Order Logic queries.
Approach: They propose a model-agnostic approach that fully integrates the context of the query graph.
Outcome: The proposed method improves performance on two datasets by 19.5%.
Exploiting Explicit Paths for Multi-hop Reading Comprehension (P19-1)

Copied to clipboard

Challenge: Existing approaches to multi-hop reading comprehension do not include multiple sentences or passages.
Approach: They propose a path-based reasoning approach for a multi-hop reading comprehension task . they propose to extract paths from text and compose them to encode them .
Outcome: The proposed model outperforms previous models on the multi-hop Wikihop dataset and can be generalized to the OpenBookQA dataset.
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.
TransferNet: An Effective and Transparent Framework for Multi-hop Question Answering over Relation Graph (2021.emnlp-main)

Copied to clipboard

Challenge: Existing models infer the answer by predicting the sequential relation path or aggregating the hidden graph features.
Approach: They propose a model which jumps between entities at multiple steps . they demonstrate that TransferNet surpasses state-of-the-art models by a large margin .
Outcome: The proposed model surpasses state-of-the-art models on MetaQA and on other datasets.
HOLMES: Hyper-Relational Knowledge Graphs for Multi-hop Question Answering using LLMs (2024.acl-long)

Copied to clipboard

Challenge: Existing approaches to answer multi-hop questions are query-agnostic and the extracted facts are ambiguous as they lack context.
Approach: They propose to use a knowledge graph to extract query-relevant information from unstructured text.
Outcome: The proposed method achieves performance improvements on two popular datasets.
A Multi-label Multi-hop Relation Detection Model based on Relation-aware Sequence Generation (2021.findings-emnlp)

Copied to clipboard

Challenge: Existing methods treat multi-label learning problem as a single label . Existing approaches focus on measuring semantic similarity of questions and candidate relations .
Approach: They propose to solve multi-hop relation detection problem by generating sequences of hops and labels.
Outcome: The proposed method is effective in KBQA, despite the unknown number of labels and hops.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations