{"url":"/sota/data-to-text-generation-on-mlb-dataset-2","task":{"name":"Data-to-Text Generation","url":"/task/data-to-text-generation","note":null},"dataset":{"name":"MLB Dataset","url":"/dataset/mlb-dataset"},"category":"Natural Language Processing","categories":["Natural Language Processing"],"category_note":null,"description":"A classic problem in natural-language generation (NLG) involves taking structured data, such as a table, as input, and producing text that adequately and fluently describes this data as output. Unlike machine translation, which aims for complete transduction of the sentence to be translated, this form of NLG is usually taken to require addressing (at least) two separate challenges: what to say, the selection of an appropriate subset of the input data to discuss, and how to say it, the surface realization of a generation. \r\n\r\n<span style=\"color:grey; opacity: 0.6\">( Image credit: [Data-to-Text Generation with Content Selection and Planning](https://arxiv.org/pdf/1809.00582v2.pdf) )</span>","description_from":"task","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","rank":"the archive's row order at snapshot; not re-ranked","rows_end_at":"2025-07-28","rows_withheld_as_spam":0,"metric_values":"the archive's strings, untouched"},"metrics":["BLEU"],"metric_direction":{"note":"inferred from the metric name only (the archive records no direction); null = not inferred, chart draws points only","by_metric":{"BLEU":"higher"}},"counts":{"rows":4,"rows_with_code":3,"rows_with_paper_page":4,"rows_dated":4,"rows_using_additional_data":0},"rows":[{"rank_in_archive_order":1,"model":"SeqPlan","metrics":{"BLEU":"14.29"},"uses_additional_data":false,"paper_date":"2022-02-28","paper":"/paper/data-to-text-generation-with-variational","paper_url":"https://arxiv.org/abs/2202.13756v1","paper_title":"Data-to-text Generation with Variational Sequential Planning","code":"https://github.com/ratishsp/data2text-seq-plan-py","n_code_links":1,"syntology":null},{"rank_in_archive_order":2,"model":"Macro","metrics":{"BLEU":"12.62"},"uses_additional_data":false,"paper_date":"2021-02-04","paper":"/paper/data-to-text-generation-with-macro-planning","paper_url":"https://arxiv.org/abs/2102.02723v1","paper_title":"Data-to-text Generation with Macro Planning","code":"https://github.com/ratishsp/data2text-macro-plan-py","n_code_links":1,"syntology":null},{"rank_in_archive_order":3,"model":"ENT","metrics":{"BLEU":"11.50"},"uses_additional_data":false,"paper_date":"2019-06-07","paper":"/paper/data-to-text-generation-with-entity-modeling","paper_url":"https://arxiv.org/abs/1906.03221v1","paper_title":"Data-to-text Generation with Entity Modeling","code":"https://github.com/ratishsp/data2text-entity-py","n_code_links":2,"syntology":{"n_ran":1,"n_unverified":1,"n_samples":2,"n_pointer_only_licence":0}},{"rank_in_archive_order":4,"model":"Force-Copy","metrics":{"BLEU":"10.5"},"uses_additional_data":false,"paper_date":"2021-12-20","paper":"/paper/may-the-force-be-with-your-copy-mechanism-1","paper_url":"https://arxiv.org/abs/2112.10360v1","paper_title":"May the Force Be with Your Copy Mechanism: Enhanced Supervised-Copy Method for Natural Language Generation","code":null,"n_code_links":0,"syntology":null}],"since_archive":{"claim":"Results that newer papers report for their own method, placed here by Syntology. A model pointed at the cell in the paper's own table; the number was read from that cell and checked against this leaderboard's metric, dataset, split and scale; an independent check that saw this leaderboard's other rows and every other leaderboard on the same dataset accepted it. Not reviewed by the paper's authors or by the archive's editors, and not ranked against the archive rows.","extraction_file_present":true,"measurement":{"test_papers":883,"papers_with_output":881,"judged_true":108,"judged":110,"wilson95_lower":0.9361,"measured_on":"2026-09-24","frozen_commit":"0e3de0df94"},"measurement_note":"blind adjudication of accepted entries on a held-out split of archive papers, rules frozen before the test","coverage":{"sentence":"Syntology has checked 6,795 of the 9,581 papers on this site that are newer than the archive; results from the others appear after they are checked.","complete":false,"papers_newer_than_archive":9581,"papers_checked":6795,"papers_extracted_not_yet_verified":0,"boards_without_verdict":2,"papers_not_yet_extracted":2785},"order":"newest first by month (arXiv date, else the arXiv-id month), then arXiv id descending","columns":[],"entries":[]},"syntology":{"read_at":"2026-09-24T18:15:14+00:00","claim":"Per row: N of M harvested code samples from that row's paper executed on a synthesized fixture; the other M-N are unverified. Not a reproduction of the row's number; not a correctness claim. n_pointer_only_licence counts samples the site points at rather than redistributes (a licence axis, independent of ran/unverified).","rows_with_graph_line":1,"rows_with_any_sample_ran":1,"distinct_papers_with_graph_line":1,"distinct_papers_with_any_sample_ran":1,"samples_over_distinct_papers":{"n_ran":1,"n_unverified":1,"n_samples":2,"n_pointer_only_licence":0,"note":"each paper (arXiv id) counted once, however many rows it is behind; this is the page-level figure"},"samples_row_weighted":{"n_ran":1,"n_unverified":1,"n_samples":2,"n_pointer_only_licence":0,"note":"row-weighted: a paper behind several rows is counted once per row; inflated relative to samples_over_distinct_papers by design, kept for readers summing the per-row syntology blocks"}}}