File size: 43,477 Bytes
6fa4bc9 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 |
{
"paper_id": "2020",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T07:28:38.089663Z"
},
"title": "Shared Task on Evaluating Accuracy",
"authors": [
{
"first": "Ehud",
"middle": [],
"last": "Reiter",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Aberdeen Aberdeen",
"location": {
"country": "UK"
}
},
"email": "e.reiter@abdn.ac.uk"
},
{
"first": "Craig",
"middle": [],
"last": "Thomson",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Aberdeen",
"location": {
"settlement": "Aberdeen",
"country": "UK"
}
},
"email": "c.thomson@abdn.ac.uk"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We propose a shared task on methodologies and algorithms for evaluating the accuracy of generated texts, specifically summaries of basketball games produced from basketball box score and other game data. We welcome submissions based on protocols for human evaluation, automatic metrics, as well as combinations of human evaluations and metrics.",
"pdf_parse": {
"paper_id": "2020",
"_pdf_hash": "",
"abstract": [
{
"text": "We propose a shared task on methodologies and algorithms for evaluating the accuracy of generated texts, specifically summaries of basketball games produced from basketball box score and other game data. We welcome submissions based on protocols for human evaluation, automatic metrics, as well as combinations of human evaluations and metrics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Users expect data-to-text NLG systems to generate textual summaries which are accurate. However, many neural NLG systems in particular generate texts which are factually incorrect.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The most reliable way to assess the accuracy of a generated text is to ask human annotators to carefully fact-check the text. However this is a time-consuming process. Our experiences at Aberdeen (Thomson and Reiter, 2020) show that it can take an experienced annotator 30 minutes to factcheck a moderately complex 300-word paragraph produced by a neural data-to-text NLG system.",
"cite_spans": [
{
"start": 196,
"end": 222,
"text": "(Thomson and Reiter, 2020)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "It would be very useful to the NLG community if we could come up with quicker and easier ways of measuring accuracy which have good correlations with careful fact-checking. Such methods could be based on less time-consuming human evaluations, such as asking subjects to rate the accuracy of a text on a Likert-type scale (van der Lee et al., 2019) , or on automatic metrics. However, we should only use such techniques if we feel confident that they have good agreement and correlation with careful high-quality human fact-checking.",
"cite_spans": [
{
"start": 321,
"end": 347,
"text": "(van der Lee et al., 2019)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The goal of our proposed shared task is to encourage innovative ideas for evaluating accuracy, including both automatic metrics and protocols for human evaluation. Participants will apply their techniques to summaries of basketball games produced from box score (and other game data) by neural NLG systems. From the output of three such systems we will compile a corpus of generated texts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The shared task is unusual because submissions can be protocols for human evaluations as well as computer algorithms (ie, metrics). The community has limited experience with shared tasks which evaluate protocols, and we hope our experiences will help develop a better understanding of how to undertake such shared tasks, as well as a better understanding of how to evaluate the accuracy of NLG texts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The organisers are",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Organisers",
"sec_num": "2"
},
{
"text": "\u2022 Ehud Reiter, University of Aberdeen (e.reiter@abdn.ac.uk)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Organisers",
"sec_num": "2"
},
{
"text": "\u2022 Craig Thomson, University of Aberdeen (c.thomson@abdn.ac.uk)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Organisers",
"sec_num": "2"
},
{
"text": "Participants will be asked to submit one or more submissions which describe either",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Task Description",
"sec_num": "3"
},
{
"text": "\u2022 An evaluation protocol for human subjects which assesses the accuracy of generated texts. This should include experimental design, guidance on number and type of subjects, and recommended statistical analysis (van der Lee et al., 2019). The subjects will have access to data about the game and the teams, and also (if part of the protocol) to a human-authored reference text.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Task Description",
"sec_num": "3"
},
{
"text": "\u2022 An automatic metric (algorithm) which computes the accuracy of a generated text. The algorithm will have access to data about the game and the teams, and to a reference text.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Task Description",
"sec_num": "3"
},
{
"text": "\u2022 A technique which combines human evaluation and automatic metrics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Task Description",
"sec_num": "3"
},
{
"text": "It is acceptable for submissions to give human subjects or metrics access to additional data beyond the box score and other game data used to generate the texts at run-time. The goal of the shared task is to find statements which are not true in the real world (ie, classic fact-checking), not just statements which disagree with (or are not derivable from) the system run-time data (see Section 3.1 of Thomson and Reiter (2020) ). The output of the evaluation protocol or metric will be a list of mistakes in the text. Each mistake will be characterised by",
"cite_spans": [
{
"start": 403,
"end": 428,
"text": "Thomson and Reiter (2020)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Task Description",
"sec_num": "3"
},
{
"text": "\u2022 Its position in the text (start token and end token).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Task Description",
"sec_num": "3"
},
{
"text": "\u2022 A category. We use the following categories, which are based on Thomson and Reiter 2020-Incorrect number: It does not matter whether the number is spelled out or is in digits. -Incorrect named entity: This includes people, places, teams, and days of the week. -Incorrect word: A word which is not one of the above and is incorrect. -Context error: A phrase which causes an incorrect inference because of context or discourse. -Not checkable: A statement which can not be checked, either because the information is not available or because it is too time-consuming to check. -Other: Any other type of mistake.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Task Description",
"sec_num": "3"
},
{
"text": "An example is shown in Figure 1 . Note that this example combines fragments from texts produced by several different systems, along with some manual adjustments, in order to illustrate different types of mistakes in a simple way. Box score and other data for this game is available at https://www.basketball-reference. com/boxscores/201411050PHO.html .",
"cite_spans": [],
"ref_spans": [
{
"start": 23,
"end": 31,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Task Description",
"sec_num": "3"
},
{
"text": "We will also ask participants to submit estimates of the time required to find mistakes in a text (human time for human evaluations, and CPU/GPU time for metrics). This is optional, it is not required.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Task Description",
"sec_num": "3"
},
{
"text": "It would, however, be very useful information for the NLG community, The Memphis Grizzlies (5-2) defeated the Phoenix Suns (3 -2) Monday 102-91 at the Talking Stick Resort Arena in Phoenix. The Grizzlies had a strong first half where they out-scored the Suns 59-42. Marc Gasol scored 18 points, leading the Grizzlies. Isaiah Thomas added 15 points, he is averaging 19 points on the season so far.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Task Description",
"sec_num": "3"
},
{
"text": "\u2022 2: incorrect number, should be 0.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "List of errors:",
"sec_num": null
},
{
"text": "\u2022 Monday: incorrect named entity, should be Wednesday.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "List of errors:",
"sec_num": null
},
{
"text": "\u2022 Talking Stick Resort Arena: incorrect named entity, should be US Airways Center.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "List of errors:",
"sec_num": null
},
{
"text": "\u2022 strong: incorrect word, the Grizzlies did not do well in the first half.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "List of errors:",
"sec_num": null
},
{
"text": "\u2022 out-scored: incorrect word, the Suns had a higher score in first half.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "List of errors:",
"sec_num": null
},
{
"text": "\u2022 59: incorrect number, should be 46.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "List of errors:",
"sec_num": null
},
{
"text": "\u2022 42: incorrect number, should be 52 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "List of errors:",
"sec_num": null
},
{
"text": "\u2022 leading: incorrect word. Marc Gasol did not lead the Grizzlies, Mike Conley did with 24 points.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "List of errors:",
"sec_num": null
},
{
"text": "\u2022 Isaiah Thomas added: context error. Thomas played for the Suns, but context here implies he played for the Grizzlies and added to their score.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "List of errors:",
"sec_num": null
},
{
"text": "\u2022 averaging 10 points on the season so far: not checkable. This is very hard to check, since data sources report performance per season and per game, not performance up to a particular point in a season. We also plan to have an 'open' track where people can submit ideas for evaluating accuracy on our data set which do not fit into the above framework.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "List of errors:",
"sec_num": null
},
{
"text": "We will use texts produced by three systems that use basketball box score data: Wiseman et al. (2017) , Puduppully et al. (2019a) , and Rebuffel et al. (2020) . We will carefully fact-check, using the protocol of Thomson and Reiter (2020) , 60 texts (twenty from each system).",
"cite_spans": [
{
"start": 80,
"end": 101,
"text": "Wiseman et al. (2017)",
"ref_id": "BIBREF8"
},
{
"start": 104,
"end": 129,
"text": "Puduppully et al. (2019a)",
"ref_id": "BIBREF3"
},
{
"start": 136,
"end": 158,
"text": "Rebuffel et al. (2020)",
"ref_id": "BIBREF5"
},
{
"start": 213,
"end": 238,
"text": "Thomson and Reiter (2020)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Data",
"sec_num": "4"
},
{
"text": "The three systems we have chosen all explored different ways of modifying the neural architecture. The system of Wiseman et al. (2017) defined the Rotowire task and provided initial benchmarks for machine translation systems using copy attention, it is included for this reason. Puduppully et al. (2019a) jointly conditioned on a document plan, whilst Rebuffel et al. (2020) used a hierarchical encoder to group attributes (such as statistics) by their respective entities (players/teams).",
"cite_spans": [
{
"start": 113,
"end": 134,
"text": "Wiseman et al. (2017)",
"ref_id": "BIBREF8"
},
{
"start": 352,
"end": 374,
"text": "Rebuffel et al. (2020)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Data",
"sec_num": "4"
},
{
"text": "Other systems in this domain which could be used for evaluation include Puduppully et al. (2019b) , Wang (2019) , Gong et al. 2019, and Iso et al. (2019) . Our aim, however, is to assess how well results produced by the participant's evaluation techniques correlate with the gold-standard fact-checking. Hence we are looking for a set of systems which generate texts that contain a significant number of accuracy errors, not complete coverage of all systems that generate texts from basketball box score data. In Thomson and Reiter (2020) , we looked at a number of texts generated by the three systems we have selected. No text was error free (the lowest was 7 errors) and the average number of errors per text is about 20.",
"cite_spans": [
{
"start": 72,
"end": 97,
"text": "Puduppully et al. (2019b)",
"ref_id": "BIBREF4"
},
{
"start": 100,
"end": 111,
"text": "Wang (2019)",
"ref_id": "BIBREF7"
},
{
"start": 132,
"end": 153,
"text": "and Iso et al. (2019)",
"ref_id": "BIBREF1"
},
{
"start": 513,
"end": 538,
"text": "Thomson and Reiter (2020)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Data",
"sec_num": "4"
},
{
"text": "We will also ask each participant in the shared task to manually fact-check an additional ten texts. This is optional, but we believe it is very useful for building a better understanding of the task, as well as increasing the amount of training data available. Note that the protocol of Thomson and Reiter (2020) asks for each text to be fact-checked by three annotators. Since this is expensive, and Thomson and Reiter (2020) report a high-level of inter-annotater agreement, we will accept contributions from participants which have been factchecked by just one person. In total, we hope to have 100 fact-checked texts in the training set.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Data",
"sec_num": "4"
},
{
"text": "Participants will also have access to all of the texts produced by each of the three systems, along with source box score data and a human-written reference text.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Data",
"sec_num": "4"
},
{
"text": "We will create a separate test set of 21 texts which will be manually fact-checked. The test set will include 7 texts from each of the above three systems. Each text will be fact checked by 3 annotators following the same process as for the training data.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Data",
"sec_num": "4"
},
{
"text": "We will release the test set (but not the manual factchecking annotations), and give participants two weeks to apply their techniques to the test set and return the results. Each mistake will be reported as a position and category, as described above. We will create a Reported Mistake List (RML) for each annotated text submitted by a participant.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Plans",
"sec_num": "5"
},
{
"text": "We will then try to align each RML entry with an entry in the gold standard mistake list (GSML). Match criteria will be applied in order, to each reported mistake (RM) in the RML. We will mark each match, along with which criteria it was identified under. In the event of an RM not being found in the GSML (i.e. a false positive), we will mark 'Not found'. The match criteria are as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Plans",
"sec_num": "5"
},
{
"text": "\u2022 Exact match: First look for a GSML entry which is an exact match to the RML entry.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Plans",
"sec_num": "5"
},
{
"text": "\u2022 Same category: If not found, look for a GSML entry with same category and maximal (nonzero) overlap in position \u2022 Recall and precision for each category. In other words, for each category, what percentage of mistakes of this type in GSML were aligned with an RML entry of this category, and vice-versa.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Plans",
"sec_num": "5"
},
{
"text": "\u2022 Overall recall and precision (ignoring category). Looking at RML as a whole, what percentage of entries were successfully aligned with a GSML entry (of any category), and vice-versa. Given that there are currently many errors (approx 20) in each summary, having a reliable way to detect errors (even without category) would be very useful.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Plans",
"sec_num": "5"
},
{
"text": "We plan on the following schedule. Note that dates are tentative and may be modified when we know the dates of INLG 2021.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Schedule",
"sec_num": "6"
},
{
"text": "\u2022 15 December 2020 (ie, at INLG 2020): announce task, ask for participants",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Schedule",
"sec_num": "6"
},
{
"text": "\u2022 15 February 2021: deadline for participants to register and (if possible) provide fact-checked stories for training data.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Schedule",
"sec_num": "6"
},
{
"text": "\u2022 15 June 2021: submission of techniques (algorithms and protocols). Test set issued, participants give results on test set within 2 weeks.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Schedule",
"sec_num": "6"
},
{
"text": "\u2022 1 August 2021: Results of evaluation computed",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Schedule",
"sec_num": "6"
},
{
"text": "\u2022 INLG 2021: Results presented at INLG, along with posters describing the techniques",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Schedule",
"sec_num": "6"
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Table-to-text generation with effective hierarchical encoder on three dimensions (row, column and time)",
"authors": [
{
"first": "Xiaocheng",
"middle": [],
"last": "Heng Gong",
"suffix": ""
},
{
"first": "Bing",
"middle": [],
"last": "Feng",
"suffix": ""
},
{
"first": "Ting",
"middle": [],
"last": "Qin",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)",
"volume": "",
"issue": "",
"pages": "3143--3152",
"other_ids": {
"DOI": [
"10.18653/v1/D19-1310"
]
},
"num": null,
"urls": [],
"raw_text": "Heng Gong, Xiaocheng Feng, Bing Qin, and Ting Liu. 2019. Table-to-text generation with effective hier- archical encoder on three dimensions (row, column and time). In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Process- ing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pages 3143-3152, Hong Kong, China. Association for Computational Linguistics.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Learning to select, track, and generate for data-to-text",
"authors": [
{
"first": "Hayate",
"middle": [],
"last": "Iso",
"suffix": ""
},
{
"first": "Yui",
"middle": [],
"last": "Uehara",
"suffix": ""
},
{
"first": "Tatsuya",
"middle": [],
"last": "Ishigaki",
"suffix": ""
},
{
"first": "Hiroshi",
"middle": [],
"last": "Noji",
"suffix": ""
},
{
"first": "Eiji",
"middle": [],
"last": "Aramaki",
"suffix": ""
},
{
"first": "Ichiro",
"middle": [],
"last": "Kobayashi",
"suffix": ""
},
{
"first": "Yusuke",
"middle": [],
"last": "Miyao",
"suffix": ""
},
{
"first": "Naoaki",
"middle": [],
"last": "Okazaki",
"suffix": ""
},
{
"first": "Hiroya",
"middle": [],
"last": "Takamura",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "2102--2113",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1202"
]
},
"num": null,
"urls": [],
"raw_text": "Hayate Iso, Yui Uehara, Tatsuya Ishigaki, Hiroshi Noji, Eiji Aramaki, Ichiro Kobayashi, Yusuke Miyao, Naoaki Okazaki, and Hiroya Takamura. 2019. Learning to select, track, and generate for data-to-text. In Proceedings of the 57th Annual Meeting of the Association for Computational Lin- guistics, pages 2102-2113, Florence, Italy. Associa- tion for Computational Linguistics.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Best practices for the human evaluation of automatically generated text",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Van Der Lee",
"suffix": ""
},
{
"first": "Albert",
"middle": [],
"last": "Gatt",
"suffix": ""
},
{
"first": "Sander",
"middle": [],
"last": "Emiel Van Miltenburg",
"suffix": ""
},
{
"first": "Emiel",
"middle": [],
"last": "Wubben",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Krahmer",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 12th International Conference on Natural Language Generation",
"volume": "",
"issue": "",
"pages": "355--368",
"other_ids": {
"DOI": [
"10.18653/v1/W19-8643"
]
},
"num": null,
"urls": [],
"raw_text": "Chris van der Lee, Albert Gatt, Emiel van Miltenburg, Sander Wubben, and Emiel Krahmer. 2019. Best practices for the human evaluation of automatically generated text. In Proceedings of the 12th Interna- tional Conference on Natural Language Generation, pages 355-368, Tokyo, Japan. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Data-to-text generation with content selection and planning",
"authors": [
{
"first": "Ratish",
"middle": [],
"last": "Puduppully",
"suffix": ""
},
{
"first": "Li",
"middle": [],
"last": "Dong",
"suffix": ""
},
{
"first": "Mirella",
"middle": [],
"last": "Lapata",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the AAAI Conference on Artificial Intelligence",
"volume": "33",
"issue": "",
"pages": "6908--6915",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ratish Puduppully, Li Dong, and Mirella Lapata. 2019a. Data-to-text generation with content selec- tion and planning. In Proceedings of the AAAI Con- ference on Artificial Intelligence, volume 33, pages 6908-6915.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Data-to-text generation with entity modeling",
"authors": [
{
"first": "Ratish",
"middle": [],
"last": "Puduppully",
"suffix": ""
},
{
"first": "Li",
"middle": [],
"last": "Dong",
"suffix": ""
},
{
"first": "Mirella",
"middle": [],
"last": "Lapata",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "2023--2035",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1195"
]
},
"num": null,
"urls": [],
"raw_text": "Ratish Puduppully, Li Dong, and Mirella Lapata. 2019b. Data-to-text generation with entity model- ing. In Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 2023-2035, Florence, Italy. Association for Computational Linguistics.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "A hierarchical model for data-to-text generation",
"authors": [
{
"first": "Cl\u00e9ment",
"middle": [],
"last": "Rebuffel",
"suffix": ""
},
{
"first": "Laure",
"middle": [],
"last": "Soulier",
"suffix": ""
},
{
"first": "Geoffrey",
"middle": [],
"last": "Scoutheeten",
"suffix": ""
},
{
"first": "Patrick",
"middle": [],
"last": "Gallinari",
"suffix": ""
}
],
"year": 2020,
"venue": "Advances in Information Retrieval",
"volume": "",
"issue": "",
"pages": "65--80",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Cl\u00e9ment Rebuffel, Laure Soulier, Geoffrey Scoutheeten, and Patrick Gallinari. 2020. A hierarchical model for data-to-text generation. In Advances in Information Retrieval, pages 65-80, Cham. Springer International Publishing.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "A gold standard methodology for evaluating accuracy in datato-text systems",
"authors": [
{
"first": "Craig",
"middle": [],
"last": "Thomson",
"suffix": ""
},
{
"first": "Ehud",
"middle": [],
"last": "Reiter",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of INLG 2020",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Craig Thomson and Ehud Reiter. 2020. A gold stan- dard methodology for evaluating accuracy in data- to-text systems. In Proceedings of INLG 2020.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Revisiting challenges in datato-text generation with fact grounding",
"authors": [
{
"first": "Hongmin",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 12th International Conference on Natural Language Generation",
"volume": "",
"issue": "",
"pages": "311--322",
"other_ids": {
"DOI": [
"10.18653/v1/W19-8639"
]
},
"num": null,
"urls": [],
"raw_text": "Hongmin Wang. 2019. Revisiting challenges in data- to-text generation with fact grounding. In Proceed- ings of the 12th International Conference on Nat- ural Language Generation, pages 311-322, Tokyo, Japan. Association for Computational Linguistics.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Challenges in data-to-document generation",
"authors": [
{
"first": "Sam",
"middle": [],
"last": "Wiseman",
"suffix": ""
},
{
"first": "Stuart",
"middle": [],
"last": "Shieber",
"suffix": ""
},
{
"first": "Alexander",
"middle": [],
"last": "Rush",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "2253--2263",
"other_ids": {
"DOI": [
"10.18653/v1/D17-1239"
]
},
"num": null,
"urls": [],
"raw_text": "Sam Wiseman, Stuart Shieber, and Alexander Rush. 2017. Challenges in data-to-document generation. In Proceedings of the 2017 Conference on Empiri- cal Methods in Natural Language Processing, pages 2253-2263, Copenhagen, Denmark. Association for Computational Linguistics.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Example text with error annotations.Corrections and explanations are not required, but are included here for clarity. Box score data for this game is available at https://www.basketball-reference.com/ boxscores/201411050PHO.html .",
"type_str": "figure",
"uris": null,
"num": null
},
"TABREF1": {
"type_str": "table",
"html": null,
"text": "GSML for 'The Denver Nuggets defeated the Miami Heat on Thursday . Jamal Murray had a game -high 30 points .'. These are annotated errors, as agreed for our gold standard. We will use the same tokenization scheme asWiseman et al. (2017).",
"num": null,
"content": "<table><tr><td>Once we have matched the RSM to the GSML,</td></tr><tr><td>we will compute a set of scores as follows:</td></tr></table>"
},
"TABREF2": {
"type_str": "table",
"html": null,
"text": "RML for the same text asTable 1, but annotated by a submitted method as: 'The Denver Nuggets defeated the Miami Heat on Thursday . Jamal Murray had a game -high 30 points .'. For each entry in the RML we show here the matching ID (if any) found in the GSML, as well as the match criteria.",
"num": null,
"content": "<table/>"
}
}
}
} |