File size: 102,936 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 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 | {
"paper_id": "P18-1015",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:38:14.727183Z"
},
"title": "Retrieve, Rerank and Rewrite: Soft Template Based Neural Summarization",
"authors": [
{
"first": "Ziqiang",
"middle": [],
"last": "Cao",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "The Hong Kong Polytechnic University",
"location": {
"settlement": "Hong Kong"
}
},
"email": ""
},
{
"first": "Wenjie",
"middle": [],
"last": "Li",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "The Hong Kong Polytechnic University",
"location": {
"settlement": "Hong Kong"
}
},
"email": ""
},
{
"first": "Furu",
"middle": [],
"last": "Wei",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Microsoft Research",
"location": {
"settlement": "Beijing",
"country": "China"
}
},
"email": "fuwei@microsoft.com"
},
{
"first": "Sujian",
"middle": [],
"last": "Li",
"suffix": "",
"affiliation": {
"laboratory": "Key Laboratory of Computational Linguistics",
"institution": "Peking University",
"location": {
"settlement": "MOE",
"country": "China"
}
},
"email": "lisujian@pku.edu.cn"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Most previous seq2seq summarization systems purely depend on the source text to generate summaries, which tends to work unstably. Inspired by the traditional template-based summarization approaches, this paper proposes to use existing summaries as soft templates to guide the seq2seq model. To this end, we use a popular IR platform to Retrieve proper summaries as candidate templates. Then, we extend the seq2seq framework to jointly conduct template Reranking and templateaware summary generation (Rewriting). Experiments show that, in terms of informativeness, our model significantly outperforms the state-of-the-art methods, and even soft templates themselves demonstrate high competitiveness. In addition, the import of high-quality external summaries improves the stability and readability of generated summaries.",
"pdf_parse": {
"paper_id": "P18-1015",
"_pdf_hash": "",
"abstract": [
{
"text": "Most previous seq2seq summarization systems purely depend on the source text to generate summaries, which tends to work unstably. Inspired by the traditional template-based summarization approaches, this paper proposes to use existing summaries as soft templates to guide the seq2seq model. To this end, we use a popular IR platform to Retrieve proper summaries as candidate templates. Then, we extend the seq2seq framework to jointly conduct template Reranking and templateaware summary generation (Rewriting). Experiments show that, in terms of informativeness, our model significantly outperforms the state-of-the-art methods, and even soft templates themselves demonstrate high competitiveness. In addition, the import of high-quality external summaries improves the stability and readability of generated summaries.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "The exponentially growing online information has necessitated the development of effective automatic summarization systems. In this paper, we focus on an increasingly intriguing task, i.e., abstractive sentence summarization (Rush et al., 2015a) , which generates a shorter version of a given sentence while attempting to preserve its original meaning. It can be used to design or refine appealing headlines. Recently, the application of the attentional sequence-to-sequence (seq2seq) framework has attracted growing attention and achieved state-of-the-art performance on this task (Rush et al., 2015a; Chopra et al., 2016; Nallapati et al., 2016) .",
"cite_spans": [
{
"start": 225,
"end": 245,
"text": "(Rush et al., 2015a)",
"ref_id": null
},
{
"start": 582,
"end": 602,
"text": "(Rush et al., 2015a;",
"ref_id": null
},
{
"start": 603,
"end": 623,
"text": "Chopra et al., 2016;",
"ref_id": "BIBREF7"
},
{
"start": 624,
"end": 647,
"text": "Nallapati et al., 2016)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Most previous seq2seq models purely depend on the source text to generate summaries. However, as reported in many studies (Koehn and Knowles, 2017) , the performance of a seq2seq model deteriorates quickly with the increase of the length of generation. Our experiments also show that seq2seq models tend to \"lose control\" sometimes. For example, 3% of summaries contain less than 3 words, while there are 4 summaries repeating a word for even 99 times. These results largely reduce the informativeness and readability of the generated summaries. In addition, we find seq2seq models usually focus on copying source words in order, without any actual \"summarization\". Therefore, we argue that, the free generation based on the source sentence is not enough for a seq2seq model.",
"cite_spans": [
{
"start": 122,
"end": 147,
"text": "(Koehn and Knowles, 2017)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Template based summarization (e.g., Zhou and Hovy (2004) ) is a traditional approach to abstractive summarization. In general, a template is an incomplete sentence which can be filled with the input text using the manually defined rules. For instance, a concise template to conclude the stock market quotation is: [REGION] shares [open/close] [NUMBER] percent [lower/higher], e.g., \"hong kong shares close #.# percent lower\". Since the templates are written by humans, the produced summaries are usually fluent and informative. However, the construction of templates is extremely time-consuming and requires a plenty of domain knowledge. Moreover, it is impossible to develop all templates for summaries in various domains.",
"cite_spans": [
{
"start": 36,
"end": 56,
"text": "Zhou and Hovy (2004)",
"ref_id": "BIBREF25"
},
{
"start": 314,
"end": 322,
"text": "[REGION]",
"ref_id": null
},
{
"start": 330,
"end": 342,
"text": "[open/close]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Inspired by retrieve-based conversation systems (Ji et al., 2014) , we assume the golden summaries of the similar sentences can provide a reference point to guide the input sentence summarization process. We call these existing summaries soft templates since no actual rules are nee-ded to build new summaries from them. Due to the strong rewriting ability of the seq2seq framework (Cao et al., 2017a) , in this paper, we propose to combine the seq2seq and template based summarization approaches. We call our summarization system Re 3 Sum, which consists of three modules: Retrieve, Rerank and Rewrite. We utilize a widely-used Information Retrieval (IR) platform to find out candidate soft templates from the training corpus. Then, we extend the seq2seq model to jointly learn template saliency measurement (Rerank) and final summary generation (Rewrite). Specifically, a Recurrent Neural Network (RNN) encoder is applied to convert the input sentence and each candidate template into hidden states. In Rerank, we measure the informativeness of a candidate template according to its hidden state relevance to the input sentence. The candidate template with the highest predicted informativeness is regarded as the actual soft template. In Rewrite, the summary is generated according to the hidden states of both the sentence and template.",
"cite_spans": [
{
"start": 48,
"end": 65,
"text": "(Ji et al., 2014)",
"ref_id": "BIBREF11"
},
{
"start": 382,
"end": 401,
"text": "(Cao et al., 2017a)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We conduct extensive experiments on the popular Gigaword dataset (Rush et al., 2015b) . Experiments show that, in terms of informativeness, Re 3 Sum significantly outperforms the state-ofthe-art seq2seq models, and even soft templates themselves demonstrate high competitiveness. In addition, the import of high-quality external summaries improves the stability and readability of generated summaries.",
"cite_spans": [
{
"start": 65,
"end": 85,
"text": "(Rush et al., 2015b)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The contributions of this work are summarized as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 We propose to introduce soft templates as additional input to improve the readability and stability of seq2seq summarization systems. Code and results can be found at http://www4.comp.polyu. edu.hk/\u02dccszqcao/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 We extend the seq2seq framework to conduct template reranking and template-aware summary generation simultaneously.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 We fuse the popular IR-based and seq2seqbased summarization systems, which fully utilize the supervisions from both sides.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "As shown in Fig. 1 , our summarization system consists of three modules, i.e., Retrieve, Rerank and Rewrite. Given the input sentence x, the Retrieve module filters candidate soft templates C = {r i } from the training corpus. For validation and test, we regard the candidate template with the highest predicted saliency (a.k.a informativeness) score as the actual soft template r. For training, we choose the one with the maximal actual saliency score in C, which speeds up convergence and shows no obvious side effect in the experiments. Then, we jointly conduct reranking and rewriting through a shared encoder. Specifically, both the sentence x and the soft template r are converted into hidden states with a RNN encoder. In the Rerank module, we measure the saliency of r according to its hidden state relevance to x. In the Rewrite module, a RNN decoder combines the hidden states of x and r to generate a summary y. More details will be described in the rest of this section",
"cite_spans": [],
"ref_spans": [
{
"start": 12,
"end": 18,
"text": "Fig. 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Method",
"sec_num": "2"
},
{
"text": "The purpose of this module is to find out candidate templates from the training corpus. We assume that similar sentences should hold similar summary patterns. Therefore, given a sentence x, we find out its analogies in the corpus and pick their summaries as the candidate templates. Since the size of our dataset is quite large (over 3M), we leverage the widely-used Information Retrieve (IR) system Lucene 1 to index and search efficiently. We keep the default settings of Lucene 2 to build the IR system. For each input sentence, we select top 30 searching results as candidate templates.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Retrieve",
"sec_num": "2.1"
},
{
"text": "To conduct template-aware seq2seq generation (rewriting), it is a necessary step to encode both the source sentence x and soft template r into hidden states. Considering that the matching networks based on hidden states have demonstrated the strong ability to measure the relevance of two pieces of texts (e.g., ), we propose to jointly conduct reranking and rewriting through a shared encoding step. Specifically, we employ a bidirectional Recurrent Neural Network (BiRNN) encoder to read x and r. Take the sentence x as an example. Its hidden state of the forward RNN at timestamp i can be Figure 1 : Flow chat of the proposed method. We use the dashed line for Retrieve since there is an IR system embedded.",
"cite_spans": [],
"ref_spans": [
{
"start": 592,
"end": 600,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Jointly Rerank and Rewrite",
"sec_num": "2.2"
},
{
"text": "represented by:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Jointly Rerank and Rewrite",
"sec_num": "2.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "\u2212 \u2192 h x i = RNN(x i , \u2212 \u2192 h x i\u22121 )",
"eq_num": "(1)"
}
],
"section": "Jointly Rerank and Rewrite",
"sec_num": "2.2"
},
{
"text": "The BiRNN consists of a forward RNN and a backward RNN. Suppose the corresponding outputs are",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Jointly Rerank and Rewrite",
"sec_num": "2.2"
},
{
"text": "[ \u2212 \u2192 h x 1 ; \u2022 \u2022 \u2022 ; \u2212 \u2192 h x \u22121 ] and [ \u2190 \u2212 h x 1 ; \u2022 \u2022 \u2022 ; \u2190 \u2212 h x \u22121 ]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Jointly Rerank and Rewrite",
"sec_num": "2.2"
},
{
"text": ", respectively, where the index \"\u22121\" stands for the last element. Then, the composite hidden state of a word is the concatenation of the two RNN representations, i.e., h",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Jointly Rerank and Rewrite",
"sec_num": "2.2"
},
{
"text": "x i = [ \u2212 \u2192 h x i ; \u2190 \u2212 h x i ].",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Jointly Rerank and Rewrite",
"sec_num": "2.2"
},
{
"text": "The entire representation for the source sentence is",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Jointly Rerank and Rewrite",
"sec_num": "2.2"
},
{
"text": "[h x 1 ; \u2022 \u2022 \u2022 ; h x \u22121 ]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Jointly Rerank and Rewrite",
"sec_num": "2.2"
},
{
"text": ". Since a soft template r can also be regarded as a readable concise sentence, we use the same BiRNN encoder to convert it into hidden states",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Jointly Rerank and Rewrite",
"sec_num": "2.2"
},
{
"text": "[h r 1 ; \u2022 \u2022 \u2022 ; h r \u22121 ].",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Jointly Rerank and Rewrite",
"sec_num": "2.2"
},
{
"text": "In Retrieve, the template candidates are ranked according to the text similarity between the corresponding indexed sentences and the input sentence. However, for the summarization task, we expect the soft template r resembles the actual summary y * as much as possible. Here we use the widely-used summarization evaluation metrics ROUGE (Lin, 2004) to measure the actual saliency s * (r, y * ) (see Section 3.2). We utilize the hidden states of x and r to predict the saliency s of the template. Specifically, we regard the output of the BiRNN as the representation of the sentence or template:",
"cite_spans": [
{
"start": 337,
"end": 348,
"text": "(Lin, 2004)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Rerank",
"sec_num": "2.2.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "h x = [ \u2190 \u2212 h x 1 ; \u2212 \u2192 h x \u22121 ] (2) h r = [ \u2190 \u2212 h r 1 ; \u2212 \u2192 h r \u22121 ]",
"eq_num": "(3)"
}
],
"section": "Rerank",
"sec_num": "2.2.1"
},
{
"text": "Next, we use Bilinear network to predict the saliency of the template for the input sentence.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Rerank",
"sec_num": "2.2.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "s(r, x) = sigmoid(h r W s h T x + b s ),",
"eq_num": "(4)"
}
],
"section": "Rerank",
"sec_num": "2.2.1"
},
{
"text": "where W s and b s are parameters of the Bilinear network, and we add the sigmoid activation function to make the range of s consistent with the actual saliency s * . According to , Bilinear outperforms multi-layer forward neural networks in relevance measurement. As shown later, the difference of s and s * will provide additional supervisions for the seq2seq framework.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Rerank",
"sec_num": "2.2.1"
},
{
"text": "The soft template r selected by the Rerank module has already competed with the state-of-the-art method in terms of ROUGE evaluation (see Table 4 ). However, r usually contains a lot of named entities that does not appear in the source (see Table 5 ). Consequently, it is hard to ensure that the soft templates are faithful to the input sentences. Therefore, we leverage the strong rewriting ability of the seq2seq model to generate more faithful and informative summaries. Specifically, since the input of our system consists of both the sentence and soft template, we use the concatenation function 3 to combine the hidden states of the sentence and template:",
"cite_spans": [],
"ref_spans": [
{
"start": 138,
"end": 145,
"text": "Table 4",
"ref_id": "TABREF4"
},
{
"start": 241,
"end": 248,
"text": "Table 5",
"ref_id": "TABREF5"
}
],
"eq_spans": [],
"section": "Rewrite",
"sec_num": "2.2.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "H c = [h x 1 ; \u2022 \u2022 \u2022 ; h x \u22121 ; h r 1 ; \u2022 \u2022 \u2022 ; h r \u22121 ]",
"eq_num": "(5)"
}
],
"section": "Rewrite",
"sec_num": "2.2.2"
},
{
"text": "The combined hidden states are fed into the prevailing attentional RNN decoder to generate the decoding hidden state at the position t:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Rewrite",
"sec_num": "2.2.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "s t = Att-RNN(s t\u22121 , y t\u22121 , H c ),",
"eq_num": "(6)"
}
],
"section": "Rewrite",
"sec_num": "2.2.2"
},
{
"text": "where y t\u22121 is the previous output summary word. Finally, a sof tmax layer is introduced to predict the current summary word:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Rewrite",
"sec_num": "2.2.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "o t = sof tmax(s t W o ),",
"eq_num": "(7)"
}
],
"section": "Rewrite",
"sec_num": "2.2.2"
},
{
"text": "where W o is a parameter matrix.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Rewrite",
"sec_num": "2.2.2"
},
{
"text": "There are two types of costs in our system. For Rerank, we expect the predicted saliency s(r, x) close to the actual saliency s * (r, y * ). Therefore, ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Learning",
"sec_num": "2.3"
},
{
"text": "J R (\u03b8) = CE(s(r, x), s * (r, y * )) (8) = \u2212s * log s \u2212 (1 \u2212 s * ) log(1 \u2212 s),",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Learning",
"sec_num": "2.3"
},
{
"text": "where \u03b8 stands for the model parameters. For Rewrite, the learning goal is to maximize the estimated probability of the actual summary y * . We adopt the common negative log-likelihood (NLL) as the loss function:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Learning",
"sec_num": "2.3"
},
{
"text": "J G (\u03b8) = \u2212 log(p(y * |x, r)) (9) = \u2212 t log(o t [y * t ])",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Learning",
"sec_num": "2.3"
},
{
"text": "To make full use of supervisions from both sides, we combine the above two costs as the final loss function:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Learning",
"sec_num": "2.3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "J(\u03b8) = J R (\u03b8) + J G (\u03b8)",
"eq_num": "(10)"
}
],
"section": "Learning",
"sec_num": "2.3"
},
{
"text": "We use mini-batch Stochastic Gradient Descent (SGD) to tune model parameters. The batch size is 64. To enhance generalization, we introduce dropout (Srivastava et al., 2014) with probability p = 0.3 for the RNN layers. The initial learning rate is 1, and it will decay by 50% if the generation loss does not decrease on the validation set.",
"cite_spans": [
{
"start": 148,
"end": 173,
"text": "(Srivastava et al., 2014)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Learning",
"sec_num": "2.3"
},
{
"text": "We conduct experiments on the Annotated English Gigaword corpus, as with (Rush et al., 2015b) . This parallel corpus is produced by pairing the first sentence in the news article and its headline as the summary with heuristic rules. All the training, development and test datasets can be downloaded at https://github. com/harvardnlp/sent-summary. The statistics of the Gigaword corpus is presented in Ta AvgSourceLen is the average input sentence length and AvgTargetLen is the average summary length. COPY means the copy ratio in the summaries (without stopwords).",
"cite_spans": [
{
"start": 73,
"end": 93,
"text": "(Rush et al., 2015b)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [
{
"start": 401,
"end": 403,
"text": "Ta",
"ref_id": null
}
],
"eq_spans": [],
"section": "Datasets",
"sec_num": "3.1"
},
{
"text": "We adopt ROUGE (Lin, 2004) for automatic evaluation. ROUGE has been the standard evaluation metric for DUC shared tasks since 2004. It measures the quality of summary by computing the overlapping lexical units between the candidate summary and actual summaries, such as unigram, bi-gram and longest common subsequence (LCS). Following the common practice, we report ROUGE-1 (uni-gram), ROUGE-2 (bi-gram) and ROUGE-L (LCS) F1 scores 4 in the following experiments. We also measure the actual saliency of a candidate template r with its combined ROUGE scores given the actual summary y * :",
"cite_spans": [
{
"start": 15,
"end": 26,
"text": "(Lin, 2004)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Metrics",
"sec_num": "3.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "s * (r, y * ) = RG(r, y * ) + RG(r, y * ),",
"eq_num": "(11)"
}
],
"section": "Evaluation Metrics",
"sec_num": "3.2"
},
{
"text": "where \"RG\" stands for ROUGE for short. ROUGE mainly evaluates informativeness. We also introduce a series of metrics to measure the summary quality from the following aspects: LEN DIF The absolute value of the length difference between the generated summaries and the actual summaries. We use mean value \u00b1 standard deviation to illustrate this item. The average value partially reflects the readability and informativeness, while the standard deviation links to stability.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Metrics",
"sec_num": "3.2"
},
{
"text": "LESS 3 The number of the generated summaries, which contains less than three tokens. These extremely short summaries are usually unreadable. COPY The proportion of the summary words (without stopwords) copied from the source sentence. A seriously large copy ratio indicates that the summarization system pays more attention to compression rather than required abstraction. NEW NE The number of the named entities that do not appear in the source sentence or actual summary. Intuitively, the appearance of new named entities in the summary is likely to bring unfaithfulness. We use Stanford Co-reNLP (Manning et al., 2014) to recognize named entities.",
"cite_spans": [
{
"start": 599,
"end": 621,
"text": "(Manning et al., 2014)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Metrics",
"sec_num": "3.2"
},
{
"text": "We use the popular seq2seq framework Open-NMT 5 as the starting point. To make our model more general, we retain the default settings of OpenNMT to build the network architecture. Specifically, the dimensions of word embeddings and RNN are both 500, and the encoder and decoder structures are two-layer bidirectional Long Short Term Memory Networks (LSTMs). The only difference is that we add the argument \"share embeddings\" to share the word embeddings between the encoder and decoder. This practice largely reduces model parameters for the monolingual task. On our computer (GPU: GTX 1080, Memory: 16G, CPU: i7-7700K), the training spends about 2 days. During test, we use beam search of size 5 to generate summaries. We add the argument \"replace unk\" to replace the generated unknown words with the source word that holds the highest attention weight. Since the generated summaries are often shorter than the actual ones, we introduce an additional length penalty argument \"alpha 1\" to encourage longer generation, like Wu et al. (2016) .",
"cite_spans": [
{
"start": 1023,
"end": 1039,
"text": "Wu et al. (2016)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Implementation Details",
"sec_num": "3.3"
},
{
"text": "We compare our proposed model with the following state-of-the-art neural summarization systems: ABS Rush et al. (2015a) used an attentive CNN encoder and a NNLM decoder to summarize 5 https://github.com/OpenNMT/OpenNMT-py the sentence. ABS+ Rush et al. (2015a) further tuned the ABS model with additional hand-crafted features to balance between abstraction and extraction. RAS-Elman As the extension of the ABS model, it used a convolutional attention-based encoder and a RNN decoder (Chopra et al., 2016) . 2015for summarization. This model contained two-layer LSTMs with 500 hidden units in each layer. OpenNMT We also implement the standard attentional seq2seq model with OpenNMT. All the settings are the same as our system. It is noted that OpenNMT officially examined the Gigaword dataset. We distinguish the official result 6 and our experimental result with suffixes \"O\" and \"I\" respectively. FTSum Cao et al. (2017b) encoded the facts extracted from the source sentence to improve both the faithfulness and informativeness of generated summaries. In addition, to evaluate the effectiveness of our joint learning framework, we develop a baseline named \"PIPELINE\". Its architecture is identical to Re 3 Sum. However, it trains the Rerank module and Rewrite module in pipeline. We also examine the performance of directly regarding soft templates as output summaries. We introduce five types of different soft templates: Random An existing summary randomly selected from the training corpus. First The top-ranked candidate template given by the Retrieve module. Max The template with the maximal actual ROUGE scores among the 30 candidate templates. Optimal An existing summary in the training corpus which holds the maximal ROUGE scores. Rerank The template with the maximal predicted ROUGE scores among the 30 candidate templates. It is the actual soft template we adopt. As shown in Table 4 , the performance of Random is terrible, indicating it is impossible to use one summary template to fit various actual summaries. Rerank largely outperforms First, which verifies the effectiveness of the Rerank module. However, according to Max and Rerank, we find the Rerank performance of Re 3 Sum is far from perfect. Likewise, comparing Max and First, we observe that the improving capacity of the Retrieve module is high. Notice that Optimal greatly exceeds all the state-of-the-art approaches. This finding strongly supports our practice of using existing summaries to guide the seq2seq models.",
"cite_spans": [
{
"start": 241,
"end": 260,
"text": "Rush et al. (2015a)",
"ref_id": null
},
{
"start": 485,
"end": 506,
"text": "(Chopra et al., 2016)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [
{
"start": 1893,
"end": 1900,
"text": "Table 4",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "Baselines",
"sec_num": "3.4"
},
{
"text": "We also measure the linguistic quality of generated summaries from various aspects, and the results are present in Table 5 . As can be seen from the rows \"LEN DIF\" and \"LESS 3\", the performance of Re 3 Sum is almost the same as that of soft templates. The soft templates indeed well guide the summary generation. Compared with Source grid positions after the final qualifying session in the indonesian motorcycle grand prix at the sentul circuit , west java , saturday : UNK Target indonesian motorcycle grand prix grid positions Template grid positions for british grand prix OpenNMT circuit Re 3 Sum grid positions for indonesian grand prix Source india 's children are getting increasingly overweight and unhealthy and the government is asking schools to ban junk food , officials said thursday . Target indian government asks schools to ban junk food Template skorean schools to ban soda junk food OpenNMT india 's children getting fatter Re 3 Sum indian schools to ban junk food Table 7 : Examples of generated summaries. We use Bold font to indicate the crucial rewriting behavior from the templates to generated summaries.",
"cite_spans": [],
"ref_spans": [
{
"start": 115,
"end": 122,
"text": "Table 5",
"ref_id": "TABREF5"
},
{
"start": 984,
"end": 991,
"text": "Table 7",
"ref_id": null
}
],
"eq_spans": [],
"section": "Linguistic Quality Evaluation",
"sec_num": "3.6"
},
{
"text": "Re 3 Sum, the standard deviation of LEN DF is 0.7 times larger in OpenNMT, indicating that Open-NMT works quite unstably. Moreover, OpenNMT generates 53 extreme short summaries, which seriously reduces readability. Meanwhile, the copy ratio of actual summaries is 36%. Therefore, the copy mechanism is severely overweighted in OpenNMT. Our model is encouraged to generate according to human-written soft templates, which relatively diminishes copying from the source sentences. Look at the last row \"NEW NE\". A number of new named entities appear in the soft templates, which makes them quite unfaithful to source sentences. By contrast, this index in Re 3 Sum is close to the OpenNMT's. It highlights the rewriting ability of our seq2seq framework.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Linguistic Quality Evaluation",
"sec_num": "3.6"
},
{
"text": "In this section, we investigate how soft templates affect our model. At the beginning, we feed different types of soft templates (refer to Table 4 ) into the Rewriting module of Re 3 Sum. As illustrated in Table 6 , the more high-quality templates are provided, the higher ROUGE scores are achieved. It is interesting to see that,while the ROUGE-2 score of Random templates is zero, our model can still generate acceptable summaries with Random templates. It seems that Re 3 Sum can automatically judge whether the soft templates are trustworthy and ignore the seriously irrelevant ones. We believe that the joint learning with the Rerank model plays a vital role here. Next, we manually inspect the summaries generated by different methods. We find the outputs of Re 3 Sum are usually longer and more flu-ent than the outputs of OpenNMT. Some illustrative examples are shown in Table 7 . In Example 1, there is no predicate in the source sentence. Since OpenNMT prefers selecting source words around the predicate to form the summary, it fails on this sentence. By contract, Re 3 Sum rewrites the template and produces an informative summary. In Example 2, OpenNMT deems the starting part of the sentences are more important, while our model, guided by the template, focuses on the second part to generate the summary.",
"cite_spans": [],
"ref_spans": [
{
"start": 136,
"end": 146,
"text": "to Table 4",
"ref_id": "TABREF4"
},
{
"start": 206,
"end": 213,
"text": "Table 6",
"ref_id": null
},
{
"start": 879,
"end": 886,
"text": "Table 7",
"ref_id": null
}
],
"eq_spans": [],
"section": "Effect of Templates",
"sec_num": "3.7"
},
{
"text": "In the end, we test the ability of our model to generate diverse summaries. In practice, a system that can provide various candidate summaries is probably more welcome. Specifically, two candidate templates with large text dissimilarity are manually fed into the Rewriting module. The corresponding generated summaries are shown in Table 8. For the sake of comparison, we also present the 2-best results of OpenNMT with beam search. As can be seen, with different templates given, our model is likely to generate dissimilar summaries. In contrast, the 2-best results of OpenNMT is almost the same, and often a shorter summary is only a piece of the other one. To sum up, our model demonstrates promising prospect in generation diversity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Effect of Templates",
"sec_num": "3.7"
},
{
"text": "Abstractive sentence summarization aims to produce a shorter version of a given sentence while preserving its meaning (Chopra et al., 2016) . This task is similar to text simplification (Saggion, 2017) and facilitates headline design and refine. Early studies on sentence summariza-Source anny ainge said thursday he had two one-hour meetings with the new owners of the boston celtics but no deal has been completed for him to return to the franchise . (Zhou and Hovy, 2004) , syntactic tree pruning (Knight and Marcu, 2002; Clarke and Lapata, 2008) and statistical machine translation techniques (Banko et al., 2000) . Recently, the application of the attentional seq2seq framework has attracted growing attention and achieved state-of-the-art performance on this task (Rush et al., 2015a; Chopra et al., 2016; Nallapati et al., 2016) .",
"cite_spans": [
{
"start": 118,
"end": 139,
"text": "(Chopra et al., 2016)",
"ref_id": "BIBREF7"
},
{
"start": 453,
"end": 474,
"text": "(Zhou and Hovy, 2004)",
"ref_id": "BIBREF25"
},
{
"start": 500,
"end": 524,
"text": "(Knight and Marcu, 2002;",
"ref_id": "BIBREF12"
},
{
"start": 525,
"end": 549,
"text": "Clarke and Lapata, 2008)",
"ref_id": "BIBREF8"
},
{
"start": 597,
"end": 617,
"text": "(Banko et al., 2000)",
"ref_id": "BIBREF2"
},
{
"start": 770,
"end": 790,
"text": "(Rush et al., 2015a;",
"ref_id": null
},
{
"start": 791,
"end": 811,
"text": "Chopra et al., 2016;",
"ref_id": "BIBREF7"
},
{
"start": 812,
"end": 835,
"text": "Nallapati et al., 2016)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "4"
},
{
"text": "In addition to the direct application of the general seq2seq framework, researchers attempted to integrate various properties of summarization. For example, Nallapati et al. (2016) enriched the encoder with hand-crafted features such as named entities and POS tags. These features have played important roles in traditional feature based summarization systems. Gu et al. (2016) found that a large proportion of the words in the summary were copied from the source text. Therefore, they proposed CopyNet which considered the copying mechanism during generation. Recently, See et al. (2017) used the coverage mechanism to discourage repetition. Cao et al. (2017b) encoded facts extracted from the source sentence to enhance the summary faithfulness. There were also studies to modify the loss function to fit the evaluation metrics. For instance, Ayana et al. (2016) applied the Minimum Risk Training strategy to maximize the ROUGE scores of generated sum-maries. Paulus et al. (2017) used the reinforcement learning algorithm to optimize a mixed objective function of likelihood and ROUGE scores. Guu et al. (2017) also proposed to encode human-written sentences to improvement the performance of neural text generation. However, they handled the task of Language Modeling and randomly picked an existing sentence in the training corpus. In comparison, we develop an IR system to find proper existing summaries as soft templates. Moreover, Guu et al. (2017) used a general seq2seq framework while we extend the seq2seq framework to conduct template reranking and template-aware summary generation simultaneously.",
"cite_spans": [
{
"start": 157,
"end": 180,
"text": "Nallapati et al. (2016)",
"ref_id": "BIBREF17"
},
{
"start": 361,
"end": 377,
"text": "Gu et al. (2016)",
"ref_id": "BIBREF9"
},
{
"start": 571,
"end": 588,
"text": "See et al. (2017)",
"ref_id": "BIBREF22"
},
{
"start": 643,
"end": 661,
"text": "Cao et al. (2017b)",
"ref_id": "BIBREF4"
},
{
"start": 962,
"end": 982,
"text": "Paulus et al. (2017)",
"ref_id": "BIBREF18"
},
{
"start": 1096,
"end": 1113,
"text": "Guu et al. (2017)",
"ref_id": "BIBREF10"
},
{
"start": 1439,
"end": 1456,
"text": "Guu et al. (2017)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "4"
},
{
"text": "This paper proposes to introduce soft templates as additional input to guide the seq2seq summarization. We use the popular IR platform Lucene to retrieve proper existing summaries as candidate soft templates. Then we extend the seq2seq framework to jointly conduct template reranking and template-aware summary generation. Experiments show that our model can generate informative, readable and stable summaries. In addition, our model demonstrates promising prospect in generation diversity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "5"
},
{
"text": "We believe our work can be extended in vari-ous aspects. On the one hand, since the candidate templates are far inferior to the optimal ones, we intend to improve the Retrieve module, e.g., by indexing both the sentence and summary fields. On the other hand, we plan to test our system on the other tasks such as document-level summarization and short text conversation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion and Future Work",
"sec_num": "5"
},
{
"text": "https://lucene.apache.org/ 2 TextField with EnglishAnalyzer",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We also attempted complex combination approaches such as the gate network Cao et al. (2017b) but failed to achieve obvious improvement. We assume the Rerank module has partially played the role of the gate network.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We use the ROUGE evaluation option: -m -n 2 -w 1.2",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "http://opennmt.net/Models/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "The work described in this paper was supported by Research Grants Council of Hong Kong (PolyU 152036/17E), National Natural Science Foundation of China (61672445 and 61572049) and The Hong Kong Polytechnic University (G-YBP6, 4-BCDV).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Neural headline generation with minimum risk training",
"authors": [
{
"first": "Zhiyuan",
"middle": [],
"last": "Shiqi Shen Ayana",
"suffix": ""
},
{
"first": "Maosong",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Sun",
"suffix": ""
}
],
"year": 2016,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1604.01904"
]
},
"num": null,
"urls": [],
"raw_text": "Shiqi Shen Ayana, Zhiyuan Liu, and Maosong Sun. 2016. Neural headline generation with minimum risk training. arXiv preprint arXiv:1604.01904.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Neural machine translation by jointly learning to align and translate",
"authors": [
{
"first": "Dzmitry",
"middle": [],
"last": "Bahdanau",
"suffix": ""
},
{
"first": "Kyunghyun",
"middle": [],
"last": "Cho",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1409.0473"
]
},
"num": null,
"urls": [],
"raw_text": "Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Ben- gio. 2014. Neural machine translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Headline generation based on statistical translation",
"authors": [
{
"first": "Michele",
"middle": [],
"last": "Banko",
"suffix": ""
},
{
"first": "O",
"middle": [],
"last": "Vibhu",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"J"
],
"last": "Mittal",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Witbrock",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of the 38th Annual Meeting on Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "318--325",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michele Banko, Vibhu O Mittal, and Michael J Wit- brock. 2000. Headline generation based on statisti- cal translation. In Proceedings of the 38th Annual Meeting on Association for Computational Linguis- tics, pages 318-325. Association for Computational Linguistics.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Joint copying and restricted generation for paraphrase",
"authors": [
{
"first": "Ziqiang",
"middle": [],
"last": "Cao",
"suffix": ""
},
{
"first": "Chuwei",
"middle": [],
"last": "Luo",
"suffix": ""
},
{
"first": "Wenjie",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Sujian",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2017,
"venue": "AAAI",
"volume": "",
"issue": "",
"pages": "3152--3158",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ziqiang Cao, Chuwei Luo, Wenjie Li, and Sujian Li. 2017a. Joint copying and restricted generation for paraphrase. In AAAI, pages 3152-3158.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Faithful to the original: Fact aware neural abstractive summarization",
"authors": [
{
"first": "Ziqiang",
"middle": [],
"last": "Cao",
"suffix": ""
},
{
"first": "Furu",
"middle": [],
"last": "Wei",
"suffix": ""
},
{
"first": "Wenjie",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Sujian",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1711.04434"
]
},
"num": null,
"urls": [],
"raw_text": "Ziqiang Cao, Furu Wei, Wenjie Li, and Sujian Li. 2017b. Faithful to the original: Fact aware neural abstractive summarization. arXiv preprint arXiv:1711.04434.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "A thorough examination of the cnn/daily mail reading comprehension task",
"authors": [
{
"first": "Danqi",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Jason",
"middle": [],
"last": "Bolton",
"suffix": ""
},
{
"first": "Christopher D",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2016,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1606.02858"
]
},
"num": null,
"urls": [],
"raw_text": "Danqi Chen, Jason Bolton, and Christopher D Man- ning. 2016. A thorough examination of the cnn/daily mail reading comprehension task. arXiv preprint arXiv:1606.02858.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Learning phrase representations using rnn encoder-decoder for statistical machine translation",
"authors": [
{
"first": "Kyunghyun",
"middle": [],
"last": "Cho",
"suffix": ""
},
{
"first": "Bart",
"middle": [],
"last": "Van Merri\u00ebnboer",
"suffix": ""
},
{
"first": "Caglar",
"middle": [],
"last": "Gulcehre",
"suffix": ""
},
{
"first": "Dzmitry",
"middle": [],
"last": "Bahdanau",
"suffix": ""
},
{
"first": "Fethi",
"middle": [],
"last": "Bougares",
"suffix": ""
},
{
"first": "Holger",
"middle": [],
"last": "Schwenk",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1406.1078"
]
},
"num": null,
"urls": [],
"raw_text": "Kyunghyun Cho, Bart Van Merri\u00ebnboer, Caglar Gul- cehre, Dzmitry Bahdanau, Fethi Bougares, Holger Schwenk, and Yoshua Bengio. 2014. Learning phrase representations using rnn encoder-decoder for statistical machine translation. arXiv preprint arXiv:1406.1078.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Abstractive sentence summarization with attentive recurrent neural networks",
"authors": [
{
"first": "Sumit",
"middle": [],
"last": "Chopra",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Auli",
"suffix": ""
},
{
"first": "Alexander",
"middle": [
"M"
],
"last": "Rush",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Harvard",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of NAACL-HLT16",
"volume": "",
"issue": "",
"pages": "93--98",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sumit Chopra, Michael Auli, Alexander M Rush, and SEAS Harvard. 2016. Abstractive sentence sum- marization with attentive recurrent neural networks. Proceedings of NAACL-HLT16, pages 93-98.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Global inference for sentence compression: An integer linear programming approach",
"authors": [
{
"first": "James",
"middle": [],
"last": "Clarke",
"suffix": ""
},
{
"first": "Mirella",
"middle": [],
"last": "Lapata",
"suffix": ""
}
],
"year": 2008,
"venue": "Journal of Artificial Intelligence Research",
"volume": "31",
"issue": "",
"pages": "399--429",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "James Clarke and Mirella Lapata. 2008. Global infe- rence for sentence compression: An integer linear programming approach. Journal of Artificial Intelli- gence Research, 31:399-429.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Incorporating copying mechanism in sequence-to-sequence learning",
"authors": [
{
"first": "Jiatao",
"middle": [],
"last": "Gu",
"suffix": ""
},
{
"first": "Zhengdong",
"middle": [],
"last": "Lu",
"suffix": ""
},
{
"first": "Hang",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "O",
"middle": [
"K"
],
"last": "Victor",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2016,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1603.06393"
]
},
"num": null,
"urls": [],
"raw_text": "Jiatao Gu, Zhengdong Lu, Hang Li, and Victor OK Li. 2016. Incorporating copying mechanism in sequence-to-sequence learning. arXiv preprint arXiv:1603.06393.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Generating sentences by editing prototypes",
"authors": [
{
"first": "Kelvin",
"middle": [],
"last": "Guu",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Tatsunori",
"suffix": ""
},
{
"first": "Yonatan",
"middle": [],
"last": "Hashimoto",
"suffix": ""
},
{
"first": "Percy",
"middle": [],
"last": "Oren",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Liang",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1709.08878"
]
},
"num": null,
"urls": [],
"raw_text": "Kelvin Guu, Tatsunori B Hashimoto, Yonatan Oren, and Percy Liang. 2017. Generating senten- ces by editing prototypes. arXiv preprint arXiv:1709.08878.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "An information retrieval approach to short text conversation",
"authors": [
{
"first": "Zongcheng",
"middle": [],
"last": "Ji",
"suffix": ""
},
{
"first": "Zhengdong",
"middle": [],
"last": "Lu",
"suffix": ""
},
{
"first": "Hang",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1408.6988"
]
},
"num": null,
"urls": [],
"raw_text": "Zongcheng Ji, Zhengdong Lu, and Hang Li. 2014. An information retrieval approach to short text conver- sation. arXiv preprint arXiv:1408.6988.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Summarization beyond sentence extraction: A probabilistic approach to sentence compression",
"authors": [
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Marcu",
"suffix": ""
}
],
"year": 2002,
"venue": "Artificial Intelligence",
"volume": "139",
"issue": "1",
"pages": "91--107",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kevin Knight and Daniel Marcu. 2002. Summarization beyond sentence extraction: A probabilistic appro- ach to sentence compression. Artificial Intelligence, 139(1):91-107.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Six challenges for neural machine translation",
"authors": [
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "Rebecca",
"middle": [],
"last": "Knowles",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1706.03872"
]
},
"num": null,
"urls": [],
"raw_text": "Philipp Koehn and Rebecca Knowles. 2017. Six chal- lenges for neural machine translation. arXiv pre- print arXiv:1706.03872.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Rouge: A package for automatic evaluation of summaries",
"authors": [
{
"first": "Chin-Yew",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the ACL Workshop",
"volume": "",
"issue": "",
"pages": "74--81",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chin-Yew Lin. 2004. Rouge: A package for automatic evaluation of summaries. In Proceedings of the ACL Workshop, pages 74-81.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Effective approaches to attentionbased neural machine translation",
"authors": [
{
"first": "Minh-Thang",
"middle": [],
"last": "Luong",
"suffix": ""
},
{
"first": "Hieu",
"middle": [],
"last": "Pham",
"suffix": ""
},
{
"first": "Christopher D",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2015,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1508.04025"
]
},
"num": null,
"urls": [],
"raw_text": "Minh-Thang Luong, Hieu Pham, and Christopher D Manning. 2015. Effective approaches to attention- based neural machine translation. arXiv preprint arXiv:1508.04025.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "The Stanford CoreNLP natural language processing toolkit",
"authors": [
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
},
{
"first": "Mihai",
"middle": [],
"last": "Surdeanu",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Bauer",
"suffix": ""
},
{
"first": "Jenny",
"middle": [],
"last": "Finkel",
"suffix": ""
},
{
"first": "Steven",
"middle": [
"J"
],
"last": "Bethard",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Mcclosky",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of ACL: System Demonstrations",
"volume": "",
"issue": "",
"pages": "55--60",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Christopher D. Manning, Mihai Surdeanu, John Bauer, Jenny Finkel, Steven J. Bethard, and David McClosky. 2014. The Stanford CoreNLP natural language processing toolkit. In Proceedings of ACL: System Demonstrations, pages 55-60.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Abstractive text summarization using sequence-to-sequence rnns and beyond",
"authors": [
{
"first": "Ramesh",
"middle": [],
"last": "Nallapati",
"suffix": ""
},
{
"first": "Bowen",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Caglar",
"middle": [],
"last": "Gulcehre",
"suffix": ""
},
{
"first": "Bing",
"middle": [],
"last": "Xiang",
"suffix": ""
}
],
"year": 2016,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1602.06023"
]
},
"num": null,
"urls": [],
"raw_text": "Ramesh Nallapati, Bowen Zhou, Caglar Gulcehre, Bing Xiang, et al. 2016. Abstractive text summari- zation using sequence-to-sequence rnns and beyond. arXiv preprint arXiv:1602.06023.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "A deep reinforced model for abstractive summarization",
"authors": [
{
"first": "Romain",
"middle": [],
"last": "Paulus",
"suffix": ""
},
{
"first": "Caiming",
"middle": [],
"last": "Xiong",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Socher",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1705.04304"
]
},
"num": null,
"urls": [],
"raw_text": "Romain Paulus, Caiming Xiong, and Richard Socher. 2017. A deep reinforced model for abstractive sum- marization. arXiv preprint arXiv:1705.04304.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Sumit Chopra, and Jason Weston. 2015a. A neural attention model for abstractive sentence summarization",
"authors": [
{
"first": "M",
"middle": [],
"last": "Alexander",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Rush",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1509.00685"
]
},
"num": null,
"urls": [],
"raw_text": "Alexander M Rush, Sumit Chopra, and Jason Wes- ton. 2015a. A neural attention model for ab- stractive sentence summarization. arXiv preprint arXiv:1509.00685.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "A neural attention model for abstractive sentence summarization",
"authors": [
{
"first": "Alexander",
"middle": [
"M"
],
"last": "Rush",
"suffix": ""
},
{
"first": "Sumit",
"middle": [],
"last": "Chopra",
"suffix": ""
},
{
"first": "Jason",
"middle": [],
"last": "Weston",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of EMNLP",
"volume": "",
"issue": "",
"pages": "379--389",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alexander M. Rush, Sumit Chopra, and Jason Weston. 2015b. A neural attention model for abstractive sen- tence summarization. In Proceedings of EMNLP, pages 379-389.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Automatic text simplification",
"authors": [],
"year": 2017,
"venue": "Synthesis Lectures on Human Language Technologies",
"volume": "10",
"issue": "1",
"pages": "1--137",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Horacio Saggion. 2017. Automatic text simplification. Synthesis Lectures on Human Language Technolo- gies, 10(1):1-137.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Get to the point: Summarization with pointer-generator networks",
"authors": [
{
"first": "Abigail",
"middle": [],
"last": "See",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Peter",
"suffix": ""
},
{
"first": "Christopher D",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1704.04368"
]
},
"num": null,
"urls": [],
"raw_text": "Abigail See, Peter J Liu, and Christopher D Man- ning. 2017. Get to the point: Summarization with pointer-generator networks. arXiv preprint arXiv:1704.04368.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Dropout: a simple way to prevent neural networks from overfitting",
"authors": [
{
"first": "Nitish",
"middle": [],
"last": "Srivastava",
"suffix": ""
},
{
"first": "Geoffrey",
"middle": [
"E"
],
"last": "Hinton",
"suffix": ""
},
{
"first": "Alex",
"middle": [],
"last": "Krizhevsky",
"suffix": ""
},
{
"first": "Ilya",
"middle": [],
"last": "Sutskever",
"suffix": ""
},
{
"first": "Ruslan",
"middle": [],
"last": "Salakhutdinov",
"suffix": ""
}
],
"year": 2014,
"venue": "Journal of Machine Learning Research",
"volume": "15",
"issue": "1",
"pages": "1929--1958",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nitish Srivastava, Geoffrey E Hinton, Alex Krizhev- sky, Ilya Sutskever, and Ruslan Salakhutdinov. 2014. Dropout: a simple way to prevent neural networks from overfitting. Journal of Machine Learning Re- search, 15(1):1929-1958.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Google's neural machine translation system: Bridging the gap between human and machine translation",
"authors": [
{
"first": "Yonghui",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "Schuster",
"suffix": ""
},
{
"first": "Zhifeng",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "V",
"middle": [],
"last": "Quoc",
"suffix": ""
},
{
"first": "Mohammad",
"middle": [],
"last": "Le",
"suffix": ""
},
{
"first": "Wolfgang",
"middle": [],
"last": "Norouzi",
"suffix": ""
},
{
"first": "Maxim",
"middle": [],
"last": "Macherey",
"suffix": ""
},
{
"first": "Yuan",
"middle": [],
"last": "Krikun",
"suffix": ""
},
{
"first": "Qin",
"middle": [],
"last": "Cao",
"suffix": ""
},
{
"first": "Klaus",
"middle": [],
"last": "Gao",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Macherey",
"suffix": ""
}
],
"year": 2016,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1609.08144"
]
},
"num": null,
"urls": [],
"raw_text": "Yonghui Wu, Mike Schuster, Zhifeng Chen, Quoc V Le, Mohammad Norouzi, Wolfgang Macherey, Maxim Krikun, Yuan Cao, Qin Gao, Klaus Mache- rey, et al. 2016. Google's neural machine translation system: Bridging the gap between human and ma- chine translation. arXiv preprint arXiv:1609.08144.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Template-filtered headline summarization. Text Summarization Branches Out",
"authors": [
{
"first": "Liang",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Eduard",
"middle": [],
"last": "Hovy",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liang Zhou and Eduard Hovy. 2004. Template-filtered headline summarization. Text Summarization Bran- ches Out.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Jointly Rerank and Rewrite we use the cross entropy (CE) between s and s * as the loss function:",
"type_str": "figure",
"uris": null,
"num": null
},
"FIGREF1": {
"text": "Nallapati et al. (2016) used a complete seq2seq RNN model and added the hand-crafted features such as POS tag and NER, to enhance the encoder representation.Luong-NMT Chopra et al. (2016) implemented the neural machine translation model of Luong et al.",
"type_str": "figure",
"uris": null,
"num": null
},
"TABREF1": {
"text": "Data statistics for English Gigaword.",
"num": null,
"html": null,
"content": "<table/>",
"type_str": "table"
},
"TABREF2": {
"text": "11.32 * 26.42 * ABS+ \u2020 29.78 * 11.89 * 26.97 * Featseq2seq \u2020 32.67 * 15.59 * 30.64 * RAS-Elman \u2020 33.78 * 15.97 * 31.15 * Luong-NMT \u2020 33.10 * 14.45 * 30.71 * 16.09 * 31.00 * OpenNMT I 35.01 * 16.55 * 32.42",
"num": null,
"html": null,
"content": "<table><tr><td>Model</td><td>RG-1</td><td>RG-2</td><td>RG-L</td></tr><tr><td colspan=\"2\">ABS \u2020 29.55 FTSum \u2020 37.27</td><td colspan=\"2\">17.65 * 34.24</td></tr><tr><td colspan=\"2\">OpenNMT \u2020 O 33.13 PIPELINE 36.49</td><td colspan=\"2\">17.48 * 33.90</td></tr><tr><td>Re 3 Sum</td><td>37.04</td><td>19.03</td><td>34.46</td></tr><tr><td/><td/><td/><td/><td>Perplexity</td></tr><tr><td/><td/><td/><td>ABS \u2020</td><td>27.1</td></tr><tr><td/><td/><td/><td colspan=\"2\">RAS-Elman \u2020 18.9</td></tr><tr><td/><td/><td/><td>FTSum \u2020</td><td>16.4</td></tr><tr><td/><td/><td/><td>OpenNMT I</td><td>13.2</td></tr><tr><td/><td/><td/><td>PIPELINE</td><td>12.5</td></tr><tr><td/><td/><td/><td>Re 3 Sum</td><td>12.9</td></tr><tr><td/><td/><td/><td colspan=\"2\">Table 2: Final perplexity on the development set. \u2020</td></tr><tr><td/><td/><td/><td colspan=\"2\">indicates the value is cited from the corresponding</td></tr><tr><td/><td/><td/><td colspan=\"2\">paper. ABS+, Featseq2seq and Luong-NMT do</td></tr><tr><td/><td/><td/><td>not provide this value.</td></tr><tr><td/><td/><td/><td colspan=\"2\">Let's first look at the final cost values (Eq. 9)</td></tr><tr><td/><td/><td/><td colspan=\"2\">on the development set. From Table 2, we can</td></tr></table>",
"type_str": "table"
},
"TABREF3": {
"text": "",
"num": null,
"html": null,
"content": "<table><tr><td colspan=\"4\">: ROUGE F1 (%) performance. \"RG\" re-</td></tr><tr><td colspan=\"4\">presents \"ROUGE\" for short. \" * \" indicates statis-</td></tr><tr><td colspan=\"4\">tical significance of the corresponding model with</td></tr><tr><td colspan=\"4\">respect to the baseline model on the 95% confi-</td></tr><tr><td colspan=\"4\">dence interval in the official ROUGE script.</td></tr><tr><td>Type</td><td colspan=\"3\">RG-1 RG-2 RG-L</td></tr><tr><td colspan=\"2\">Random 2.81</td><td>0.00</td><td>2.72</td></tr><tr><td>First</td><td colspan=\"2\">24.44 9.63</td><td>22.05</td></tr><tr><td>Max</td><td colspan=\"3\">38.90 19.22 35.54</td></tr><tr><td colspan=\"4\">Optimal 52.91 31.92 48.63</td></tr><tr><td>Rerank</td><td colspan=\"3\">28.77 12.49 26.40</td></tr></table>",
"type_str": "table"
},
"TABREF4": {
"text": "",
"num": null,
"html": null,
"content": "<table><tr><td colspan=\"4\">: ROUGE F1 (%) performance of different</td></tr><tr><td colspan=\"2\">types of soft templates.</td><td/><td/></tr><tr><td colspan=\"4\">see that our model achieves much lower perplexity</td></tr><tr><td colspan=\"4\">compared against the state-of-the-art systems. It</td></tr><tr><td colspan=\"4\">is also noted that PIPELINE slightly outperforms</td></tr><tr><td colspan=\"4\">Re 3 Sum. One possible reason is that Re 3 Sum ad-</td></tr><tr><td colspan=\"4\">ditionally considers the cost derived from the Re-</td></tr><tr><td>rank module.</td><td/><td/><td/></tr><tr><td colspan=\"4\">The ROUGE F1 scores of different methods are</td></tr><tr><td colspan=\"4\">then reported in Table 3. As can be seen, our mo-</td></tr><tr><td colspan=\"4\">del significantly outperforms most other approa-</td></tr><tr><td colspan=\"4\">ches. Note that, ABS+ and Featseq2seq have uti-</td></tr><tr><td colspan=\"4\">lized a series of hand-crafted features, but our mo-</td></tr><tr><td colspan=\"4\">del is completely data-driven. Even though, our</td></tr><tr><td colspan=\"4\">model surpasses Featseq2seq by 22% and ABS+</td></tr><tr><td colspan=\"4\">by 60% on ROUGE-2. When soft templates are</td></tr><tr><td colspan=\"4\">ignored, our model is equivalent to the standard at-</td></tr><tr><td>Item</td><td colspan=\"3\">Template OpenNMT Re 3 Sum</td></tr><tr><td colspan=\"2\">LEN DIF 2.6\u00b12.6</td><td>3.0\u00b14.4</td><td>2.7\u00b12.6</td></tr><tr><td>LESS 3</td><td>0</td><td>53</td><td>1</td></tr><tr><td colspan=\"2\">COPY(%) 31</td><td>80</td><td>74</td></tr><tr><td colspan=\"2\">NEW NE 0.51</td><td>0.34</td><td>0.30</td></tr></table>",
"type_str": "table"
},
"TABREF5": {
"text": "Statistics of different types of summaries. Sum) 37.04 19.03 34.46Table 6: ROUGE F1 (%) performance of Re 3 Sum generated with different soft templates. tentional seq2seq model OpenNMT I . Therefore, it is safe to conclude that soft templates have great contribute to guide the generation of summaries.",
"num": null,
"html": null,
"content": "<table><tr><td>Type</td><td>RG-1 RG-2 RG-L</td></tr><tr><td>+Random</td><td>32.60 14.31 30.19</td></tr><tr><td>+First</td><td>36.01 17.06 33.21</td></tr><tr><td>+Max</td><td>41.50 21.97 38.80</td></tr><tr><td>+Optimal</td><td>46.21 26.71 43.19</td></tr><tr><td>+Rerank(Re 3</td><td/></tr></table>",
"type_str": "table"
},
"TABREF6": {
"text": "Target ainge says no deal completed with celtics Templates major says no deal with spain on gibraltar roush racing completes deal with red sox owner Re 3 Sum ainge says no deal done with celtics ainge talks with new ownersOpenNMT ainge talks with celtics owners ainge talks with new owners Source european stock markets advanced strongly thursday on some bargain-hunting and gains by wall street and japanese shares ahead of an expected hike in us interest rates .",
"num": null,
"html": null,
"content": "<table><tr><td>Target</td><td>european stocks bounce back UNK UNK with closing levels</td></tr><tr><td>Templates</td><td>european stocks bounce back strongly european shares sharply lower on us interest rate fears</td></tr><tr><td>Re 3 Sum</td><td>european stocks bounce back strongly european shares rise strongly on bargain-hunting</td></tr><tr><td>OpenNMT</td><td>european stocks rise ahead of expected us rate hike hike european stocks rise ahead of us rate hike</td></tr></table>",
"type_str": "table"
},
"TABREF7": {
"text": "Examples of generation with diversity. We use Bold font to indicate the difference between two summaries tion include template-based methods",
"num": null,
"html": null,
"content": "<table/>",
"type_str": "table"
}
}
}
} |