Challenge: Empirical results show that a hybrid retrieval approach to table retrieval outperforms state-of-the-art benchmarks.
Approach: They propose a table-tailored HYbrid matching rEtriever which addresses table matching needs from a field-aware hybrid perspective.
Outcome: Empirical results show that the proposed rEtriever outperforms state-of-the-art retrieval methods.

Similar Papers

Is Table Retrieval a Solved Problem? Exploring Join-Aware Multi-Table Retrieval (2024.acl-long)

Copied to clipboard

Challenge: Existing methods for retrieving relevant tables are not sufficient as many questions require retrieving multiple tables and joining them through a join plan that cannot be discerned from the user query itself.
Approach: They propose a method that uncovers useful join relations during table retrieval.
Outcome: The proposed method outperforms the state-of-the-art methods for table retrieval by up to 9.3% in F1 score and for end-to-end QA by up 5.4% in accuracy.
REaR : Retrieve, Expand and Refine for Effective Multitable Retrieval (2026.acl-long)

Copied to clipboard

Challenge: REaR is retriever-agnostic and improves dense/ sparse retrievers on complex table QA datasets.
Approach: a new framework separates semantic relevance from structural joinability for efficient multi-table retrieval. adam scott and eric liu introduce REaR, a three-stage, LLM-free framework.
Outcome: a new framework improves retrieval quality and performance on complex table QA datasets . it separates semantic relevance from structural joinability and prunes weakly related candidates . the framework is retriever-agnostic and delivers performance competitive with state-of-the-art LLM-augmented retrieval systems .
Enhancing SQL Table Acquisition with Reverse Engineering for Text-to-SQL (2025.findings-emnlp)

Copied to clipboard

Challenge: Text-to-SQL oriented table acquisition suffers from heterogeneous semantic gap.
Approach: They propose a Reverse Engineering based table acquisition approach that reversely generates potentially-matched questions conditioned on table schemas instead of forward table search using queries.
Outcome: The proposed approach achieves competitive performance on two benchmarks, including SpiderUnion and BirdUnion.
Retrieve Only Relevant Tables Whether Few or Many: Adaptive Table Retrieval Method (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for retrieving relevant tables from databases are limited by the number of tables required.
Approach: They propose an adaptive table retrieval method that adjusts the number of tables retrieved according to the requirements of each query.
Outcome: Experiments on Spider, BIRD, and Spider 2.0 show that the proposed method improves performance and retrieval and downstream tasks.
Open Domain Question Answering over Tables via Dense Retrieval (2021.naacl-main)

Copied to clipboard

Challenge: Recent advances in open-domain QA focus on retrieving textual passages . a retriever designed to handle tabular context can improve retrieval quality .
Approach: They propose a tabular-based retrieval model that improves retrieval quality over a BERT-based retriever.
Outcome: The proposed retriever improves retrieval quality with mined hard negatives over a BERT-based retriever.
TACR: A Table Alignment-based Cell Selection Method for HybridQA (2023.findings-acl)

Copied to clipboard

Challenge: Hybrid Question-Answering datasets lack a robust reasoning model for text-based QA.
Approach: They propose a table-question-alignment-based cell-selection and reasoning model for hybrid text and table QA.
Outcome: The proposed model outperforms baselines on HybridQA and WikiTableQuestions datasets on cell selection and argumentation.
H-STAR: LLM-driven Hybrid SQL-Text Adaptive Reasoning on Tables (2025.naacl-long)

Copied to clipboard

Challenge: Existing methods for tabular reasoning combine textual and symbolic reasoning in a two-stage process to address these limitations.
Approach: They propose an algorithm that integrates symbolic and semantic (textual) approaches in a two-stage process to address these limitations.
Outcome: The proposed algorithm outperforms state-of-the-art methods across three tabular question-answering and fact-verification datasets, underscoring its effectiveness and efficiency.
Text-to-Table: A New Way of Information Extraction (2022.acl-long)

Copied to clipboard

Challenge: Existing methods for information extraction are not well understood . text-to-table is a problem that aims to extract information from text data .
Approach: They propose a new problem setting of information extraction, called text-to-table . they formalize text- to-table as a sequence-tosequence problem .
Outcome: The proposed method outperforms existing methods on text-to-table tasks.
Query Variant Detection Using Retriever as Environment (2025.naacl-industry)

Copied to clipboard

Challenge: Identifying query variants is nontrivial as highly similar query pairs may fail to differ in word form, order, or phrasing despite sharing the same intent.
Approach: They propose to use retrieval as an environment feedback to capture semantic equivalence . experimental results demonstrate the efficacy of the proposed method .
Outcome: The proposed method improves query variant detection across diverse scenarios.
An Inner Table Retriever for Robust Table Question Answering (2023.acl-long)

Copied to clipboard

Challenge: Table Question Answering (TableQA) is a task of answering NL user questions using factoid answers extracted from table content.
Approach: They propose a method for handling long tables in TableQA that extracts sub-tables to preserve the most relevant information for a question.
Outcome: The proposed method can improve TableQA's accuracy with up to 1.3-4.8% and achieve state-of-the-art in two benchmarks.

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