Challenge: Existing methods for complex question answering have some limitations . existing methods employ predefined patterns or templates to understand complex questions.
Approach: They propose a state transition-based approach to translate a natural language question to a semantic query graph.
Outcome: The proposed approach outperforms state-of-the-art methods on several benchmarks with two knowledge bases.

Similar Papers

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.
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 Transition-based Method for Complex Question Understanding (2022.coling-1)

Copied to clipboard

Challenge: Existing work on complex question understanding does not model intermediate states and does not provide step-wise information.
Approach: They propose a transition-based method where a decider predicts a sequence of actions to build the graph node-by-node.
Outcome: The proposed method parses complex questions to QDMR using atomic operators . it has transparent and human-readable intermediate results, showing improved interpretability .
Enhancing Complex Reasoning in Knowledge Graph Question Answering through Query Graph Approximation (2025.findings-acl)

Copied to clipboard

Challenge: Existing knowledge-grounded question answering frameworks lack essential triplets related to the questions . Existing approaches to knowledge-based QA are incomplete in the context of KGs .
Approach: They propose a framework to provide answers to structured queries by leveraging Knowledge Graphs.
Outcome: The proposed framework outperforms existing methods on QA tasks where KGs are incomplete . the framework is based on a set of data from a dataset of QA questions .
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.
The Web as a Knowledge-Base for Answering Complex Questions (N18-1)

Copied to clipboard

Challenge: Recent work on reading comprehension made headway in answering simple questions, but tackling complex questions is still an ongoing research challenge.
Approach: They propose to decompose complex questions into a sequence of simple questions and compute the final answer from the sequence of answers.
Outcome: The proposed framework improves performance from 20.8 precision@1 to 27.5 precision@1.
Improving Complex Knowledge Base Question Answering via Question-to-Action and Question-to-Question Alignment (2022.emnlp-main)

Copied to clipboard

Challenge: ALCQA addresses the semantic and structural gap between natural language and action sequences . a priori, the semantics of the question and action are not well understood .
Approach: They propose an alignment-enhanced complex question answering framework which aligns questions and actions into sequences.
Outcome: The proposed framework outperforms state-of-the-art methods on a CQA and WQSP dataset.
A System for Answering Simple Questions in Multiple Languages (2023.acl-demo)

Copied to clipboard

Challenge: Existing knowledge graph question answering systems are limited to simple questions, but they can be used to answer complex questions.
Approach: They propose a multilingual Knowledge Graph Question Answering technique that orders potential responses based on the distance between the question’s text embeddings and the answer’s graph embedds.
Outcome: The proposed method consistently outperforms baseline systems, including seq2seq QA models and complex rule-based pipelines.
DIVKNOWQA: Assessing the Reasoning Ability of LLMs via Open-Domain Question Answering over Knowledge Base and Text (2024.findings-naacl)

Copied to clipboard

Challenge: Retrievalaugmented LLMs have been used to ground LLM in external knowledge . a gap exists in the current landscape regarding the effectiveness of grounding LLM on heterogeneous knowledge sources.
Approach: They propose a model that uses symbolic language to generate symbolic queries . they use a dataset that is generated using predefined reasoning chains and human annotation .
Outcome: The proposed model outperforms previous approaches by a significant margin in QA tasks over text.
Semantic Structure Based Query Graph Prediction for Question Answering over Knowledge Graph (2022.coling-1)

Copied to clipboard

Challenge: Existing approaches for query graph generation ignore the semantic structure of a question . Existing methods ignore the structure of the question, resulting in noisy query graph candidates.
Approach: They propose to build query graphs from natural language questions to predict semantic structure of a question.
Outcome: The proposed method can predict the semantic structure of a question using six semantic structures from common questions in KGQA.

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