Pith. sign in

REVIEW 5 cited by

DART: Open-Domain Structured Data Record to Text Generation

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 2007.02871 v2 pith:FFQZ7NFN submitted 2020-07-06 cs.CL

classification cs.CL
keywords dartdatasemanticstructureddata-to-textdatasetdomaingeneration
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We present DART, an open domain structured DAta Record to Text generation dataset with over 82k instances (DARTs). Data-to-Text annotations can be a costly process, especially when dealing with tables which are the major source of structured data and contain nontrivial structures. To this end, we propose a procedure of extracting semantic triples from tables that encodes their structures by exploiting the semantic dependencies among table headers and the table title. Our dataset construction framework effectively merged heterogeneous sources from open domain semantic parsing and dialogue-act-based meaning representation tasks by utilizing techniques such as: tree ontology annotation, question-answer pair to declarative sentence conversion, and predicate unification, all with minimum post-editing. We present systematic evaluation on DART as well as new state-of-the-art results on WebNLG 2017 to show that DART (1) poses new challenges to existing data-to-text datasets and (2) facilitates out-of-domain generalization. Our data and code can be found at https://github.com/Yale-LILY/dart.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 5 Pith papers

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

  1. Learning to Select In-Context Demonstration Preferred by Large Language Model

    cs.LG 2025-05 conditional novelty 6.0 of 10

    A generative preference-learning method trains a latent demonstration selector from LLM feedback and improves few-shot in-context learning performance on most of 19 benchmark datasets.

  2. LLaSA: Large Language and Structured Data Assistant

    cs.CL 2024-11 conditional novelty 6.0 of 10

    A single hypergraph encoder and G-Former, pretrained on 25 million tables, can be appended to different LLMs to improve their performance on table, knowledge graph, and database structured knowledge grounding tasks.

  3. Enhancing Model Privacy in Federated Learning with Random Masking and Quantization

    cs.LG 2025-08 reject novelty 5.0 of 10

    FedQSN hides part of the server model with random masks and quantizes the remainder to give clients a degraded proxy, reporting a large global-vs-proxy performance gap with modest loss in the final global model.

  4. The Evolution of Natural Language Processing: How Prompt Optimization and Language Models are Shaping the Future

    cs.CL 2025-06 reject novelty 3.0 of 10

    A review that categorizes 45 prompt optimization strategies into 11 classes and surveys their use across NLP tasks, models, and datasets, but with inconsistent counts and overlapping categories.

  5. Parameter-Efficient Fine-Tuning for Foundation Models

    cs.CL 2025-01 conditional novelty 2.0 of 10

    A survey that categorizes and summarizes parameter-efficient fine-tuning methods across large language, vision, and multimodal models.

Pith tools