Challenge: Existing methods relying on unidirectional query expansion fail to bridge lexical mismatches and graph-based approaches struggle to navigate schemas when explicit structural links are missing.
Approach: They propose a retrieval framework that bridges the semantic gap between user queries and vague schema definitions by performing online generative query expansion.
Outcome: The proposed retrieval framework bridges the semantic gap between user queries and vague schema definitions by enriching table schemas offline and performing online generative query expansion.

Similar Papers

ExpandR: Teaching Dense Retrievers Beyond Queries with LLM Guidance (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for enhancing dense retrieval with query augmentation ignore the alignment between generation and ranking objectives.
Approach: They propose a unified LLM-augmented dense retrieval framework that jointly optimizes both the LLM and the retriever.
Outcome: Experimental results show that ExpandR outperforms strong baselines, achieving more than 5% improvement in retrieval performance.
SchemaGraphSQL: Efficient Schema Linking with Pathfinding Graph Algorithms for Text-to-SQL on Large-Scale Databases (2026.findings-eacl)

Copied to clipboard

Challenge: Text-to-SQL systems translate natural language questions into executable SQL queries.
Approach: They propose a schema linking approach that first constructs a graph based on foreign key relations and then uses a single prompt to a lightweight LLM to extract source and destination tables from the user query.
Outcome: The proposed method outperforms specialized, fine-tuned, and complex multi-step approaches on BIRD and Spider 2.0 benchmarks.
Rethinking Schema Linking: A Context-Aware Bidirectional Retrieval Approach for Text-to-SQL (2026.findings-eacl)

Copied to clipboard

Challenge: Recent methods focus on improving SQL generation but neglect retrieval of relevant schema elements.
Approach: They propose a context-aware bidirectional schema retrieval framework that treats schema linking as a standalone problem.
Outcome: The proposed framework improves schema recall while reducing false positives.
Gen-SQL: Efficient Text-to-SQL By Bridging Natural Language Question And Database Schema With Pseudo-Schema (2025.coling-main)

Copied to clipboard

Challenge: Recent studies have shifted paradigms and leveraged Large Language Models (LLMs) to tackle the challenging task of Text-to-SQL.
Approach: They propose a framework that leverages large language models to generate SQL queries . they exploit prior knowledge from the LLM to enhance embedding-based retriever .
Outcome: The proposed method improves embedding-based retriever and reduces cost.
Query2doc: Query Expansion with Large Language Models (2023.emnlp-main)

Copied to clipboard

Challenge: Existing methods for sparse and dense retrieval have limited success on popular datasets.
Approach: They propose a query expansion approach that generates pseudo-documents by few-shot prompting large language models and then expands the query with generated pseudo-docs.
Outcome: The proposed method boosts the performance of BM25 on ad-hoc IR datasets by 3% to 15% without any model fine-tuning.
Knowledge-Aware Query Expansion with Large Language Models for Textual and Relational Retrieval (2025.naacl-long)

Copied to clipboard

Challenge: Existing methods to generate query expansions focus on enhancing textual similarities between search queries and document corpus, overlooking document relations.
Approach: They propose a knowledge-aware query expansion framework augmenting LLMs with structured document relations from knowledge graph (KG) they leverage document texts as rich KG node representations and use document-based relation filtering for their method.
Outcome: The proposed framework augments LLMs with structured document relations from knowledge graph (KG) Extensive experiments on three datasets of diverse domains show the advantages compared against state-of-the-art methods on textual and relational semi-structured retrieval.
Solid-SQL: Enhanced Schema-linking based In-context Learning for Robust Text-to-SQL (2025.coling-main)

Copied to clipboard

Challenge: Existing text-to-SQL approaches have overlooked the critical aspect of system robustness.
Approach: They propose a robust text-to-SQL solution that integrates with LLMs . their method achieves SOTA SQL execution accuracy levels of 82.1% and 58.9% .
Outcome: The proposed solution achieves SOTA SQL execution accuracy levels of 82.1% and 58.9% on the general Spider and Bird benchmarks.
BiBL: AMR Parsing and Generation with Bidirectional Bayesian Learning (2022.coling-1)

Copied to clipboard

Challenge: Existing approaches to AMR focus on one-side improvements despite the duality of the two tasks . instead, we propose data-efficient Bidirectional Bayesian learning (BiBL) to facilitate bidirectional information transition.
Approach: They propose a data-efficient bidirectional Bayesian learning approach to facilitate bidirectional information transition by adopting a single-stage multitasking strategy.
Outcome: The proposed model outperforms existing models on benchmark datasets without extra training data.
LinkAlign: Scalable Schema Linking for Real-World Large-Scale Multi-Database Text-to-SQL (2025.emnlp-main)

Copied to clipboard

Challenge: Existing Text-to-SQL models fail to address schema linking problems in large-scale multi-database environments.
Approach: They propose a framework that aims to enable non-expert users to retrieve data effortlessly . they highlight four core errors leading to schema linking failures .
Outcome: The proposed framework outperforms baselines on all schema linking metrics.
Bridging the Generalization Gap in Text-to-SQL Parsing with Schema Expansion (2022.acl-long)

Copied to clipboard

Challenge: Existing text-to-SQL parsers struggle with out-of-domain generalization problems, arguing that they lack the ability to match domain specific phrases to composite operations over columns.
Approach: They propose to use a synthetic dataset and a re-purposed train/test split to quantify out-of-domain generalization over column operations to address this problem.
Outcome: The proposed method outperforms baseline parsers on the domain generalization problem, while boosting the underlying parser’ overall performance by 13.8% relative accuracy gain (5.1% absolute).

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