Pith. sign in

REVIEW 8 cited by

Open Question Answering over Tables and Text

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2010.10439 v2 pith:HFOMXDXM submitted 2020-10-20 cs.CL cs.AI

Open Question Answering over Tables and Text

classification cs.CL cs.AI
keywords questionopenevidenceansweringott-qaretrievingtabulartext
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

In open question answering (QA), the answer to a question is produced by retrieving and then analyzing documents that might contain answers to the question. Most open QA systems have considered only retrieving information from unstructured text. Here we consider for the first time open QA over both tabular and textual data and present a new large-scale dataset Open Table-and-Text Question Answering (OTT-QA) to evaluate performance on this task. Most questions in OTT-QA require multi-hop inference across tabular data and unstructured text, and the evidence required to answer a question can be distributed in different ways over these two types of input, making evidence retrieval challenging -- our baseline model using an iterative retriever and BERT-based reader achieves an exact match score less than 10%. We then propose two novel techniques to address the challenge of retrieving and aggregating evidence for OTT-QA. The first technique is to use "early fusion" to group multiple highly relevant tabular and textual units into a fused block, which provides more context for the retriever to search for. The second technique is to use a cross-block reader to model the cross-dependency between multiple retrieved evidence with global-local sparse attention. Combining these two techniques improves the score significantly, to above 27%.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 8 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. TabEmbed: Benchmarking and Learning Generalist Embeddings for Tabular Understanding

    cs.CL 2026-05 unverdicted novelty 7.0

    TabEmbed is the first generalist embedding model for tabular data that unifies classification and retrieval in one space via contrastive learning and outperforms text embedding models on the new TabBench benchmark.

  2. TableVision: A Large-Scale Benchmark for Spatially Grounded Reasoning over Complex Hierarchical Tables

    cs.AI 2026-04 conditional novelty 7.0

    TableVision benchmark shows explicit spatial grounding recovers MLLM reasoning on hierarchical tables, delivering 12.3% accuracy improvement through a decoupled perception-reasoning framework.

  3. HETERQA: Benchmarking Record Retrieval over Multiple Heterogeneous Sources

    cs.IR 2026-07 conditional novelty 6.5

    HETERQA builds 857 answer-driven multi-source Yelp record-retrieval questions and finds hybrid and agentic methods still far from saturating Recall@10 and MRR@10.

  4. LakeQA: An Exploratory QA Benchmark over a Million-Scale Data Lake

    cs.CL 2026-06 unverdicted novelty 6.0

    Introduces LakeQA, a new expert-annotated benchmark for search-centric multi-hop QA over a million-scale heterogeneous data lake, showing low performance (18.37% exact match) on frontier LLMs like GPT-5.2.

  5. PIPER: Content-Based Table Search via profiling and LLM-Generated Pseudoqueries

    cs.IR 2026-05 unverdicted novelty 6.0

    PIPER retrieves and ranks tabular datasets by profiling their content and using LLM-generated queries for dense vector search, outperforming metadata baselines and TableQA methods in low-metadata settings.

  6. Stepwise Reasoning Enhancement for LLMs via External Subgraph Generation

    cs.CL 2026-06 unverdicted novelty 4.0

    SGR framework generates query-relevant subgraphs from knowledge graphs via schema-guided retrieval to guide LLM stepwise reasoning, reporting accuracy gains on QA benchmarks.

  7. SGR: A Stepwise Reasoning Framework for LLMs with External Subgraph Generation

    cs.CL 2026-05 unverdicted novelty 4.0

    SGR enhances LLM reasoning accuracy by generating external subgraphs from knowledge bases and guiding progressive inference over them, yielding consistent gains over baselines on benchmarks.

  8. RaguTeam at SemEval-2026 Task 8: Meno and Friends in a Judge-Orchestrated LLM Ensemble for Faithful Multi-Turn Response Generation

    cs.CL 2026-05 accept novelty 3.0

    A heterogeneous ensemble of seven LLMs plus a judge model won first place in SemEval-2026 Task 8 on faithful multi-turn response generation by selecting optimal candidates from diverse outputs.