Pith. sign in

Reasoning over Hybrid Chain for Table-and-Text Open Domain QA

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

Tabular and textual question answering requires systems to perform reasoning over heterogeneous information, considering table structure, and the connections among table and text. In this paper, we propose a ChAin-centric Reasoning and Pre-training framework (CARP). CARP utilizes hybrid chain to model the explicit intermediate reasoning process across table and text for question answering. We also propose a novel chain-centric pre-training method, to enhance the pre-trained model in identifying the cross-modality reasoning process and alleviating the data sparsity problem. This method constructs the large-scale reasoning corpus by synthesizing pseudo heterogeneous reasoning paths from Wikipedia and generating corresponding questions. We evaluate our system on OTT-QA, a large-scale table-and-text open-domain question answering benchmark, and our system achieves the state-of-the-art performance. Further analyses illustrate that the explicit hybrid chain offers substantial performance improvement and interpretablity of the intermediate reasoning process, and the chain-centric pre-training boosts the performance on the chain extraction.

fields

cs.CL 1

years

2025 1

verdicts

CONDITIONAL 1

representative citing papers

Hybrid Graphs for Table-and-Text based Question Answering using LLMs

cs.CL · 2025-01-29 · conditional · novelty 6.0

A zero-shot table-text QA method that builds a hybrid graph of table cells and passage entities, prunes it via question-entity matching and 3-hop BFS, and feeds the pruned context to an LLM, improving EM and reducing tokens over full-context baselines.

citing papers explorer

Showing 1 of 1 citing paper.

  • Hybrid Graphs for Table-and-Text based Question Answering using LLMs cs.CL · 2025-01-29 · conditional · none · ref 44 · internal anchor

    A zero-shot table-text QA method that builds a hybrid graph of table cells and passage entities, prunes it via question-entity matching and 3-hop BFS, and feeds the pruned context to an LLM, improving EM and reducing tokens over full-context baselines.