File size: 107,097 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 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 | {
"paper_id": "P18-1014",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:39:31.619760Z"
},
"title": "Extractive Summarization with SWAP-NET: Sentences and Words from Alternating Pointer Networks",
"authors": [
{
"first": "Aishwarya",
"middle": [],
"last": "Jadhav",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Indian Institute of Science Bangalore",
"location": {
"country": "India"
}
},
"email": "aishwaryaj@iisc.ac.in"
},
{
"first": "Vaibhav",
"middle": [],
"last": "Rajan",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Singapore",
"location": {}
},
"email": "vaibhav.rajan@nus.edu.sg"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We present a new neural sequence-tosequence model for extractive summarization called SWAP-NET (Sentences and Words from Alternating Pointer Networks). Extractive summaries comprising a salient subset of input sentences, often also contain important key words. Guided by this principle, we design SWAP-NET that models the interaction of key words and salient sentences using a new twolevel pointer network based architecture. SWAP-NET identifies both salient sentences and key words in an input document, and then combines them to form the extractive summary. Experiments on large scale benchmark corpora demonstrate the efficacy of SWAP-NET that outperforms state-of-the-art extractive summarizers.",
"pdf_parse": {
"paper_id": "P18-1014",
"_pdf_hash": "",
"abstract": [
{
"text": "We present a new neural sequence-tosequence model for extractive summarization called SWAP-NET (Sentences and Words from Alternating Pointer Networks). Extractive summaries comprising a salient subset of input sentences, often also contain important key words. Guided by this principle, we design SWAP-NET that models the interaction of key words and salient sentences using a new twolevel pointer network based architecture. SWAP-NET identifies both salient sentences and key words in an input document, and then combines them to form the extractive summary. Experiments on large scale benchmark corpora demonstrate the efficacy of SWAP-NET that outperforms state-of-the-art extractive summarizers.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Automatic summarization aims to shorten a text document while maintaining the salient information of the original text. The practical need for such systems is growing with the rapid and continuous increase in textual information sources in multiple domains.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Summarization tools can be broadly classified into two categories: extractive and abstractive. Extractive summarization selects parts of the input document to create its summary while abstractive summarization generates summaries that may have words or phrases not present in the input document. Abstractive summarization is clearly harder as methods have to address factual and grammatical errors that may be introduced and problems in utilizing external knowledge sources to obtain paraphrasing or generalization. Extractive summarizers obviate the need to solve these problems by selecting the most salient textual units (usually sentences) from the input documents. As a result, they generate summaries that are grammatically and semantically more accurate than those from abstractive methods. While they may have problems like incorrect or unclear referring expressions or lack of coherence, they are computationally simpler and more efficient to generate. Indeed, state-of-the-art extractive summarizers are comparable or often better in performance to competitive abstractive summarizers (see (Nallapati et al., 2017) for a recent empirical comparison).",
"cite_spans": [
{
"start": 1100,
"end": 1124,
"text": "(Nallapati et al., 2017)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Classical approaches to extractive summarization have relied on human-engineered features from the text that are used to score sentences in the input document and select the highestscoring sentences.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "These include graph or constraint-optimization based approaches as well as classifier-based methods. A review of these approaches can be found in Nenkova et al. (2011) . Some of these methods generate summaries from multiple documents. In this paper, we focus on single document summarization.",
"cite_spans": [
{
"start": 146,
"end": 167,
"text": "Nenkova et al. (2011)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Modern approaches that show the best performance are based on end-to-end deep learning models that do not require human-crafted features. Neural models have tremendously improved performance in several difficult problems in NLP such as machine translation (Chen et al., 2017) and question-answering (Hao et al., 2017) . Deep models with thousands of parameters require large, labeled datasets and for summarization this hurdle of labeled data was surmounted by Cheng and Lapata (2016) , through the creation of a labeled dataset of news stories from CNN and Daily Mail consisting of around 280,000 documents and human-generated summaries.",
"cite_spans": [
{
"start": 256,
"end": 275,
"text": "(Chen et al., 2017)",
"ref_id": "BIBREF1"
},
{
"start": 299,
"end": 317,
"text": "(Hao et al., 2017)",
"ref_id": "BIBREF8"
},
{
"start": 461,
"end": 484,
"text": "Cheng and Lapata (2016)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Recurrent neural networks with encoderdecoder architecture (Sutskever et al., 2014) have been successful in a variety of NLP tasks where an encoder obtains representations of input sequences and a decoder generates target sequences. Attention mechanisms (Bahdanau et al., 2015 ) are used to model the effects of different loci in the input sequence during decoding. Pointer networks (Vinyals et al., 2015) use this mechanism to obtain target sequences wherein each decoding step is used to point to elements of the input sequence. This pointing ability has been effectively utilized by state-of-the-art extractive and abstractive summarizers (Cheng and Lapata, 2016; See et al., 2017) .",
"cite_spans": [
{
"start": 59,
"end": 83,
"text": "(Sutskever et al., 2014)",
"ref_id": "BIBREF25"
},
{
"start": 254,
"end": 276,
"text": "(Bahdanau et al., 2015",
"ref_id": "BIBREF0"
},
{
"start": 383,
"end": 405,
"text": "(Vinyals et al., 2015)",
"ref_id": "BIBREF27"
},
{
"start": 642,
"end": 666,
"text": "(Cheng and Lapata, 2016;",
"ref_id": "BIBREF2"
},
{
"start": 667,
"end": 684,
"text": "See et al., 2017)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this work, we design SWAP-NET a new deep learning model for extractive summarization. Similar to previous models, we use an encoderdecoder architecture with attention mechanism to select important sentences. Our key contribution is to design an architecture that utilizes key words in the selection process. Salient sentences of a document, that are useful in summaries, often contain key words and, to our knowledge, none of the previous models have explicitly modeled this interaction. We model this interaction through a two-level encoder and decoder, one for words and the other for sentences. An attention-based mechanism, similar to that of Pointer Networks, is used to learn important words and sentences from labeled data. A switch mechanism is used to select between words and sentences during decoding and the final summary is generated using a combination of selected sentences and words. We demonstrate the efficacy of our model on the CNN/Daily Mail corpus where it outperforms state-of-the-art extractive summarizers. Our experiments also suggest that the semantic redundancy in SWAP-NET generated summaries is comparable to that of human-generated summaries.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Let D denote an input document, comprising of a sequence of N sentences: s 1 , . . . , s N . Ignoring sentence boundaries, let w 1 , . . . , w n be the sequence of n words in document D. An extractive summary aims to obtain a subset of the input sentences that forms a salient summary.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Formulation",
"sec_num": "2"
},
{
"text": "We use the interaction between words and sentences in a document to predict important words and sentences. Let the target sequence of indices of important words and sentences be V = v 1 , . . . , v m , where each index v j can point to ei-ther a sentence or a word in an input document. We design a supervised sequence-to-sequence recurrent neural network model, SWAP-NET, that uses these target sequences (of sentences and words) to learn salient sentences and key words. Our objective is to find SWAP-NET model parameters M that maximize the probability",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Formulation",
"sec_num": "2"
},
{
"text": "p(V |M, D) = j p(v j |v 1 , . . . , v j\u22121 , M, D) = j p(v j |v <j , M, D).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Formulation",
"sec_num": "2"
},
{
"text": "We omit M in the following to simplify notation. SWAP-NET predicts both key words and salient sentences, that are subsequently used for extractive summary generation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Problem Formulation",
"sec_num": "2"
},
{
"text": "We briefly describe Pointer Networks (Vinyals et al., 2015) . Our approach, detailed in the following sections, uses a similar attention mechanism.",
"cite_spans": [
{
"start": 37,
"end": 59,
"text": "(Vinyals et al., 2015)",
"ref_id": "BIBREF27"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Background",
"sec_num": "3"
},
{
"text": "Given a sequence of n vectors X = x 1 , ....x n and a sequence of indices R = r 1 , ....r m , each between 1 and n, the Pointer Network is an encoder-decoder architecture trained to maximize",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Background",
"sec_num": "3"
},
{
"text": "p(R|X; \u03b8) = m j=1 p \u03b8 (r j |r 1 , ....r j\u22121 , X; \u03b8)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Background",
"sec_num": "3"
},
{
"text": ", where \u03b8 denotes the model parameters. Let the encoder and decoder hidden states be (e 1 , ...., e n ) and (d 1 , ...., d m ) respectively. The attention vector at each output step j is computed as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Background",
"sec_num": "3"
},
{
"text": "u j i = v T tanh(W e e i + W d d j ), i \u2208 (1, . . . , n) \u03b1 j i = softmax(u j i ), i \u2208 (1, . . . , n)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Background",
"sec_num": "3"
},
{
"text": "The softmax normalizes vector u j to be an attention mask over inputs. In a pointer network, the same attention mechanism is used to select one of the n input vectors with the highest probability, at each decoding step, thus effectively pointing to an input:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Background",
"sec_num": "3"
},
{
"text": "p(r j |r 1 , ....r j\u22121 , X) = softmax(u j )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Background",
"sec_num": "3"
},
{
"text": "Here, v, W d , and W e are learnable parameters of the model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Background",
"sec_num": "3"
},
{
"text": "We use an encoder-decoder architecture with an attention mechanism similar to that of Pointer Networks. To model the interaction between words and sentences in a document we use two encoders and decoders, one at the word level and the other at the sentence level. The sentence-level decoder learns to point to important sentences while the ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SWAP-NET",
"sec_num": "4"
},
{
"text": "v 1 = w2, v 2 = s1, v 3 = w5. Best viewed in color.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SWAP-NET",
"sec_num": "4"
},
{
"text": "word-level decoder learns to point to important words. A switch mechanism is trained to select either a word or a sentence at each decoding step. The final summary is created using the output words and sentences. We now describe the details of the architecture.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "SWAP-NET",
"sec_num": "4"
},
{
"text": "We use two encoders: a bi-directional LSTM at the word level and a LSTM at the sentence level. Each word w i is represented by a K-dimensional embedding (e.g., via word2vec), denoted by x i . The word embedding x i is encoded as e i using bi-directional LSTM for i = 1, . . . , n. The vector output of BiLSTM at the end of a sentence is used to represent that entire sentence, which is further encoded by the sentence-level LSTM as E k = LSTM(e k l , E k\u22121 ), where k l is the index of the last word in the k th sentence in D and E k is the hidden state at the k th step of LSTM, for k = 1, . . . , N . See figure 1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Encoder",
"sec_num": "4.1"
},
{
"text": "We use two decoders -a sentence-level and a word-level decoder, that are both LSTMs, with each decoder pointing to sentences and words re-spectively (similar to a pointer network). Thus, we can consider the output of each decoder step to be an index in the input sequence to the encoder. Let m be the number of steps in each decoder. Let T 1 , . . . , T m be the sequence of indices generated by the sentence-level decoder, where each index T j \u2208 {1, . . . , N }; and let t 1 , . . . , t m be the sequence of indices generated by the word-level decoder, where each index t j \u2208 {1, . . . , n}.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoder",
"sec_num": "4.2"
},
{
"text": "At the j th decoding step, we have to select a sentence or a word which is done through a binary switch Q j that has two states Q j = 0 and Q j = 1 to denote word and sentence selection respectively. So, we first determine the switch probability p(Q j |v <j , D). Let \u03b1 s kj denote the probability of selecting the k th input sentence at the j th decoding step of sentence decoder:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "\u03b1 s kj = p(T j = k|v <j , Q j = 1, D),",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "and let \u03b1 w ij denote the probability of selecting the i th input word at the j th decoding step of word decoder: both conditional on the corresponding switch selection. We set v j based on the probability values:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "\u03b1 w ij = p(t j = i|v <j , Q j = 0, D),",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "v j = k = arg max k p s kj if max k p s kj > max i p w ij i = arg max i p w ij if max i p w ij > max k p s kj p s kj = \u03b1 s kj p(Q j = 1|v <j , D), p w ij = \u03b1 w ij p(Q j = 0|v <j , D)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": ". These probabilities are obtained through the attention weight vectors at the word and sentence levels and the switch probabilities:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "\u03b1 w ij = softmax(v T t \u03c6(w h h j + w t e i )), \u03b1 s kj = softmax(V T T \u03c6(W H H j + W T E k ))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": ".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "Parameters v t , w h , w t , V",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "T , W H and W T are trainable parameters. Parameters h j and H j are the hidden vectors at the j th step of the wordlevel and sentence-level decoder respectively defined as:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "h j = LST M (h j\u22121 , a j\u22121 , \u03c6(A j\u22121 ))",
"eq_num": "(1)"
}
],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "H j = LST M (H j\u22121 , A j\u22121 , \u03c6(a j\u22121 )) (2)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "where",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "a j = n i=0 \u03b1 w ij e i , A j = N k=0 \u03b1 s kj E k .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "The non-linear transformation, \u03c6 (we choose tanh), is used to connect the word-level encodings to the sentence decoder and the sentence-level encodings to the word decoder. Specifically, the word-level decoder updates its state by considering a sum of sentence encodings, weighted by the attentions from the previous state and mutatis mutandis for the sentence-level decoder.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "The switch probability p(Q j |v <j , D) at the j th decoding step is given by:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "p(Q j = 1|v <j , D) = \u03c3(w T Q (H j\u22121 , A j\u22121 , \u03c6(h j\u22121 , a j\u22121 ))) p(Q j = 0|v <j , D) = 1 \u2212 p(Q j = 1|v <j , D)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "where w Q is a trainable parameter and \u03c3 denotes the sigmoid function and \u03c6 is the chosen nonlinear transformation (tanh).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "During training the loss function l j at j th step is set to",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "l j = \u2212 log(p s kj q s j + p w ij q w j ) \u2212 log p(Q j |v <j , D).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "Note that at each decoding step, switch is either q w j = 1, q s j = 0 if the j th output is a word or q w j = 0, q s j = 1 if the j th output is a sentence. The switch probability is also considered in the loss function.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Network Details",
"sec_num": "4.3"
},
{
"text": "Given a document whose summary is to be generated, its sentences and words are given as input to the trained encoder. At the j th decoding step, either a sentence or a word is chosen based on the probability values \u03b1 s kj and \u03b1 w ij and the switch probability p(Q j |v <j , D). We assign importance scores to the selected sentences based on their probability values during decoding as well as the probabilities of the selected words that are present in the selected sentences. Thus sentences with words selected by the decoder are given higher importance. Let the k th input sentence s k be selected at the j th decoding step and i th input word w i be selected at the l th decoding step. Then the importance of s k is defined as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Summary Generation",
"sec_num": "4.4"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "I(s k ) = \u03b1 s kj + \u03bb w i \u2208s k \u03b1 w il",
"eq_num": "(3)"
}
],
"section": "Summary Generation",
"sec_num": "4.4"
},
{
"text": "In our experiments we choose \u03bb = 1. The final summary consists of three sentences with the highest importance scores.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Summary Generation",
"sec_num": "4.4"
},
{
"text": "Traditional approaches to extractive summarization rely on human-engineered features based on, for example, part of speech (Erkan and Radev, 2004) and term frequency (Nenkova et al., 2006) . Sentences in the input document are scored using these features, ranked and then selected for the final summary. Methods used for extractive summarization include graph-based approaches (Mihalcea, 2005) and Integer Linear Programming (Gillick and Favre, 2009) . There are many classifier-based approaches that select sentences for the extractive summary using methods such as Conditional Random Fields (Shen et al., 2007) and Hidden Markov models (Conroy and O'leary, 2001) . A review of these classical approaches can be found in Nenkova et al. (2011) . End-to-end deep learning based neural models that can effectively learn from text data, without human-crafted features, have witnessed rapid development, resulting in improved performance in multiple areas such as machine translation (Chen et al., 2017) and question-answering (Hao et al., 2017) , to name a few. Large labelled corpora based on news stories from CNN and Daily Mail, with human generated summaries have become available (Cheng and Lapata, 2016) , that have spurred the use of deep learning models in summarization. Recurrent neural network based architectures have been designed for both extractive (Cheng and Lapata, 2016; Nallapati et al., 2017) and abstractive (See et al., 2017; Tan et al., 2017) summarization problems. Among these, the work of Cheng and Lapata (2016) and Nallapati et al. (2017) are closest to our work on extractive singledocument summarization.",
"cite_spans": [
{
"start": 123,
"end": 146,
"text": "(Erkan and Radev, 2004)",
"ref_id": "BIBREF5"
},
{
"start": 166,
"end": 188,
"text": "(Nenkova et al., 2006)",
"ref_id": "BIBREF20"
},
{
"start": 377,
"end": 393,
"text": "(Mihalcea, 2005)",
"ref_id": "BIBREF14"
},
{
"start": 425,
"end": 450,
"text": "(Gillick and Favre, 2009)",
"ref_id": "BIBREF6"
},
{
"start": 593,
"end": 612,
"text": "(Shen et al., 2007)",
"ref_id": "BIBREF24"
},
{
"start": 638,
"end": 664,
"text": "(Conroy and O'leary, 2001)",
"ref_id": "BIBREF3"
},
{
"start": 722,
"end": 743,
"text": "Nenkova et al. (2011)",
"ref_id": "BIBREF19"
},
{
"start": 980,
"end": 999,
"text": "(Chen et al., 2017)",
"ref_id": "BIBREF1"
},
{
"start": 1023,
"end": 1041,
"text": "(Hao et al., 2017)",
"ref_id": "BIBREF8"
},
{
"start": 1182,
"end": 1206,
"text": "(Cheng and Lapata, 2016)",
"ref_id": "BIBREF2"
},
{
"start": 1361,
"end": 1385,
"text": "(Cheng and Lapata, 2016;",
"ref_id": "BIBREF2"
},
{
"start": 1386,
"end": 1409,
"text": "Nallapati et al., 2017)",
"ref_id": "BIBREF16"
},
{
"start": 1426,
"end": 1444,
"text": "(See et al., 2017;",
"ref_id": "BIBREF23"
},
{
"start": 1445,
"end": 1462,
"text": "Tan et al., 2017)",
"ref_id": "BIBREF26"
},
{
"start": 1512,
"end": 1535,
"text": "Cheng and Lapata (2016)",
"ref_id": "BIBREF2"
},
{
"start": 1540,
"end": 1563,
"text": "Nallapati et al. (2017)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "5"
},
{
"text": "An encoder-decoder architecture with an attention mechanism similar to that of a pointer network is used by Cheng and Lapata (2016) . Their hierarchical encoder uses a CNN at the word level leading to sentence representations that are used in an RNN to obtain document representations. They use a hierarchical attention model where the first level decoder predicts salient sentences used for an extractive summary and based on this output, the second step predicts keywords which are used for abstractive summarization. Thus they do not use key words for extractive summarization and for abstractive summarization they generate key words based on sentences predicted independently of key words. SWAP-NET, in contrast, is simpler using only two-level RNNs for word and sentence level representations in both the encoder and decoder. In our model we predict both words and sentences in such a way that their attentions interact with each other and generate extractive summaries considering both the attentions. By modeling the interaction between these key words and important sentences in our decoder architecture, we are able to extract sentences that are closer to the gold summaries.",
"cite_spans": [
{
"start": 108,
"end": 131,
"text": "Cheng and Lapata (2016)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "5"
},
{
"text": "SummaRuNNer, the method developed by Nallapati et al. (2017) is not similar to our method in its architecture but only in the aim of extractive summary generation. It does not use an encoderdecoder architecture; instead it is an RNN based binary classifier that decides whether or not to include a sentence in the summary. The RNN is multi-layered representing inputs, words, sentences and the final sentence labels. The decision of selecting a sentence at each step of the RNN is based on the content of the sentence, salience in the document, novelty with respect to previously selected sentences and other positional features. Their approach is considerably simpler than that of Cheng and Lapata (2016) but obtains summaries closer to the gold summaries, and additionally, facilitates interpretable visualization and training from abstractive summaries. Their experiments show improved performance over both abstractive and extractive summarizers from several previous models (Nallapati et al., 2017) .",
"cite_spans": [
{
"start": 682,
"end": 705,
"text": "Cheng and Lapata (2016)",
"ref_id": "BIBREF2"
},
{
"start": 979,
"end": 1003,
"text": "(Nallapati et al., 2017)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "5"
},
{
"text": "We note that several elements of our architecture have been introduced and used in earlier work. Pointer networks (Vinyals et al., 2015) used the attention mechanism of (Bahdanau et al., 2015) to solve combinatorial optimization problems. They have also been used to point to sentences in extractive (Cheng and Lapata, 2016) and abstractive See et al., 2017 ) summarizers. The switch mechanism was introduced to incorporate rare or out-of-vocabulary words and are used in several summarizers (e.g. ). However, we use it to select between word and sentence level decoders in our model.",
"cite_spans": [
{
"start": 114,
"end": 136,
"text": "(Vinyals et al., 2015)",
"ref_id": "BIBREF27"
},
{
"start": 169,
"end": 192,
"text": "(Bahdanau et al., 2015)",
"ref_id": "BIBREF0"
},
{
"start": 300,
"end": 324,
"text": "(Cheng and Lapata, 2016)",
"ref_id": "BIBREF2"
},
{
"start": 341,
"end": 357,
"text": "See et al., 2017",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "5"
},
{
"text": "The importance of all the three interactions: (i) sentence-sentence, (ii) word-word and (iii) sentence-word, for summarization, have been studied by Wan et al. (2007) using graph-based approaches. In particular, they show that methods that account for saliency using both the following considerations perform better than methods that consider either one of them alone, and SWAP-NET is based on the same principles.",
"cite_spans": [
{
"start": 149,
"end": 166,
"text": "Wan et al. (2007)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "5"
},
{
"text": "\u2022 A sentence should be salient if it is heavily linked with other salient sentences, and a word should be salient if it is heavily linked with other salient words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "5"
},
{
"text": "\u2022 A sentence should be salient if it contains many salient words, and a word should be salient if it appears in many salient sentences.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "5"
},
{
"text": "6 Data and Experiments",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "5"
},
{
"text": "In our experiments the maximum number of words per document is limited to 800, and the maximum number of sentences per document to 50 (padding is used to maintain the length of word sequences). We also use the symbols <GO> and <EOS> to indicate start and end of prediction by decoders. The total vocabulary size is 150,000 words. We use word embeddings of dimension 100 pretrained using word2vec (Mikolov et al., 2013) on the training dataset. We fix the LSTM hidden state size at 200. We use a batch size of 16 and the ADAM optimizer (Kingma and Ba, 2015) with parameters: learning rate = 0.001, \u03b2 1 = 0.9, \u03b2 2 = 0.999 to train SWAP-NET. We employ gradient clipping to regularize our model and an early stopping criterion based on the validation loss.",
"cite_spans": [
{
"start": 396,
"end": 418,
"text": "(Mikolov et al., 2013)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Settings",
"sec_num": "6.1"
},
{
"text": "During training we find that SWAP-NET learns to predict important sentences faster than to predict words. To speed up learning of word probabilities, we add the term \u2212 log \u03b1 w ij to our loss function l j in the final iterations of training. It is possible to get the same sentence or word in multiple (usually consecutive) decoding steps. In that case, in Eq. 3 we consider the maximum value of alpha obtained across these steps and calculate maximum scores of distinct sentences and words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Settings",
"sec_num": "6.1"
},
{
"text": "We select 3 top scoring sentences for the summary, as there are 3.11 sentences on average in the gold summary of the training set (similar to settings used by others, e.g., (Narayan et al., 2017) ).",
"cite_spans": [
{
"start": 173,
"end": 195,
"text": "(Narayan et al., 2017)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Settings",
"sec_num": "6.1"
},
{
"text": "Two state-of-the-art methods for extractive summarization are SummaRuNNer (Nallapati et al., 2017) and NN, the neural summarizer of Cheng and Lapata (2016) . SummaRuNNer can also provide extractive summaries while being trained abstractively (Nallapati et al., 2017) ; we denote this method by SummaRuNNer-abs. In addition, we compare our method with the Lead-3 summary which consists of the first three sentences from each document. We also compare our method with an abstractive summarizer that uses a similar attention-based encoder-decoder architecture , denoted by ABS.",
"cite_spans": [
{
"start": 74,
"end": 98,
"text": "(Nallapati et al., 2017)",
"ref_id": "BIBREF16"
},
{
"start": 132,
"end": 155,
"text": "Cheng and Lapata (2016)",
"ref_id": "BIBREF2"
},
{
"start": 242,
"end": 266,
"text": "(Nallapati et al., 2017)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Baselines",
"sec_num": "6.2"
},
{
"text": "For our experiments, we use the CNN/DailyMail corpus (Hermann et al., 2015) . We use the anonymized version of this dataset, from Cheng and Lapata (2016) , which has labels for important sentences, that are used for training. To obtain labels for words, we extract keywords from each gold summary using RAKE, an unsupervised keyword extraction method (Rose et al., 2010) . These keywords are used to label words in the corresponding input document during training. We replace numerical values in the documents by zeros to limit the vocabulary size.",
"cite_spans": [
{
"start": 53,
"end": 75,
"text": "(Hermann et al., 2015)",
"ref_id": "BIBREF10"
},
{
"start": 130,
"end": 153,
"text": "Cheng and Lapata (2016)",
"ref_id": "BIBREF2"
},
{
"start": 351,
"end": 370,
"text": "(Rose et al., 2010)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Benchmark Datasets",
"sec_num": "6.3"
},
{
"text": "We have 193,986 training documents, 12,147 validation documents and 10,346 test documents from the DailyMail corpus and 83,568 training documents, 1,220 validation documents and 1,093 test documents from CNN subset with labels for sentences and words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Benchmark Datasets",
"sec_num": "6.3"
},
{
"text": "We use the ROUGE toolkit (Lin and Hovy, 2003) for evaluation of the generated summaries in comparison to the gold summaries. We use three variants of this metric: ROUGE-1 (R1), ROUGE-2 (R2) and ROUGE-L (RL) that are computed by matching unigrams, bigrams and longest common subsequences respectively between the two summaries. To compare with (Cheng and Lapata, 2016) and (Nallapati et al., 2017) Table 1 shows the performance of SWAP-NET, state-of-the-art baselines NN and SummaRuNNer and other baselines, using ROUGE recall with summary length of 75 bytes, on the entire Daily Mail test set. The performance of SWAP-NET is comparable to that of SummaRuNNer and better than NN and other baselines. Table 2 compares the same algorithms using ROUGE recall with summary length of 275 bytes. SWAP-NET outperforms both state-of-the-art summarizers Sum-maRuNNer as well as NN.",
"cite_spans": [
{
"start": 25,
"end": 45,
"text": "(Lin and Hovy, 2003)",
"ref_id": "BIBREF13"
},
{
"start": 343,
"end": 367,
"text": "(Cheng and Lapata, 2016)",
"ref_id": "BIBREF2"
},
{
"start": 372,
"end": 396,
"text": "(Nallapati et al., 2017)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [
{
"start": 397,
"end": 404,
"text": "Table 1",
"ref_id": null
},
{
"start": 699,
"end": 706,
"text": "Table 2",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Evaluation Metrics",
"sec_num": "6.4"
},
{
"text": "Performance on CNN/DailyMail Data SWAP-NET has the best performance on the combined CNN and Daily Mail corpus, outperforming ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation Metrics",
"sec_num": "6.4"
},
{
"text": "SWAP-NET outperforms state-of-the-art extractive summarizers SummaRuNNer (Nallapati et al., 2017) and NN (Cheng and Lapata, 2016) on benchmark datasets. Our model is similar, although simpler, than that of NN and the main difference between SWAP-NET and these baselines is its explicit modeling of the interaction between key words and salient sentences. Automatic keyword extraction has been studied extensively (Hasan and Ng, 2014). We use a popular and well tested method, RAKE (Rose et al., 2010) to obtain key words in the training documents. A disadvantage with such methods is that they do not guarantee representation, via extracted keywords, of all the topics in the text (Hasan and Ng, 2014) . So, if RAKE key words are directly applied to the input test document (without using word decoder trained on RAKE words, obtained from gold summary as done in SWAP-NET), then there is a possibility of missing sentences from the missed topics. So, we train SWAP-NET to predict key words and also model their interactions with sentences.",
"cite_spans": [
{
"start": 73,
"end": 97,
"text": "(Nallapati et al., 2017)",
"ref_id": "BIBREF16"
},
{
"start": 105,
"end": 129,
"text": "(Cheng and Lapata, 2016)",
"ref_id": "BIBREF2"
},
{
"start": 481,
"end": 500,
"text": "(Rose et al., 2010)",
"ref_id": "BIBREF22"
},
{
"start": 681,
"end": 701,
"text": "(Hasan and Ng, 2014)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion",
"sec_num": "6.6"
},
{
"text": "Lead-3 SWAP-NET KW coverage 61.6% 73.8% Sentences with KW 92.2% 98% We investigate the importance of modeling this interaction and the role of key words in the final summary. Table 4 shows statistics that reflect the importance of key words in extractive summaries. Key word coverage measures the proportion of key nearly 0.8. In contrast, the average pairwise distance in Lead-3 summaries is 0.553 indicating higher redundancy. This highly desirable feature of SWAP-NET is likely due to use of of key words, that is affecting the choice of sentences in the final summary. Table 5 shows a sample gold summary from the Daily Mail dataset and the generated summary from SWAP-NET and, for comparison, from Lead-3. We observe the presence of key words in all the overlapping segments of text with the gold summary indicating the importance of key words in finding salient sentences. Modeling this interaction, we believe, is the reason for the superior performance of SWAP-NET in our experiments.",
"cite_spans": [],
"ref_spans": [
{
"start": 175,
"end": 182,
"text": "Table 4",
"ref_id": "TABREF4"
},
{
"start": 573,
"end": 580,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Statistics",
"sec_num": null
},
{
"text": "An implementation of SWAP-NET and all the generated summaries from the test sets are available online in a github repository 1 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Statistics",
"sec_num": null
},
{
"text": "We present SWAP-NET, a neural sequence-tosequence model for extractive summarization that outperforms state-of-the-art extractive summarizers SummaRuNNer (Nallapati et al., 2017) and NN (Cheng and Lapata, 2016) on large scale benchmark datasets. The architecture of SWAP-NET is simpler than that of NN but due to its effective modeling of interaction between salient sentences and key words in a document, SWAP-NET achieves superior performance. SWAP-NET models this interaction using a new two-level pointer network based architecture with a switching mechanism. Our experiments also suggest that modeling sentence-keyword interaction has the desirable property of less semantic redundancy in summaries generated by SWAP-NET.",
"cite_spans": [
{
"start": 154,
"end": 178,
"text": "(Nallapati et al., 2017)",
"ref_id": "BIBREF16"
},
{
"start": 186,
"end": 210,
"text": "(Cheng and Lapata, 2016)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "7"
},
{
"text": "8 Acknowledgment",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "7"
}
],
"back_matter": [
{
"text": "The authors thank the ACL reviewers for their valuable comments. Vaibhav Rajan acknowledges the support from Singapore Ministry of Education Academic Research Fund Tier 1 towards funding this research.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "acknowledgement",
"sec_num": null
},
{
"text": "Title: @entity19 vet surprised reason license plate denial Gold Summary: @entity9 of @entity10 , @entity1 , wanted to get ' @entity11 -0 ' put on a license plate . that would have commemorated both @entity9 getting the @entity8 in 0 and his @entity16 . the @entity1 @entity21 denied his request , citing state regulations prohibiting the use of the number 0 because of its indecent connotations . SWAP-NET Summary: @entity9 of @entity10 wanted to get ' @entity11 ' put on a license plate , the @entity14 newspaper of @entity10 reported . that would have commemorated both @entity9 getting the @entity8 in 0 and his @entity16 , according to the newspaper . the @entity1 @entity21 denied his request , citing state regulations prohibiting the use of the number 0 because of its indecent connotations @entity9 had been an armored personnel carrier 's gunner during his time in the @entity29 . SWAP-NET Key words: @entity1, @entity9, @entity8, citing, number, year, indecent, personalized, war, surprised, plate, @en-tity14, @entity11, @entity10, regulations, reported, wanted, connotations, license, request, according,@entity21, armored, @entity16Lead 3 Summary: a @entity19 war veteran in @entity1 has said he 's surprised over the reason for the denial of his request for a personalized license plate commemorating the year he was wounded and awarded a @entity8 . @entity9 of @entity10 wanted to get ' @entity11 ' put on a license plate , the @entity14 newspaper of @entity10 reported . that would have commemorated both @entity9 getting the @entity8 in 0 and his @entity16 , according to the newspaper . Table 5 : Sample gold summary and summaries generated by SWAP-NET and Lead-3. Key words are highlighted, bold font indicates overlap with gold summary.words from those in the gold summary present in the generated summary. SWAP-NET obtains nearly 74% of the key words. In comparison Lead-3 has only about 62% of the key words from the gold summary.Sentences with key words measures the proportion of sentences containing at least one key word. It is not surprising that in SWAP-NET summaries 98% of the sentences, on average, contain at least one key word: this is by design of SWAP-NET. However, note that Lead-3 which has poorer performance in all the benchmark datasets has much fewer sentences with key words. This highlights the importance of key words in finding salient sentences for extractive summaries.Gold summary Lead-3 SWAP-NET 0.81 0.553 0.8 Table 6 : Average pairwise cosine distance between paragraph vector representations of sentences in summaries.We also find the SWAP-NET obtains summaries that have less semantic redundancy. Table 6 shows the average distance between pairs of sentences from the gold summary, and summaries generated from SWAP-NET and Lead-3. Distances are measured using cosine distance of paragraph vectors of each sentence (Le and Mikolov, 2014) from randomly selected 500 documents of the Daily Mail test set. Paragraph vectors have been found to be effective semantic representations of sentences (Le and Mikolov, 2014) and experiments in (Dai et al., 2015) also show that paragraph vectors can be effectively used to measure semantic similarity using cosine distance. For training we use GENSIM (\u0158eh\u016f\u0159ek and Sojka, 2010) with embedding size 200 and initial learning rate 0.025. The model is trained on 500 documents from Daily-Mail dataset for 10 epochs and learning rate is decreased by 0.002 at each epoch.The average pair-wise distance of SWAP-NET is very close to that of the gold summary, both",
"cite_spans": [
{
"start": 2868,
"end": 2890,
"text": "(Le and Mikolov, 2014)",
"ref_id": "BIBREF12"
},
{
"start": 3044,
"end": 3066,
"text": "(Le and Mikolov, 2014)",
"ref_id": "BIBREF12"
},
{
"start": 3086,
"end": 3104,
"text": "(Dai et al., 2015)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [
{
"start": 1605,
"end": 1612,
"text": "Table 5",
"ref_id": null
},
{
"start": 2460,
"end": 2467,
"text": "Table 6",
"ref_id": null
},
{
"start": 2650,
"end": 2657,
"text": "Table 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "annex",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"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": 2015,
"venue": "International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Ben- gio. 2015. Neural machine translation by jointly learning to align and translate. In International Con- ference on Learning Representations.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Improved neural machine translation with a syntax-aware encoder and decoder",
"authors": [
{
"first": "Huadong",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Shujian",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Chiang",
"suffix": ""
},
{
"first": "Jiajun",
"middle": [],
"last": "Chen",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Huadong Chen, Shujian Huang, David Chiang, and Ji- ajun Chen. 2017. Improved neural machine trans- lation with a syntax-aware encoder and decoder. In Proceedings of the 55th Annual Meeting of the As- sociation for Computational Linguistics.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Neural summarization by extracting sentences and words",
"authors": [
{
"first": "Jianpeng",
"middle": [],
"last": "Cheng",
"suffix": ""
},
{
"first": "Mirella",
"middle": [],
"last": "Lapata",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jianpeng Cheng and Mirella Lapata. 2016. Neural summarization by extracting sentences and words. In Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Text summarization via hidden markov models",
"authors": [
{
"first": "M",
"middle": [],
"last": "John",
"suffix": ""
},
{
"first": "Dianne P O'",
"middle": [],
"last": "Conroy",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Leary",
"suffix": ""
}
],
"year": 2001,
"venue": "Proceedings of the 24th annual international ACM SIGIR conference on research and development in information retrieval",
"volume": "",
"issue": "",
"pages": "406--407",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "John M Conroy and Dianne P O'leary. 2001. Text sum- marization via hidden markov models. In Proceed- ings of the 24th annual international ACM SIGIR conference on research and development in informa- tion retrieval, pages 406-407. ACM.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Document embedding with paragraph vectors",
"authors": [
{
"first": "M",
"middle": [],
"last": "Andrew",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Dai",
"suffix": ""
},
{
"first": "Quoc V",
"middle": [],
"last": "Olah",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Le",
"suffix": ""
}
],
"year": 2015,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1507.07998"
]
},
"num": null,
"urls": [],
"raw_text": "Andrew M Dai, Christopher Olah, and Quoc V Le. 2015. Document embedding with paragraph vec- tors. arXiv preprint arXiv:1507.07998.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Lexrank: Graph-based lexical centrality as salience in text summarization",
"authors": [
{
"first": "G\u00fcnes",
"middle": [],
"last": "Erkan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Dragomir R Radev",
"suffix": ""
}
],
"year": 2004,
"venue": "Journal of Artificial Intelligence Research",
"volume": "22",
"issue": "",
"pages": "457--479",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "G\u00fcnes Erkan and Dragomir R Radev. 2004. Lexrank: Graph-based lexical centrality as salience in text summarization. Journal of Artificial Intelligence Research, 22:457-479.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "A scalable global model for summarization",
"authors": [
{
"first": "Dan",
"middle": [],
"last": "Gillick",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Benoit Favre",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the Workshop on Integer Linear Programming for Natural Langauge Processing, Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "10--18",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dan Gillick and Benoit Favre. 2009. A scalable global model for summarization. In Proceedings of the Workshop on Integer Linear Programming for Nat- ural Langauge Processing, Association for Compu- tational Linguistics, pages 10-18.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Pointing the unknown words",
"authors": [
{
"first": "Caglar",
"middle": [],
"last": "Gulcehre",
"suffix": ""
},
{
"first": "Sungjin",
"middle": [],
"last": "Ahn",
"suffix": ""
},
{
"first": "Ramesh",
"middle": [],
"last": "Nallapati",
"suffix": ""
},
{
"first": "Bowen",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "140--149",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Caglar Gulcehre, Sungjin Ahn, Ramesh Nallapati, Bowen Zhou, and Yoshua Bengio. 2016. Pointing the unknown words. In Proceedings of the 54th An- nual Meeting of the Association for Computational Linguistics, pages 140-149.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "An endto-end model for question answering over knowledge base with cross-attention combining global knowledge",
"authors": [
{
"first": "Yanchao",
"middle": [],
"last": "Hao",
"suffix": ""
},
{
"first": "Yuanzhe",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Kang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Shizhu",
"middle": [],
"last": "He",
"suffix": ""
},
{
"first": "Zhanyi",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Hua",
"middle": [],
"last": "Wu",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yanchao Hao, Yuanzhe Zhang, Kang Liu, Shizhu He, Zhanyi Liu, Hua Wu, and Jun Zhao. 2017. An end- to-end model for question answering over knowl- edge base with cross-attention combining global knowledge. In Proceedings of the 55th Annual Meeting of the Association for Computational Lin- guistics.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Automatic keyphrase extraction: A survey of the state of the art",
"authors": [
{
"first": "Saidul",
"middle": [],
"last": "Kazi",
"suffix": ""
},
{
"first": "Vincent",
"middle": [],
"last": "Hasan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ng",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1262--1273",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kazi Saidul Hasan and Vincent Ng. 2014. Automatic keyphrase extraction: A survey of the state of the art. In Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics, vol- ume 1, pages 1262-1273.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Teaching machines to read and comprehend",
"authors": [
{
"first": "Karl",
"middle": [],
"last": "Moritz Hermann",
"suffix": ""
},
{
"first": "Tomas",
"middle": [],
"last": "Kocisky",
"suffix": ""
},
{
"first": "Edward",
"middle": [],
"last": "Grefenstette",
"suffix": ""
},
{
"first": "Lasse",
"middle": [],
"last": "Espeholt",
"suffix": ""
},
{
"first": "Will",
"middle": [],
"last": "Kay",
"suffix": ""
},
{
"first": "Mustafa",
"middle": [],
"last": "Suleyman",
"suffix": ""
},
{
"first": "Phil",
"middle": [],
"last": "Blunsom",
"suffix": ""
}
],
"year": 2015,
"venue": "Advances in Neural Information Processing Systems",
"volume": "",
"issue": "",
"pages": "1693--1701",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Karl Moritz Hermann, Tomas Kocisky, Edward Grefenstette, Lasse Espeholt, Will Kay, Mustafa Su- leyman, and Phil Blunsom. 2015. Teaching ma- chines to read and comprehend. In Advances in Neu- ral Information Processing Systems, pages 1693- 1701.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Adam: A method for stochastic optimization",
"authors": [
{
"first": "P",
"middle": [],
"last": "Diederik",
"suffix": ""
},
{
"first": "Jimmy",
"middle": [],
"last": "Kingma",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ba",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of the International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Diederik P Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. In Proceedings of the International Conference on Learning Repre- sentations.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Distributed representations of sentences and documents",
"authors": [
{
"first": "Quoc",
"middle": [],
"last": "Le",
"suffix": ""
},
{
"first": "Tomas",
"middle": [],
"last": "Mikolov",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the International Conference on Machine Learning",
"volume": "",
"issue": "",
"pages": "1188--1196",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Quoc Le and Tomas Mikolov. 2014. Distributed repre- sentations of sentences and documents. In Proceed- ings of the International Conference on Machine Learning, pages 1188-1196.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Automatic evaluation of summaries using n-gram cooccurrence statistics",
"authors": [
{
"first": "Chin-Yew",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Eduard",
"middle": [],
"last": "Hovy",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the North American Chapter of the Association for Computational Linguistics on Human Language Technology",
"volume": "1",
"issue": "",
"pages": "71--78",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chin-Yew Lin and Eduard Hovy. 2003. Auto- matic evaluation of summaries using n-gram co- occurrence statistics. In Proceedings of the North American Chapter of the Association for Computa- tional Linguistics on Human Language Technology- Volume 1, pages 71-78.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Language independent extractive summarization",
"authors": [
{
"first": "Rada",
"middle": [],
"last": "Mihalcea",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the ACL 2005 on Interactive poster and demonstration sessions",
"volume": "",
"issue": "",
"pages": "49--52",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rada Mihalcea. 2005. Language independent extrac- tive summarization. In Proceedings of the ACL 2005 on Interactive poster and demonstration sessions, pages 49-52.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Distributed representations of words and phrases and their compositionality",
"authors": [
{
"first": "Tomas",
"middle": [],
"last": "Mikolov",
"suffix": ""
},
{
"first": "Ilya",
"middle": [],
"last": "Sutskever",
"suffix": ""
},
{
"first": "Kai",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Greg",
"middle": [
"S"
],
"last": "Corrado",
"suffix": ""
},
{
"first": "Jeff",
"middle": [],
"last": "Dean",
"suffix": ""
}
],
"year": 2013,
"venue": "Advances in Neural Information Processing Systems",
"volume": "",
"issue": "",
"pages": "3111--3119",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S Cor- rado, and Jeff Dean. 2013. Distributed representa- tions of words and phrases and their compositional- ity. In Advances in Neural Information Processing Systems, pages 3111-3119.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Summarunner: A recurrent neural network based sequence model for extractive summarization of documents",
"authors": [
{
"first": "Ramesh",
"middle": [],
"last": "Nallapati",
"suffix": ""
},
{
"first": "Feifei",
"middle": [],
"last": "Zhai",
"suffix": ""
},
{
"first": "Bowen",
"middle": [],
"last": "Zhou",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of Thirty-First AAAI Conference on Artificial Intelligence (AAAI-17)",
"volume": "",
"issue": "",
"pages": "3075--3081",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ramesh Nallapati, Feifei Zhai, and Bowen Zhou. 2017. Summarunner: A recurrent neural network based se- quence model for extractive summarization of doc- uments. In Proceedings of Thirty-First AAAI Con- ference on Artificial Intelligence (AAAI-17), pages 3075-3081.",
"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": "Proceedings of the 20th SIGNLL Conference on Computational Natural Language Learning (CoNLL)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ramesh Nallapati, Bowen Zhou, Caglar Gulcehre, Bing Xiang, et al. 2016. Abstractive text summa- rization using sequence-to-sequence RNNs and be- yond. In Proceedings of the 20th SIGNLL Confer- ence on Computational Natural Language Learning (CoNLL).",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Neural extractive summarization with side information",
"authors": [
{
"first": "Shashi",
"middle": [],
"last": "Narayan",
"suffix": ""
},
{
"first": "Nikos",
"middle": [],
"last": "Papasarantopoulos",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Shay",
"suffix": ""
},
{
"first": "Mirella",
"middle": [],
"last": "Cohen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Lapata",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1704.04530"
]
},
"num": null,
"urls": [],
"raw_text": "Shashi Narayan, Nikos Papasarantopoulos, Shay B Cohen, and Mirella Lapata. 2017. Neural extrac- tive summarization with side information. arXiv preprint arXiv:1704.04530.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Automatic summarization",
"authors": [
{
"first": "Ani",
"middle": [],
"last": "Nenkova",
"suffix": ""
},
{
"first": "Kathleen",
"middle": [],
"last": "Mckeown",
"suffix": ""
}
],
"year": 2011,
"venue": "Foundations and Trends R in Information Retrieval",
"volume": "5",
"issue": "2-3",
"pages": "103--233",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ani Nenkova, Kathleen McKeown, et al. 2011. Auto- matic summarization. Foundations and Trends R in Information Retrieval, 5(2-3):103-233.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "A compositional context sensitive multi-document summarizer: exploring the factors that influence summarization",
"authors": [
{
"first": "Ani",
"middle": [],
"last": "Nenkova",
"suffix": ""
},
{
"first": "Lucy",
"middle": [],
"last": "Vanderwende",
"suffix": ""
},
{
"first": "Kathleen",
"middle": [],
"last": "Mckeown",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval",
"volume": "",
"issue": "",
"pages": "573--580",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ani Nenkova, Lucy Vanderwende, and Kathleen McK- eown. 2006. A compositional context sensitive multi-document summarizer: exploring the factors that influence summarization. In Proceedings of the 29th Annual International ACM SIGIR Conference on Research and Development in Information Re- trieval, pages 573-580.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Software Framework for Topic Modelling with Large Corpora",
"authors": [
{
"first": "Petr",
"middle": [],
"last": "Radim\u0159eh\u016f\u0159ek",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Sojka",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the LREC 2010 Workshop on New Challenges for NLP Frameworks",
"volume": "",
"issue": "",
"pages": "45--50",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Radim\u0158eh\u016f\u0159ek and Petr Sojka. 2010. Software Frame- work for Topic Modelling with Large Corpora. In Proceedings of the LREC 2010 Workshop on New Challenges for NLP Frameworks, pages 45-50.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Automatic keyword extraction from individual documents",
"authors": [
{
"first": "Stuart",
"middle": [],
"last": "Rose",
"suffix": ""
},
{
"first": "Dave",
"middle": [],
"last": "Engel",
"suffix": ""
},
{
"first": "Nick",
"middle": [],
"last": "Cramer",
"suffix": ""
},
{
"first": "Wendy",
"middle": [],
"last": "Cowley",
"suffix": ""
}
],
"year": 2010,
"venue": "Text Mining: Applications and Theory",
"volume": "",
"issue": "",
"pages": "1--20",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stuart Rose, Dave Engel, Nick Cramer, and Wendy Cowley. 2010. Automatic keyword extraction from individual documents. Text Mining: Applications and Theory, pages 1-20.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Get to the point: Summarization with pointergenerator 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": "Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Abigail See, Peter J Liu, and Christopher D Manning. 2017. Get to the point: Summarization with pointer- generator networks. In Proceedings of the 55th An- nual Meeting of the Association for Computational Linguistics.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Document summarization using conditional random fields",
"authors": [
{
"first": "Dou",
"middle": [],
"last": "Shen",
"suffix": ""
},
{
"first": "Jian-Tao",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Hua",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Qiang",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Zheng",
"middle": [],
"last": "Chen",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of International Joint Conferences on Artificial Intelligence",
"volume": "7",
"issue": "",
"pages": "2862--2867",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dou Shen, Jian-Tao Sun, Hua Li, Qiang Yang, and Zheng Chen. 2007. Document summarization using conditional random fields. In Proceedings of Inter- national Joint Conferences on Artificial Intelligence, volume 7, pages 2862-2867.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Sequence to sequence learning with neural networks",
"authors": [
{
"first": "Ilya",
"middle": [],
"last": "Sutskever",
"suffix": ""
},
{
"first": "Oriol",
"middle": [],
"last": "Vinyals",
"suffix": ""
},
{
"first": "Quoc V",
"middle": [],
"last": "Le",
"suffix": ""
}
],
"year": 2014,
"venue": "Advances in Neural Information Processing Systems",
"volume": "",
"issue": "",
"pages": "3104--3112",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ilya Sutskever, Oriol Vinyals, and Quoc V Le. 2014. Sequence to sequence learning with neural net- works. In Advances in Neural Information Process- ing Systems, pages 3104-3112.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Abstractive document summarization with a graphbased attentional neural model",
"authors": [
{
"first": "Jiwei",
"middle": [],
"last": "Tan",
"suffix": ""
},
{
"first": "Xiaojun",
"middle": [],
"last": "Wan",
"suffix": ""
},
{
"first": "Jianguo",
"middle": [],
"last": "Xiao",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1171--1181",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jiwei Tan, Xiaojun Wan, and Jianguo Xiao. 2017. Abstractive document summarization with a graph- based attentional neural model. In Proceedings of the 55th Annual Meeting of the Association for Com- putational Linguistics, volume 1, pages 1171-1181.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Pointer networks",
"authors": [
{
"first": "Oriol",
"middle": [],
"last": "Vinyals",
"suffix": ""
},
{
"first": "Meire",
"middle": [],
"last": "Fortunato",
"suffix": ""
},
{
"first": "Navdeep",
"middle": [],
"last": "Jaitly",
"suffix": ""
}
],
"year": 2015,
"venue": "Advances in Neural Information Processing Systems",
"volume": "",
"issue": "",
"pages": "2692--2700",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Oriol Vinyals, Meire Fortunato, and Navdeep Jaitly. 2015. Pointer networks. In Advances in Neural In- formation Processing Systems, pages 2692-2700.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Towards an iterative reinforcement approach for simultaneous document summarization and keyword extraction",
"authors": [
{
"first": "Xiaojun",
"middle": [],
"last": "Wan",
"suffix": ""
},
{
"first": "Jianwu",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Jianguo",
"middle": [],
"last": "Xiao",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 45th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "552--559",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xiaojun Wan, Jianwu Yang, and Jianguo Xiao. 2007. Towards an iterative reinforcement approach for si- multaneous document summarization and keyword extraction. In Proceedings of the 45th Annual Meet- ing of the Association for Computational Linguis- tics, pages 552-559.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"uris": null,
"text": "SWAP-NET architecture. EW: word encoder, ES: sentence encoder, DW: word decoder, DS: sentence decoder, Q: switch. Input document has words [w1, . . . , w5] and sentences [s1, s2]. Target sequence shown:",
"type_str": "figure"
},
"FIGREF1": {
"num": null,
"uris": null,
"text": "Illustration of word and sentence level attention in the second decoder step (Eq. 1 and Eq. 2). Purple: attention on words, Orange: attention on sentences, Unidirectional dotted arrows: attention from previous step, Bidirectional arrows: attention from previous and to present step. Best viewed in color.",
"type_str": "figure"
},
"TABREF1": {
"html": null,
"text": "Performance on Daily-Mail test set using the limited length recall of Rouge at 275 bytes.",
"num": null,
"content": "<table/>",
"type_str": "table"
},
"TABREF3": {
"html": null,
"text": "Performance on CNN and Daily-Mail test set using the full length Rouge F score.",
"num": null,
"content": "<table><tr><td>the previous best reported F-score by SummaRuN-</td></tr><tr><td>Ner, as seen in table 3, with a consistent improve-</td></tr><tr><td>ment of over 2 ROUGE points in all three metrics.</td></tr></table>",
"type_str": "table"
},
"TABREF4": {
"html": null,
"text": "Key word (KW) statistics per summary (average percentage) from 500 documents in Daily Mail test set. See text for definitions.",
"num": null,
"content": "<table/>",
"type_str": "table"
}
}
}
} |