Pith. sign in

REVIEW 8 cited by

TaBERT: Pretraining for Joint Understanding of Textual and Tabular Data

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 2005.08314 v1 pith:H5LYIHJV submitted 2020-05-17 cs.CL cs.LG

classification cs.CLcs.LG
keywords tabertdatasemanticstructuredtablesfree-formlanguagemodels
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Recent years have witnessed the burgeoning of pretrained language models (LMs) for text-based natural language (NL) understanding tasks. Such models are typically trained on free-form NL text, hence may not be suitable for tasks like semantic parsing over structured data, which require reasoning over both free-form NL questions and structured tabular data (e.g., database tables). In this paper we present TaBERT, a pretrained LM that jointly learns representations for NL sentences and (semi-)structured tables. TaBERT is trained on a large corpus of 26 million tables and their English contexts. In experiments, neural semantic parsers using TaBERT as feature representation layers achieve new best results on the challenging weakly-supervised semantic parsing benchmark WikiTableQuestions, while performing competitively on the text-to-SQL dataset Spider. Implementation of the model will be available at http://fburl.com/TaBERT .

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 8 Pith papers

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

  1. TEN: Table Explicitization, Neurosymbolically

    cs.CL 2025-08 unverdicted novelty 6.0 of 10

    A neurosymbolic system with structural decomposition prompting and a checker-driven self-debug loop improves table extraction from semistructured text over purely neural baselines.

  2. CACTI: Leveraging Copy Masking and Contextual Information to Improve Tabular Data Imputation

    cs.LG 2025-06 conditional novelty 6.0 of 10

    CACTI combines median-truncated copy masking with language-model column embeddings to improve tabular imputation accuracy across MCAR, MAR, and MNAR missingness.

  3. TabLoRA: Parameter-Efficient Low-Rank Ensemble Learning for Large-Scale Tabular Data

    cs.LG 2026-07 conditional novelty 5.0 of 10

    Shared-backbone low-rank ensemble adapters let neural tabular models match much of full-ensemble accuracy on large data without linear parameter growth or frequent OOMs.

  4. ExpliCIT-QA: Explainable Code-Based Image Table Question Answering

    cs.CL 2025-07 conditional novelty 5.0 of 10

    ExpliCIT-QA turns table-image question answering into a traceable sequence of table extraction, natural-language reasoning, code generation, execution, and explanation.

  5. Ta-G-T: Subjectivity Capture in Table to Text Generation via RDF Graphs

    cs.CL 2025-07 conditional novelty 4.0 of 10

    A modular T5-based pipeline using RDF triples, sentence aggregation, and style transfer generates factual text with subjective interpretations from tables, achieving moderate gains over several LLM baselines.

  6. Interactive Text-to-SQL via Expected Information Gain for Disambiguation

    cs.DB 2025-07 reject novelty 4.0 of 10

    An interactive text-to-SQL framework selects clarification questions by expected information gain over a distribution of candidate SQL queries.

  7. An Empirical study on LLM-based Log Retrieval for Software Engineering Metadata Management

    cs.SE 2025-06 conditional novelty 4.0 of 10

    A natural-language log retrieval pipeline using LLM-generated video and signal descriptions shows that prompt and model choice matter, but its proposed reliability metrics are not validated against any ground truth.

  8. Random at First, Fast at Last: NTK-Guided Fourier Pre-Processing for Tabular DL

    cs.LG 2025-06 conditional novelty 3.0 of 10

    Fixed random Fourier projections on tabular inputs are claimed to bound the NTK, speed up gradient descent, and improve accuracy across four architectures and eight benchmarks.

Pith tools