Papers with GrailQA

11 papers
FC-KBQA: A Fine-to-Coarse Composition Framework for Knowledge Base Question Answering (2023.acl-long)

Copied to clipboard

Challenge: Existing methods for question answering over knowledge bases (KBQA) suffer from generalization issues due to coarse-grained modeling of the logical expression.
Approach: They propose a fine-to- coarse-grained framework for KBQA to ensure generalization and executability of the logical expression.
Outcome: The proposed framework derives new state-of-the-art performance on GrailQA and WebQSP, and runs 4 times faster than baseline.
Bring Your Own KG: Self-Supervised Program Synthesis for Zero-Shot KGQA (2024.findings-naacl)

Copied to clipboard

Challenge: a universal question-answering system that can operate on any knowledge graph is presented . previous work that relied on training data to query structured data stores is unrealistic .
Approach: They propose a universal question-answering system that can operate on any knowledge graph . they use an LLM-backed symbolic agent to generate query-program exemplars .
Outcome: The proposed system outperforms state-of-the-art model on domain-specific KGs by 7.08 F1 . the proposed system can be ready to use within a day, the authors show .
Subgraph-Guided Executable Logical Form Generation for Knowledge Base Question Answering (2026.findings-acl)

Copied to clipboard

Challenge: Existing retrieval-augmented approaches focus on ignoring the structural information of the Knowledge Base (KB) and the question.
Approach: They propose a structure-aware subgraph retrieval stage that ranks candidate subgraphs by aligning them with the question’s structure, along with semantic relevance.
Outcome: Experiments on GrailQA, WebQSP, and GraphQuestions show that the proposed framework achieves state-of-the-art performance.
QueryAgent: A Reliable and Efficient Reasoning Framework with Environmental Feedback based Self-Correction (2024.acl-long)

Copied to clipboard

Challenge: Existing methods for semantic parsing fail when hallucinations are encountered . QueryAgent solves a question step-by-step and performs stepwise self-correction .
Approach: They propose a framework that solves a query step-by-step and performs stepwise self-correction.
Outcome: The proposed framework outperforms existing methods on GrailQA and GraphQ by 5.7 and 15.0 points.
Few-shot In-context Learning on Knowledge Base Question Answering (2023.acl-long)

Copied to clipboard

Challenge: KB-BINDER enables few-shot in-context learning over knowledge base questions . KBQA is a difficult problem due to the heterogeneity of knowledge bases .
Approach: They propose a framework that enables few-shot in-context learning over KBQA tasks.
Outcome: The proposed framework can outperform state-of-the-art models on GraphQA and MetaQA datasets.
GraphQ IR: Unifying the Semantic Parsing of Graph Query Languages with One Intermediate Representation (2022.emnlp-main)

Copied to clipboard

Challenge: Existing approaches to neural semantic parsing are limited by the semantic gap between natural and formal languages.
Approach: They propose a unified intermediate representation for graph query languages, named GraphQ IR, which has a natural-language-like expression that bridges the semantic gap and formally defined syntax that maintains the graph structure.
Outcome: The proposed representation can convert user queries into graphQ IR, which can later be losslessly compiled into various downstream graph query languages.
RNG-KBQA: Generation Augmented Iterative Ranking for Knowledge Base Question Answering (2022.acl-long)

Copied to clipboard

Challenge: Existing KBQA approaches struggle with generalization of unseen KB schema items . Rank-and-generate approach solves coverage issue with strong generalization .
Approach: They propose a Rank-and-Generate approach for KBQA that uses a generation model to generalize to unseen KB schema items.
Outcome: The proposed approach outperforms the prior state-of-the-art on GrailQA and WebQSP datasets.
TIARA: Multi-grained Retrieval for Robust Question Answering over Large Knowledge Base (2022.emnlp-main)

Copied to clipboard

Challenge: KBQA is a challenging area for pre-trained language models due to its extensive space and complexity.
Approach: They propose a model that uses multi-grained retrieval to focus on most relevant KB contexts . constrained decoding is used to control output space and reduce generation errors .
Outcome: The proposed model outperforms existing models on GrailQA and WebQuestionsSP.
Do I have the Knowledge to Answer? Investigating Answerability of Knowledge Base Questions (2023.acl-long)

Copied to clipboard

Challenge: missing facts, incomplete schema and limited scope lead to many questions being unanswerable.
Approach: They propose to adapt a KBQA dataset with unanswerable questions to detect missing facts and incomplete schema.
Outcome: The proposed model performs poorly even after adaptation for unanswerable questions.
Augmenting Reasoning Capabilities of LLMs with Graph Structures in Knowledge Base Question Answering (2024.findings-emnlp)

Copied to clipboard

Challenge: Recent work uses Large Language Models (LLMs) for semantic parsing to address Knowledge Base Question Answering tasks.
Approach: They propose a framework that augments reasoning capabilities of LLMs with Graph Structures in Knowledge Base Question Answering to retrieve question-related graph structures.
Outcome: The proposed framework outperforms existing methods on GrailQA and WebQSP under the few-shot setting.
SAFE: Schema-Driven Approximate Distance Join for Efficient Knowledge Graph Querying (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods map an LLM-generated query graph onto the KG or let the LLM traverse the entire graph.
Approach: They propose a framework that leverages schema graphs for robust query graph generation and efficient KG retrieval.
Outcome: Extensive experiments on WebQSP, CWQ and GrailQA show that the proposed framework outperforms state-of-the-art methods in accuracy and efficiency.

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