File size: 132,603 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 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 | {
"paper_id": "2020",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T13:27:41.871835Z"
},
"title": "Contextualized Embeddings for Connective Disambiguation in Shallow Discourse Parsing",
"authors": [
{
"first": "Ren\u00e9",
"middle": [],
"last": "Knaebel",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Potsdam",
"location": {}
},
"email": "rknaebel@uni-potsdam.de"
},
{
"first": "Manfred",
"middle": [],
"last": "Stede",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Potsdam",
"location": {}
},
"email": "stede@uni-potsdam.de"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "This paper studies a novel model that simplifies the disambiguation of connectives for explicit discourse relations. We use a neural approach that integrates contextualized word embeddings and predicts whether a connective candidate is part of a discourse relation or not. We study the influence of those context specific-embeddings. Further, we show the benefit of training the tasks of connective disambiguation and sense classification together at the same time. The success of our approach is supported by state-of-the-art results.",
"pdf_parse": {
"paper_id": "2020",
"_pdf_hash": "",
"abstract": [
{
"text": "This paper studies a novel model that simplifies the disambiguation of connectives for explicit discourse relations. We use a neural approach that integrates contextualized word embeddings and predicts whether a connective candidate is part of a discourse relation or not. We study the influence of those context specific-embeddings. Further, we show the benefit of training the tasks of connective disambiguation and sense classification together at the same time. The success of our approach is supported by state-of-the-art results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Coherence is crucial for humans to be able to interpret text. The area of discourse parsing models this by identifying certain phrases (arguments) within a text and using discourse relations to unfold their underlying connections. These discourse relations and their understanding are important for tasks such as machine translation (Sim Smith, 2017) , abstractive summarization (Wu and Hu, 2018) , and text simplification (Zhong et al., 2020) . A subset of these relations is signaled by specific words, socalled discourse connectives (or discourse markers or cues), and thus referred to as explicit discourse relations. However, such cues can be ambiguous, as they may signal more than one relation type or may not always function as a relation indicator. Two challenges arise 1 -first, distinguishing connectives from words with mere sentential meaning:",
"cite_spans": [
{
"start": 333,
"end": 350,
"text": "(Sim Smith, 2017)",
"ref_id": "BIBREF27"
},
{
"start": 379,
"end": 396,
"text": "(Wu and Hu, 2018)",
"ref_id": "BIBREF37"
},
{
"start": 423,
"end": 443,
"text": "(Zhong et al., 2020)",
"ref_id": "BIBREF40"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "1. Mr. Perkins believes, however, that the market could be stabilized.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "2. \"The 1987 crash was a false alarm however you view it,\" says university of Chicago economist.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "1 Examples 1-2 are from PDTB (see Section 2); examples 3-6 are artificially constructed; senses follow PDTB2 style.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Here, example 1 shows a discourse relation, while example 2 uses 'however' in its sentential reading. The second challenge consists in classifying a connective's sense (described in detail in Section 2):",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "3. She owns a bike, while her brother drives a car. (Comparison.Contrast) 4. You should take the deal or even try to negotiate this price down. (Expansion.Alternative)",
"cite_spans": [
{
"start": 52,
"end": 73,
"text": "(Comparison.Contrast)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "5. If things work out, then everybody will be happy. (Contingency.Condition)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "6. While it is raining outside, I clean the dishes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "(Temporal.Synchronous)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Shallow discourse parsing (SDP) is the area that builds models to uncover such discourse structures within texts. SDP consists of the main tasks of identifying connectives, demarcating their arguments, assigning senses to them, and finding the senses of so-called implicit relations (which hold between adjacent text spans without a lexical signal being present). In this work, we focus in particular on the binary connective disambiguation of explicit discourse relations and, further, integrate explicit sense prediction into our model, as those two tasks are highly related.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Word embeddings provide dense token representations in a low-dimensional vector space pretrained on large unannotated text corpora. First, we use fast-Text (Bojanowski et al., 2017) , which is based on the skip-gram model (Mikolov et al., 2013) and integrates character -grams into its representation. Second, we use GloVe (Pennington et al., 2014) ; as opposed to fastText, those embeddings were calculated through co-occurrence statistics rather than trained by a neural network. Recently, models were introduced that provide contextualized word embeddings (Peters et al., 2018; Devlin et al., 2019) on demand and thus tackle the problem of identical representations for homonymous words with different senses, which had been indistinguishable in older models. For our experiments, we use BERT (Devlin et al., 2019) , which was successful in many areas of NLP (Liu and Lapata, 2019; .",
"cite_spans": [
{
"start": 156,
"end": 181,
"text": "(Bojanowski et al., 2017)",
"ref_id": "BIBREF2"
},
{
"start": 222,
"end": 244,
"text": "(Mikolov et al., 2013)",
"ref_id": "BIBREF17"
},
{
"start": 323,
"end": 348,
"text": "(Pennington et al., 2014)",
"ref_id": "BIBREF19"
},
{
"start": 559,
"end": 580,
"text": "(Peters et al., 2018;",
"ref_id": "BIBREF20"
},
{
"start": 581,
"end": 601,
"text": "Devlin et al., 2019)",
"ref_id": "BIBREF7"
},
{
"start": 796,
"end": 817,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF7"
},
{
"start": 862,
"end": 884,
"text": "(Liu and Lapata, 2019;",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this work, we present a novel approach to identifying explicit relations in shallow discourse parsing. We introduce a simple yet powerful model that outperforms previous research on the binary disambiguation of connective candidates. Furthermore, we adopt connective sense classification as an auxiliary task to improve performance and generalization capabilities and study the benefits of jointly training the auxiliary task in addition to the main task. This is because, in various cases, training neural models on multiple related tasks has shown beneficial for the learned representation (Caruana, 1993) , as it introduces inductive bias and, thereby, reduces the possible hypothesis space (Baxter, 2000) . Specifically, the work of Collobert et al. (2011) has pointed out the advantages of multitask learning on NLP tasks. We compare our results with state-of-the-art SDP components that took part at the CoNLL Shared Task in 2016. 2 The contributions of this paper are as follows:",
"cite_spans": [
{
"start": 595,
"end": 610,
"text": "(Caruana, 1993)",
"ref_id": "BIBREF4"
},
{
"start": 697,
"end": 711,
"text": "(Baxter, 2000)",
"ref_id": "BIBREF1"
},
{
"start": 740,
"end": 763,
"text": "Collobert et al. (2011)",
"ref_id": "BIBREF6"
},
{
"start": 940,
"end": 941,
"text": "2",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "1. We design a simple neural architecture that eliminates the need for hand-engineered features. To the best of our knowledge, this work is the first to provide state-of-the-art performance on word-embedding-based connective disambiguation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "2. We present a novel approach that successfully combines the two tasks of connective disambiguation and explicit sense classification into one single model. In contrast to previous work, we introduce a more sensitive measure and, with its help, demonstrate improved stability of the jointly trained model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In the following, Section 2 describes the corpus for the experiments; Section 3 explains our method. The experiments and results are presented in Section 4 and Section 5; Section 6 discusses relevant related work, followed by conclusions in Section 7.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Shallow discourse parsing is a challenging task that was promoted by the development of the second 2 We are not aware of more recent results. version of the Penn Discourse Treebank (PDTB2) (Prasad et al., 2008) . This corpus provides about 43,000 annotated discourse relations, of which roughly 18,000 are signalled by explicit discourse connectives. Those relations are further annotated with a three-level sense hierarchy (one or two senses per relation). All discourse relations consist of two arguments and are associated with one of various types; the focus of our work is on relations of the explicit type. The Shared Tasks at CoNLL 2015 and 2016 (Xue et al., 2015 (Xue et al., , 2016 used PDTB2 with minor changes. Successful systems were ; Wang and Lan (2016) ; Oepen et al. (2016) . They largely follow a pipeline architecture (Lin et al., 2014) , which consists of successive tasks of connective identification, argument labeling, and sense classification for both explicit and implicit relations.",
"cite_spans": [
{
"start": 99,
"end": 100,
"text": "2",
"ref_id": null
},
{
"start": 189,
"end": 210,
"text": "(Prasad et al., 2008)",
"ref_id": "BIBREF22"
},
{
"start": 653,
"end": 670,
"text": "(Xue et al., 2015",
"ref_id": "BIBREF38"
},
{
"start": 671,
"end": 690,
"text": "(Xue et al., , 2016",
"ref_id": "BIBREF39"
},
{
"start": 748,
"end": 767,
"text": "Wang and Lan (2016)",
"ref_id": "BIBREF32"
},
{
"start": 770,
"end": 789,
"text": "Oepen et al. (2016)",
"ref_id": "BIBREF18"
},
{
"start": 836,
"end": 854,
"text": "(Lin et al., 2014)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Penn Discourse Treebank",
"sec_num": "2"
},
{
"text": "Recently, PDTB3 (Prasad et al., 2018) was published, which extends the previous work with more available relations and corrects several former annotations. The authors also adjusted the relations' sense labels for a more balanced class distribution. For the sake of comparison with previous work on SDP, we stick to the PDTB2 corpus and assume to achieve similar results with PDTB3. Table 1 summarizes the distribution regarding sense classes, where we denote candidate words with sentential reading by NoConn. In both settings, NoConn dominates other classes and, thus, serves as the majority baseline. The first setting shows the four coarse sense classes provided by PDTB2. The second setting describes the fine senses as defined in the Shared Task. In contrast to the first setting, the distribution slightly changes, as rare training samples were removed or combined with other classes. Although the exact numbers for NoConn are the same in both settings, the ratios are different, which can be explained by the small modifications made to PDTB2 in the competitions.",
"cite_spans": [
{
"start": 16,
"end": 37,
"text": "(Prasad et al., 2018)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [
{
"start": 383,
"end": 390,
"text": "Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Penn Discourse Treebank",
"sec_num": "2"
},
{
"text": "This work introduces a first, simple neural architecture for shallow discourse connective disambiguation. The system builds upon previous observations that a word's context could be used as a strong indicator for the presence of a discourse relation (Lin et al., 2014) . 3 Our work investigates the limitations of knowledge free approaches and introduces a simple yet flexible model without domain knowledge.",
"cite_spans": [
{
"start": 250,
"end": 268,
"text": "(Lin et al., 2014)",
"ref_id": "BIBREF13"
},
{
"start": 271,
"end": 272,
"text": "3",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3"
},
{
"text": "We assume that word embeddings contain information about the discourse that can be used for the disambiguation task. We study standard noncontextualized embeddings (in particular, GloVe embeddings and Wikipedia-based fastText embeddings) and compare those to the recently developed contextualized embeddings (represented by BERT). We first hypothesize that contextualized embeddings yield better results than their noncontextualized counterpart. Second, we expect the context span to influence the model's performance, as the context may indicate a word's function more clearly.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3"
},
{
"text": "In addition, we propose a second model based on the first one, which successfully combines connective disambiguation with sense classification as an auxiliary task. We follow the idea of previous work that sense classification can be performed without extracting the connectives' arguments (Pitler and Nenkova, 2009; Lin et al., 2014; . Further, it has been previously shown that, for the identification of an explicit relation's sense, the connective itself as well as its context already provide significant information (Pitler and Nenkova, 2009; Lin et al., 2014; Wang and Lan, 2015; Ghosh et al., 2011) . Consequently, we assume the necessary information for sense classification to be already accessible by our neural connective disambiguation model to some degree. Also, this approach elim-inates the error propagation and the performance of our joint model stays as is without relying on previous predictions. The reason for adding sense classification as an auxiliary task in the first place is that joint training with auxiliary tasks has shown benefits in earlier work, as mentioned in Section 1. We could validate that this is the case with our connective disambiguation task as well, as later demonstrated in our experiments (see Section 4.2).",
"cite_spans": [
{
"start": 290,
"end": 316,
"text": "(Pitler and Nenkova, 2009;",
"ref_id": "BIBREF21"
},
{
"start": 317,
"end": 334,
"text": "Lin et al., 2014;",
"ref_id": "BIBREF13"
},
{
"start": 522,
"end": 548,
"text": "(Pitler and Nenkova, 2009;",
"ref_id": "BIBREF21"
},
{
"start": 549,
"end": 566,
"text": "Lin et al., 2014;",
"ref_id": "BIBREF13"
},
{
"start": 567,
"end": 586,
"text": "Wang and Lan, 2015;",
"ref_id": "BIBREF31"
},
{
"start": 587,
"end": 606,
"text": "Ghosh et al., 2011)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3"
},
{
"text": "In the following sections, we explain in more detail our binary connective disambiguation approach and the joint sense classification model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method",
"sec_num": "3"
},
{
"text": "For parsing explicit discourse relations, the first task usually involves the identification of possible connective candidates. For this purpose, we use a list of candidate patterns based on PDTB2. Some candidates might look like discourse connectives, however, they might only be in sentential use.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Embedding-Based Connective Disambiguation",
"sec_num": "3.1"
},
{
"text": "Connective annotation in PDTB2 is quite flexible. Connectives can be individual words ('indeed'), multiple consecutive words ('in the end'), or distant words that function together ('neither . . . nor'). In addition, they can contain adverbial modifications ('at least when,' 'even when,' 'usually when'), which vastly increases the number of possible connectives. Regarding this problem, the CoNLL Shared Task introduced a mapping that normalizes instances of connectives to their head by removing adverbial modifiers. For example, the three full connectives above all normalize to their head 'when.' For our studies, we follow this approach and focus on the disambiguation of connective head candidates rather than fully annotated connectives as in the original corpus.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Embedding-Based Connective Disambiguation",
"sec_num": "3.1"
},
{
"text": "We introduce a simple neural architecture (see Figure 1 ) that relies on pretrained word embeddings instead of hand-engineered features. The network consists of a multilayer perceptron with a single hidden layer. As the network's input, we use the candidate word's embeddings and its context.",
"cite_spans": [],
"ref_spans": [
{
"start": 47,
"end": 55,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Embedding-Based Connective Disambiguation",
"sec_num": "3.1"
},
{
"text": "A continuous token sequence of length is encoded as an embedding sequence ( 1 , 2 , \u2026 , ). We define our input with regards to the candidate's positions within the sentence (denoted as ) and use cmin and cmax for the first and last occurrence of the candidate, respectively. Finally, with a con- Figure 1 : Model overview. The average of the connective embeddings and their context serve as input, a single hidden layer is used for transformation, and the final layer outputs either the connective probability or sense classes.",
"cite_spans": [],
"ref_spans": [
{
"start": 296,
"end": 304,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Embedding-Based Connective Disambiguation",
"sec_num": "3.1"
},
{
"text": "text size of , our input looks as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Embedding-Based Connective Disambiguation",
"sec_num": "3.1"
},
{
"text": "ctx left = ( cmin\u2212 , \u2026 , cmin\u22121 ) conn = ( \u2236 \u2208 ) ctx right = ( cmax+1 , \u2026 , cmax+ )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Embedding-Based Connective Disambiguation",
"sec_num": "3.1"
},
{
"text": "Because the candidate might consist of multiple words ('in particular'), we simply average all candidate embeddings and concatenate remaining embeddings to build the network's input :",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Embedding-Based Connective Disambiguation",
"sec_num": "3.1"
},
{
"text": "= ctx left + conn + ctx right",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Embedding-Based Connective Disambiguation",
"sec_num": "3.1"
},
{
"text": "Thus, independent of the number of words describing a connective candidate, the input always has the same dimension. We do not average the embeddings of the context because this would lead to unwanted information loss.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Embedding-Based Connective Disambiguation",
"sec_num": "3.1"
},
{
"text": "For the transformation of candidates and their context into word embeddings, we use the tokenization provided by the CoNLL Shared Tasks. No other annotations such as POS, constituent trees, and dependencies are used for our experiments. GloVe and fastText are used for noncontextualized embeddings and BERT for contextualized embeddings. For contextualized embeddings, we noticed a difference in the tokenization of contractions. Therefore, we simply replaced occurrences of the token 'n't' by 'not' without changing the overall meaning.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Embedding-Based Connective Disambiguation",
"sec_num": "3.1"
},
{
"text": "The usage of embeddings is straightforward. Each token in a document is mapped to its embedding representation. In contrast, the contextualized embeddings are generated sentence-wise before extracting context and candidate embeddings. The input for BERT is prepared with special tags for sentence beginnings and ends. Further, original tokens might be split into smaller tokens based on the WordPiece tokenizer (Wu et al., 2016) before feeding them into BERT's encoder. This possibly leads to a higher number of BERT subtoken embeddings than tokens defined on the original corpus. Based on the alignment of original tokens and BERT subtokens, only the first BERT subtoken embedding of a corresponding token is used as its embedding. This selection follows the original BERT publication (Devlin et al., 2019) , where features were extracted and the finally predicted classes only rely on the first subtoken's position.",
"cite_spans": [
{
"start": 411,
"end": 428,
"text": "(Wu et al., 2016)",
"ref_id": "BIBREF36"
},
{
"start": 786,
"end": 807,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Embedding-Based Connective Disambiguation",
"sec_num": "3.1"
},
{
"text": "For the reasons explained in the beginning of Section 3, we combine binary connective disambiguation and sense classification into a single, second model. Thus, the model jointly learns whether a connective candidate serves as a discourse signal and, if so, determines its sense. We use the same model as in our previous experiment (see Figure 1 ) but introduce a novel prediction scheme for the joint classification. As both tasks have exclusive classes, our model either predicts whether a candidate is without sense, which is equivalent to having sentential reading, or predicts one of the desired sense classes.",
"cite_spans": [],
"ref_spans": [
{
"start": 337,
"end": 345,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Joint Disambiguation and Sense Classification",
"sec_num": "3.2"
},
{
"text": "Combining multiple tasks into a single model is called multitask learning (see Section 6).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Joint Disambiguation and Sense Classification",
"sec_num": "3.2"
},
{
"text": "For our experiments, we use PDTB2 (Prasad et al., 2008) , especially the version provided for the CoNLL Shared Task. We distinguish between coarse senses, which come from the original PDTB, and fine senses as defined by the Shared Task. Also, an official split is provided that makes comparisons to other systems more reliable. In particular, this means that we used folders 02-22 for training, folders 00 and 01 as a development set, and folders 23 and 24 for testing. We downloaded word embeddings for GloVe 4 and fastText 5 from their corresponding websites. For the contextualized embeddings, we extracted token embeddings that we had previously transformed using BERT. 6 As we work with highly imbalanced data, we present our results using precision, recall, and F1 score. Typically, there is a natural inverse rela- Table 2 : Experimental results for various embedding types (GloVe, fastText, BERT) and context sizes (ctx). Evaluation involves Section 23 of WSJ and the blind data set proposed for CoNLL Shared Task. All tasks are measured using F1 scores. Average precision is calculated for connective disambiguation and shown in parentheses. Results are ordered by primary task and separated with regards to the groups highlighted in Figure 2 .",
"cite_spans": [
{
"start": 34,
"end": 55,
"text": "(Prasad et al., 2008)",
"ref_id": "BIBREF22"
},
{
"start": 674,
"end": 675,
"text": "6",
"ref_id": null
}
],
"ref_spans": [
{
"start": 822,
"end": 829,
"text": "Table 2",
"ref_id": null
},
{
"start": 1243,
"end": 1251,
"text": "Figure 2",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "4"
},
{
"text": "tion between precision and recall-as one increases, the other decreases. Depending on the final usage, either one could be optimized. While in previous work, scores were usually reported for one specific threshold only, we decided to use precision-recall curves for our experimental results. These give a better understanding of the models' sensitivity to the selected threshold in our binary disambiguation task. To approximate the area under the precisionrecall curve, we compute the average precision (AP) score. While F1 score indicates performance for a single threshold only, the AP score helps to compare the precision-recall curves of various models.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "4"
},
{
"text": "In our experiments, we study different embedding types (GloVe, fastText, BERT) with a varying context size (ctx \u2208 {0, 1, 2}). The dimension (emb) of the noncontextualized word embeddings is 300 and 768 for contextualized embeddings, which results in an input size of (2 * ctx + 1) * emb. The size of the hidden layer is 2048. All models were trained for at most 50 epochs using early stopping (Prechelt, 1998) when validation loss did not improve over 10 epochs, a batch size of 128, and the Adam (Kingma and Ba, 2015) optimizer with a learning rate of 0.001. For comparison, we also provide a baseline from a reimplementation of Lin et al. (2014) . Table 2 reports the performances of our models per experimental setting for each data partition (test and blind) and highlights best performances. In the remainder of this section, we discuss the experimental results obtained for the models presented in Sections 3.1 and 3.2. Table 2 shows that for contextualized word embeddings, our model generally outperforms the baseline, in particular, the bert-ctx-1 configuration. This confirms our hypothesis that it is possible to disambiguate connectives to a good extent by using word embeddings. Further, certain groups of experiments can be visually distinguished (see Figures 2a) . The weakest performance was achieved when using noncontextualized word embeddings and zero context. This is probably due to the ambiguity of words that have multiple senses. Models that take context into account clearly outperform those with standalone embeddings. From this, we conclude that single noncontextualized word embeddings do not contain enough discourse information but that a model can compensate the missing information with the connective's context. Finally, contextualized embeddings seem to already contain this discourse information, as varying context sizes did not lead to clearly different results. Also, these embeddings may have outperformed noncontextualized embeddings because their features are already based on full sentences. As shown in Figure 2 , the baseline exhibited a high level of performance, between that of noncontextualized embeddings with context and contextualized embeddings.",
"cite_spans": [
{
"start": 393,
"end": 409,
"text": "(Prechelt, 1998)",
"ref_id": "BIBREF24"
},
{
"start": 630,
"end": 647,
"text": "Lin et al. (2014)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [
{
"start": 650,
"end": 657,
"text": "Table 2",
"ref_id": null
},
{
"start": 926,
"end": 933,
"text": "Table 2",
"ref_id": null
},
{
"start": 1266,
"end": 1277,
"text": "Figures 2a)",
"ref_id": "FIGREF0"
},
{
"start": 2046,
"end": 2054,
"text": "Figure 2",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Evaluation",
"sec_num": "4"
},
{
"text": "Comparing the results on the test (Figures 2a) and blind (Figures 2d) data sets, we notice the usual drop in performance, as both data sets differ in their distribution. The test set comes from news articles, while the blind set is based on Wikipedia. With other feature-based models submitted to the Shared Tasks, we expect this performance drop to be higher, so that our model would generalize better.",
"cite_spans": [],
"ref_spans": [
{
"start": 34,
"end": 70,
"text": "(Figures 2a) and blind (Figures 2d)",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Embedding-Based Connective Disambiguation",
"sec_num": "4.1"
},
{
"text": "We carried out a further analysis on the test data in order to characterize weaknesses of using word embeddings for connective disambiguation. Therefore, we examined our contextualized embedding model without context (bert-ctx-0), as it yielded high performance despite its low complexity. For most of the rare classification mistakes made by our model, we found that there existed similar embeddings to those that were misclassified, which naturally made them hard to distinguish for our model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Embedding-Based Connective Disambiguation",
"sec_num": "4.1"
},
{
"text": "For our second experimental setting, we study the influence of jointly training connective disambiguation and sense classification (coarse and fine senses shown in Figures 2b and 2c, respectively) . As our hypothesis, we assumed generalization to improve with increasing task complexity. For the commonly evaluated F1 score, we do not see a vast improvement between connective disambiguation and the joint training approach. In addition to the previous metric, we use the average precision score that better summarizes the overall ratio of precision and recall for a single model. With respect to this metric, we notice higher values for both kinds of sense classification in contrast to connective disambiguation. This confirms that, although the single F1 score might not change that much, more complex tasks indeed improve model generalization and result in more stable models. Further, it appears that training our model on fine senses is somewhat less effective for the main disambiguation task, as training on coarse senses often slightly outperforms it. Finally, we studied the predictions of our contextualized embedding model (see Figure 3) as before. Here, we compare both sense levels and notice a change of performance in Contingency and Expansion. While the coarse model works better on the second class than the first one, this turns around for the fine-sense model. Especially for the fine-sense model, we observe an overall drop of performance, which could be related to the smaller number of samples per class.",
"cite_spans": [],
"ref_spans": [
{
"start": 164,
"end": 196,
"text": "Figures 2b and 2c, respectively)",
"ref_id": "FIGREF0"
},
{
"start": 1140,
"end": 1149,
"text": "Figure 3)",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Joint Disambiguation and Sense Classification",
"sec_num": "4.2"
},
{
"text": "In our final comparison, Table 3 shows our bestperforming models for each category (standard vs. contextualized embeddings and connective disambiguation vs. joint training for sense classification). For comparison, we included test results from successful submissions to the CoNLL 2016 Shared Task (Xue et al., 2016 )-in particular, results that were achieved for connective disambiguation in the first part of the Shared Task and results for explicit sense classification taken from the second part. As Table 3 shows, when using contextualized embeddings, our model outperformed the other systems with F1 scores of up to 97.32. The authors of the models (Stepanov and Soochow) unfortunately submitted results only for the first task, and thus, we cannot compare their performance on sense classification to our model's performance. The numbers for sense classification of our proposed contextualized embedding approach are slightly below those of the compared systems. But it is important to note that the other systems are prone to error propagationerrors made early throughout the pipeline negatively affect all subsequent steps. However, in the competitions, error propagation was eliminated by providing preprocessed data to the competing systems. This can be considered an unfair advantage over our system, which performed all tasks simultaneously and thus had to operate on raw data.",
"cite_spans": [
{
"start": 298,
"end": 315,
"text": "(Xue et al., 2016",
"ref_id": "BIBREF39"
}
],
"ref_spans": [
{
"start": 25,
"end": 32,
"text": "Table 3",
"ref_id": "TABREF5"
},
{
"start": 504,
"end": 511,
"text": "Table 3",
"ref_id": "TABREF5"
}
],
"eq_spans": [],
"section": "Discussion",
"sec_num": "5"
},
{
"text": "In this section, we discuss work relevant to the area of discourse parsing, in particular, connective disambiguation and sense classification. Finally, recent work on word embeddings and multitask learning with regard to discourse parsing is outlined.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "For connective disambiguation, Pitler and Nenkova (2009) defined a set of syntactic features extracted from constituency trees. Beside the connective's surface and category information from related tree nodes (parent, siblings), they also used (Oepen et al., 2016) , Ecnuc (Wang and Lan, 2016) , Stepanov (Stepanov and Riccardi, 2016a) , Soochow (Fan et al., 2016) . The ending -mtl refers to the results for fine-sense classification in Table 2. binary features that check whether categories are contained by the nodes' traces and pairwise interaction features. In addition to these features, Lin et al. (2014) propose a set of lexicosyntactic features, as they observe that a connective's immediate context and part of speech is already a strong indicator for disambiguation. The authors further extend those features by category paths from the connective to the root. Wang and Lan (2015) further extend the previous two works and add similar features for more syntactic context information of the connective. Oepen et al. (2016) combine previous feature sets with work on identifying expressions of speculation and negation (Velldal et al., 2012) . Recent work of Webber et al. (2019) highlights the complexity of several kinds of ambiguity when working with discourse connectives.",
"cite_spans": [
{
"start": 31,
"end": 56,
"text": "Pitler and Nenkova (2009)",
"ref_id": "BIBREF21"
},
{
"start": 244,
"end": 264,
"text": "(Oepen et al., 2016)",
"ref_id": "BIBREF18"
},
{
"start": 273,
"end": 293,
"text": "(Wang and Lan, 2016)",
"ref_id": "BIBREF32"
},
{
"start": 305,
"end": 335,
"text": "(Stepanov and Riccardi, 2016a)",
"ref_id": "BIBREF28"
},
{
"start": 346,
"end": 364,
"text": "(Fan et al., 2016)",
"ref_id": "BIBREF8"
},
{
"start": 594,
"end": 611,
"text": "Lin et al. (2014)",
"ref_id": "BIBREF13"
},
{
"start": 871,
"end": 890,
"text": "Wang and Lan (2015)",
"ref_id": "BIBREF31"
},
{
"start": 1012,
"end": 1031,
"text": "Oepen et al. (2016)",
"ref_id": "BIBREF18"
},
{
"start": 1127,
"end": 1149,
"text": "(Velldal et al., 2012)",
"ref_id": "BIBREF30"
},
{
"start": 1167,
"end": 1187,
"text": "Webber et al. (2019)",
"ref_id": "BIBREF34"
}
],
"ref_spans": [
{
"start": 438,
"end": 446,
"text": "Table 2.",
"ref_id": null
}
],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "The connective and its explicit sense have a strong correlation as shown by Pitler and Nenkova (2009) , who report accuracy higher than the interannotator agreement for their connective disambiguation features on coarse-grained level senses. Lin et al. (2014) use only context features and evaluate their work on second-level senses. Wang and Lan (2015) extend previous features and develop a model for the CoNNL Shared Task. Oepen et al. (2016) use an ensemble of three types of classifiers that are mainly based on previous features (Wang and Lan, 2015) . Stepanov and Riccardi (2016b) use chained information extracted from syntactical trees and chunk tags. use convolutional neural networks on word-level embedded sentence pairs but a linear model with additional dependency features for sense classification. Braud and Denis (2015) have shown that word embeddings outperform sparse features for implicit sense classification. They compare word pair features with Brown clusters and low-dimensional word embeddings. Bai and Zhao (2018) use different levels of input representations, ranging from character level to contextualized word embeddings. Kishimoto et al. (2020) adapt BERT to perform implicit discourse sense classification. They show promising results by adding tasks, such as connective prediction, for pretraining.",
"cite_spans": [
{
"start": 76,
"end": 101,
"text": "Pitler and Nenkova (2009)",
"ref_id": "BIBREF21"
},
{
"start": 242,
"end": 259,
"text": "Lin et al. (2014)",
"ref_id": "BIBREF13"
},
{
"start": 334,
"end": 353,
"text": "Wang and Lan (2015)",
"ref_id": "BIBREF31"
},
{
"start": 426,
"end": 445,
"text": "Oepen et al. (2016)",
"ref_id": "BIBREF18"
},
{
"start": 535,
"end": 555,
"text": "(Wang and Lan, 2015)",
"ref_id": "BIBREF31"
},
{
"start": 558,
"end": 587,
"text": "Stepanov and Riccardi (2016b)",
"ref_id": "BIBREF29"
},
{
"start": 814,
"end": 836,
"text": "Braud and Denis (2015)",
"ref_id": "BIBREF3"
},
{
"start": 1020,
"end": 1039,
"text": "Bai and Zhao (2018)",
"ref_id": "BIBREF0"
},
{
"start": 1151,
"end": 1174,
"text": "Kishimoto et al. (2020)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "Multitask learning is also successfully applied to implicit sense classification . The authors combine four different tasks related to discourse parsing, but in contrast to our work, they rely on previously extracted argument spans. Qin et al. (2017) propose a model that, in addition to their main task (implicit sense classification), also learns to predict a possible connective that could be inserted. Lan et al. (2017) introduce various models that perform multitask learning, and their focus also lies on implicit sense classification.",
"cite_spans": [
{
"start": 233,
"end": 250,
"text": "Qin et al. (2017)",
"ref_id": "BIBREF26"
},
{
"start": 406,
"end": 423,
"text": "Lan et al. (2017)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "In this work, we studied the value of discourse information in different kinds of word embeddings. We first presented a novel feature-free approach to connective disambiguation that achieves state-ofthe-art results on this task. Then, this approach was extended by explicit sense classification to study the influence of jointly training both tasks. While our second approach does not directly outperform previous approaches on explicit sense classification, our model can be directly applied to raw input without being subject to error propagation, which is an advantage of our approach.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "7"
},
{
"text": "As our work indicates that combining multiple subtasks avoid error propagation issues, a future direction could be to investigate what other kinds of subtasks could be combined in order to benefit from this. Also, word embeddings have shown to be very flexible, and they are useful even for outof-domain data. It is worth investigating whether they are suitable for language transfer. This is particularly interesting because data sets of a similar quality to PDTB do not exist for many languages other than English.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "7"
},
{
"text": "Note that a word's context refers to the words immediately preceding and succeeding it, which is not to be confused with contextualized or noncontextualized word embeddings.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "nlp.stanford.edu/data/glove.6B.zip 5 dl.fbaipublicfiles.com/fasttext/ vectors-english/wiki-news-300d-1M.vec.zip6 We use the bert-base-uncased model provided by Huggingface's transformer(Wolf et al., 2019).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Deep enhanced representation for implicit discourse relation recognition",
"authors": [
{
"first": "Hongxiao",
"middle": [],
"last": "Bai",
"suffix": ""
},
{
"first": "Hai",
"middle": [],
"last": "Zhao",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 27th International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "571--583",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hongxiao Bai and Hai Zhao. 2018. Deep enhanced representation for implicit discourse relation recogni- tion. In Proceedings of the 27th International Con- ference on Computational Linguistics, pages 571- 583, Santa Fe, New Mexico, USA. Association for Computational Linguistics.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "A model of inductive bias learning",
"authors": [
{
"first": "Jonathan",
"middle": [],
"last": "Baxter",
"suffix": ""
}
],
"year": 2000,
"venue": "Journal of artificial intelligence research",
"volume": "12",
"issue": "",
"pages": "149--198",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jonathan Baxter. 2000. A model of inductive bias learning. Journal of artificial intelligence research, 12:149-198.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Enriching word vectors with subword information",
"authors": [
{
"first": "Piotr",
"middle": [],
"last": "Bojanowski",
"suffix": ""
},
{
"first": "Edouard",
"middle": [],
"last": "Grave",
"suffix": ""
},
{
"first": "Armand",
"middle": [],
"last": "Joulin",
"suffix": ""
},
{
"first": "Tomas",
"middle": [],
"last": "Mikolov",
"suffix": ""
}
],
"year": 2017,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "5",
"issue": "",
"pages": "135--146",
"other_ids": {
"DOI": [
"10.1162/tacl_a_00051"
]
},
"num": null,
"urls": [],
"raw_text": "Piotr Bojanowski, Edouard Grave, Armand Joulin, and Tomas Mikolov. 2017. Enriching word vectors with subword information. Transactions of the Associa- tion for Computational Linguistics, 5:135-146.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Comparing word representations for implicit discourse relation classification",
"authors": [
{
"first": "Chlo\u00e9",
"middle": [],
"last": "Braud",
"suffix": ""
},
{
"first": "Pascal",
"middle": [],
"last": "Denis",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "2201--2211",
"other_ids": {
"DOI": [
"10.18653/v1/D15-1262"
]
},
"num": null,
"urls": [],
"raw_text": "Chlo\u00e9 Braud and Pascal Denis. 2015. Comparing word representations for implicit discourse relation classi- fication. In Proceedings of the 2015 Conference on Empirical Methods in Natural Language Processing, pages 2201-2211, Lisbon, Portugal. Association for Computational Linguistics.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Multitask learning: A knowledge-based source of inductive bias",
"authors": [
{
"first": "Richard",
"middle": [
"A"
],
"last": "Caruana",
"suffix": ""
}
],
"year": 1993,
"venue": "Machine Learning Proceedings",
"volume": "",
"issue": "",
"pages": "41--48",
"other_ids": {
"DOI": [
"10.1016/B978-1-55860-307-3.50012-5"
]
},
"num": null,
"urls": [],
"raw_text": "Richard A. Caruana. 1993. Multitask learning: A knowledge-based source of inductive bias. In Ma- chine Learning Proceedings 1993, pages 41 -48.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Natural language processing (almost) from scratch",
"authors": [
{
"first": "Ronan",
"middle": [],
"last": "Collobert",
"suffix": ""
},
{
"first": "Jason",
"middle": [],
"last": "Weston",
"suffix": ""
},
{
"first": "L\u00e9on",
"middle": [],
"last": "Bottou",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Karlen",
"suffix": ""
},
{
"first": "Koray",
"middle": [],
"last": "Kavukcuoglu",
"suffix": ""
},
{
"first": "Pavel",
"middle": [],
"last": "Kuksa",
"suffix": ""
}
],
"year": 2011,
"venue": "J. Mach. Learn. Res",
"volume": "12",
"issue": "",
"pages": "2493--2537",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ronan Collobert, Jason Weston, L\u00e9on Bottou, Michael Karlen, Koray Kavukcuoglu, and Pavel Kuksa. 2011. Natural language processing (almost) from scratch. J. Mach. Learn. Res., 12(null):2493-2537.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "BERT: Pre-training of deep bidirectional transformers for language understanding",
"authors": [
{
"first": "Jacob",
"middle": [],
"last": "Devlin",
"suffix": ""
},
{
"first": "Ming-Wei",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Kenton",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "1",
"issue": "",
"pages": "4171--4186",
"other_ids": {
"DOI": [
"10.18653/v1/N19-1423"
]
},
"num": null,
"urls": [],
"raw_text": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of deep bidirectional transformers for language under- standing. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pages 4171-4186, Minneapolis, Minnesota. Associ- ation for Computational Linguistics.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Finding arguments as sequence labeling in discourse parsing",
"authors": [
{
"first": "Ziwei",
"middle": [],
"last": "Fan",
"suffix": ""
},
{
"first": "Zhenghua",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Min",
"middle": [],
"last": "Zhang",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the CoNLL-16 shared task",
"volume": "",
"issue": "",
"pages": "150--157",
"other_ids": {
"DOI": [
"10.18653/v1/K16-2021"
]
},
"num": null,
"urls": [],
"raw_text": "Ziwei Fan, Zhenghua Li, and Min Zhang. 2016. Find- ing arguments as sequence labeling in discourse pars- ing. In Proceedings of the CoNLL-16 shared task, pages 150-157. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Shallow discourse parsing with conditional random fields",
"authors": [
{
"first": "Sucheta",
"middle": [],
"last": "Ghosh",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Johansson",
"suffix": ""
},
{
"first": "Giuseppe",
"middle": [],
"last": "Riccardi",
"suffix": ""
},
{
"first": "Sara",
"middle": [],
"last": "Tonelli",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of 5th International Joint Conference on Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1071--1079",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sucheta Ghosh, Richard Johansson, Giuseppe Riccardi, and Sara Tonelli. 2011. Shallow discourse parsing with conditional random fields. In Proceedings of 5th International Joint Conference on Natural Lan- guage Processing, pages 1071-1079, Chiang Mai, Thailand. Asian Federation of Natural Language Pro- cessing.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"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": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Diederik P. Kingma and Jimmy Ba. 2015. Adam: A method for stochastic optimization. CoRR, abs/1412.6980.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Adapting BERT to implicit discourse relation classification with a focus on discourse connectives",
"authors": [
{
"first": "Yudai",
"middle": [],
"last": "Kishimoto",
"suffix": ""
},
{
"first": "Yugo",
"middle": [],
"last": "Murawaki",
"suffix": ""
},
{
"first": "Sadao",
"middle": [],
"last": "Kurohashi",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 12th Language Resources and Evaluation Conference",
"volume": "",
"issue": "",
"pages": "1152--1158",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yudai Kishimoto, Yugo Murawaki, and Sadao Kuro- hashi. 2020. Adapting BERT to implicit discourse relation classification with a focus on discourse con- nectives. In Proceedings of the 12th Language Re- sources and Evaluation Conference, pages 1152- 1158, Marseille, France. European Language Re- sources Association.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Multi-task attention-based neural networks for implicit discourse relationship representation and identification",
"authors": [
{
"first": "Man",
"middle": [],
"last": "Lan",
"suffix": ""
},
{
"first": "Jianxiang",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Yuanbin",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Zheng-Yu",
"middle": [],
"last": "Niu",
"suffix": ""
},
{
"first": "Haifeng",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1299--1308",
"other_ids": {
"DOI": [
"10.18653/v1/D17-1134"
]
},
"num": null,
"urls": [],
"raw_text": "Man Lan, Jianxiang Wang, Yuanbin Wu, Zheng-Yu Niu, and Haifeng Wang. 2017. Multi-task attention-based neural networks for implicit discourse relationship representation and identification. In Proceedings of the 2017 Conference on Empirical Methods in Natu- ral Language Processing, pages 1299-1308, Copen- hagen, Denmark. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "A pdtb-styled end-to-end discourse parser",
"authors": [
{
"first": "Ziheng",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Min-Yen",
"middle": [],
"last": "Hwee Tou Ng",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Kan",
"suffix": ""
}
],
"year": 2014,
"venue": "Natural Language Engineering",
"volume": "20",
"issue": "",
"pages": "151--184",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ziheng Lin, Hwee Tou Ng, and Min-Yen Kan. 2014. A pdtb-styled end-to-end discourse parser. Natural Language Engineering, 20:151-184.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Multi-task deep neural networks for natural language understanding",
"authors": [
{
"first": "Xiaodong",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Pengcheng",
"middle": [],
"last": "He",
"suffix": ""
},
{
"first": "Weizhu",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Jianfeng",
"middle": [],
"last": "Gao",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "4487--4496",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1441"
]
},
"num": null,
"urls": [],
"raw_text": "Xiaodong Liu, Pengcheng He, Weizhu Chen, and Jian- feng Gao. 2019. Multi-task deep neural networks for natural language understanding. In Proceedings of the 57th Annual Meeting of the Association for Com- putational Linguistics, pages 4487-4496, Florence, Italy. Association for Computational Linguistics.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Text summarization with pretrained encoders",
"authors": [
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Mirella",
"middle": [],
"last": "Lapata",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)",
"volume": "",
"issue": "",
"pages": "3730--3740",
"other_ids": {
"DOI": [
"10.18653/v1/D19-1387"
]
},
"num": null,
"urls": [],
"raw_text": "Yang Liu and Mirella Lapata. 2019. Text summariza- tion with pretrained encoders. In Proceedings of the 2019 Conference on Empirical Methods in Nat- ural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP), pages 3730-3740, Hong Kong, China. Association for Computational Linguistics.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Implicit discourse relation classification via multi-task neural networks",
"authors": [
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Sujian",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Xiaodong",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Zhifang",
"middle": [],
"last": "Sui",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI'16",
"volume": "",
"issue": "",
"pages": "2750--2756",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yang Liu, Sujian Li, Xiaodong Zhang, and Zhifang Sui. 2016. Implicit discourse relation classification via multi-task neural networks. In Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, AAAI'16, page 2750-2756. AAAI Press.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Efficient estimation of word representations in vector space",
"authors": [
{
"first": "Tomas",
"middle": [],
"last": "Mikolov",
"suffix": ""
},
{
"first": "Kai",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Greg",
"middle": [],
"last": "Corrado",
"suffix": ""
},
{
"first": "Jeffrey",
"middle": [],
"last": "Dean",
"suffix": ""
}
],
"year": 2013,
"venue": "1st International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tomas Mikolov, Kai Chen, Greg Corrado, and Jeffrey Dean. 2013. Efficient estimation of word represen- tations in vector space. In 1st International Con- ference on Learning Representations, ICLR 2013, Scottsdale, Arizona, USA, May 2-4, 2013, Workshop Track Proceedings.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "OPT: Oslo-Potsdamteesside. pipelining rules, rankers, and classifier ensembles for shallow discourse parsing",
"authors": [
{
"first": "Stephan",
"middle": [],
"last": "Oepen",
"suffix": ""
},
{
"first": "Jonathon",
"middle": [],
"last": "Read",
"suffix": ""
},
{
"first": "Tatjana",
"middle": [],
"last": "Scheffler",
"suffix": ""
},
{
"first": "Uladzimir",
"middle": [],
"last": "Sidarenka",
"suffix": ""
},
{
"first": "Manfred",
"middle": [],
"last": "Stede",
"suffix": ""
},
{
"first": "Erik",
"middle": [],
"last": "Velldal",
"suffix": ""
},
{
"first": "Lilja",
"middle": [],
"last": "\u00d8vrelid",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the CoNLL-16 shared task",
"volume": "",
"issue": "",
"pages": "20--26",
"other_ids": {
"DOI": [
"10.18653/v1/K16-2002"
]
},
"num": null,
"urls": [],
"raw_text": "Stephan Oepen, Jonathon Read, Tatjana Scheffler, Uladzimir Sidarenka, Manfred Stede, Erik Velldal, and Lilja \u00d8vrelid. 2016. OPT: Oslo-Potsdam- teesside. pipelining rules, rankers, and classifier en- sembles for shallow discourse parsing. In Pro- ceedings of the CoNLL-16 shared task, pages 20- 26, Berlin, Germany. Association for Computational Linguistics.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "GloVe: Global vectors for word representation",
"authors": [
{
"first": "Jeffrey",
"middle": [],
"last": "Pennington",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Socher",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)",
"volume": "",
"issue": "",
"pages": "1532--1543",
"other_ids": {
"DOI": [
"10.3115/v1/D14-1162"
]
},
"num": null,
"urls": [],
"raw_text": "Jeffrey Pennington, Richard Socher, and Christopher Manning. 2014. GloVe: Global vectors for word rep- resentation. In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Process- ing (EMNLP), pages 1532-1543, Doha, Qatar. Asso- ciation for Computational Linguistics.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Deep contextualized word representations",
"authors": [
{
"first": "Matthew",
"middle": [],
"last": "Peters",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Neumann",
"suffix": ""
},
{
"first": "Mohit",
"middle": [],
"last": "Iyyer",
"suffix": ""
},
{
"first": "Matt",
"middle": [],
"last": "Gardner",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "Kenton",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "1",
"issue": "",
"pages": "2227--2237",
"other_ids": {
"DOI": [
"10.18653/v1/N18-1202"
]
},
"num": null,
"urls": [],
"raw_text": "Matthew Peters, Mark Neumann, Mohit Iyyer, Matt Gardner, Christopher Clark, Kenton Lee, and Luke Zettlemoyer. 2018. Deep contextualized word rep- resentations. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Tech- nologies, Volume 1 (Long Papers), pages 2227-2237, New Orleans, Louisiana. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Using syntax to disambiguate explicit discourse connectives in text",
"authors": [
{
"first": "Emily",
"middle": [],
"last": "Pitler",
"suffix": ""
},
{
"first": "Ani",
"middle": [],
"last": "Nenkova",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the ACL-IJCNLP 2009 Conference Short Papers",
"volume": "",
"issue": "",
"pages": "13--16",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Emily Pitler and Ani Nenkova. 2009. Using syntax to disambiguate explicit discourse connectives in text. In Proceedings of the ACL-IJCNLP 2009 Conference Short Papers, pages 13-16, Suntec, Singapore. Asso- ciation for Computational Linguistics.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "The penn discourse treebank 2.0",
"authors": [
{
"first": "Rashmi",
"middle": [],
"last": "Prasad",
"suffix": ""
},
{
"first": "Nikhil",
"middle": [],
"last": "Dinesh",
"suffix": ""
},
{
"first": "Alan",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Eleni",
"middle": [],
"last": "Miltsakaki",
"suffix": ""
},
{
"first": "Livio",
"middle": [],
"last": "Robaldo",
"suffix": ""
},
{
"first": "Aravind",
"middle": [],
"last": "Joshi",
"suffix": ""
},
{
"first": "Bonnie",
"middle": [],
"last": "Webber",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of LREC",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rashmi Prasad, Nikhil Dinesh, Alan Lee, Eleni Milt- sakaki, Livio Robaldo, Aravind Joshi, and Bonnie Webber. 2008. The penn discourse treebank 2.0. In In Proceedings of LREC.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Discourse annotation in the PDTB: The next generation",
"authors": [
{
"first": "Rashmi",
"middle": [],
"last": "Prasad",
"suffix": ""
},
{
"first": "Bonnie",
"middle": [],
"last": "Webber",
"suffix": ""
},
{
"first": "Alan",
"middle": [],
"last": "Lee",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings 14th Joint ACL -ISO Workshop on Interoperable Semantic Annotation",
"volume": "",
"issue": "",
"pages": "87--97",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rashmi Prasad, Bonnie Webber, and Alan Lee. 2018. Discourse annotation in the PDTB: The next genera- tion. In Proceedings 14th Joint ACL -ISO Workshop on Interoperable Semantic Annotation, pages 87-97, Santa Fe, New Mexico, USA. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Automatic early stopping using cross validation: quantifying the criteria",
"authors": [
{
"first": "L",
"middle": [],
"last": "Prechelt",
"suffix": ""
}
],
"year": 1998,
"venue": "Neural networks : the official journal of the International Neural Network Society",
"volume": "11",
"issue": "",
"pages": "761--767",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "L. Prechelt. 1998. Automatic early stopping using cross validation: quantifying the criteria. Neural networks : the official journal of the International Neural Net- work Society, 11 4:761-767.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Shallow discourse parsing using convolutional neural network",
"authors": [
{
"first": "Lianhui",
"middle": [],
"last": "Qin",
"suffix": ""
},
{
"first": "Zhisong",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Hai",
"middle": [],
"last": "Zhao",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the CoNLL-16 shared task",
"volume": "",
"issue": "",
"pages": "70--77",
"other_ids": {
"DOI": [
"10.18653/v1/K16-2010"
]
},
"num": null,
"urls": [],
"raw_text": "Lianhui Qin, Zhisong Zhang, and Hai Zhao. 2016. Shal- low discourse parsing using convolutional neural net- work. In Proceedings of the CoNLL-16 shared task, pages 70-77, Berlin, Germany. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Adversarial connective-exploiting networks for implicit discourse relation classification",
"authors": [
{
"first": "Lianhui",
"middle": [],
"last": "Qin",
"suffix": ""
},
{
"first": "Zhisong",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Hai",
"middle": [],
"last": "Zhao",
"suffix": ""
},
{
"first": "Zhiting",
"middle": [],
"last": "Hu",
"suffix": ""
},
{
"first": "Eric",
"middle": [],
"last": "Xing",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "1006--1017",
"other_ids": {
"DOI": [
"10.18653/v1/P17-1093"
]
},
"num": null,
"urls": [],
"raw_text": "Lianhui Qin, Zhisong Zhang, Hai Zhao, Zhiting Hu, and Eric Xing. 2017. Adversarial connective-exploiting networks for implicit discourse relation classifica- tion. In Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics (Vol- ume 1: Long Papers), pages 1006-1017, Vancouver, Canada. Association for Computational Linguistics.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "On integrating discourse in machine translation",
"authors": [
{
"first": "Karin",
"middle": [
"Sim"
],
"last": "Smith",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the Third Workshop on Discourse in Machine Translation",
"volume": "",
"issue": "",
"pages": "110--121",
"other_ids": {
"DOI": [
"10.18653/v1/W17-4814"
]
},
"num": null,
"urls": [],
"raw_text": "Karin Sim Smith. 2017. On integrating discourse in ma- chine translation. In Proceedings of the Third Work- shop on Discourse in Machine Translation, pages 110-121, Copenhagen, Denmark. Association for Computational Linguistics.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Unitn end-to-end discourse parser for conll 2016 shared task",
"authors": [
{
"first": "Evgeny",
"middle": [],
"last": "Stepanov",
"suffix": ""
},
{
"first": "Giuseppe",
"middle": [],
"last": "Riccardi",
"suffix": ""
}
],
"year": 2016,
"venue": "Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "85--91",
"other_ids": {
"DOI": [
"10.18653/v1/K16-2012"
]
},
"num": null,
"urls": [],
"raw_text": "Evgeny Stepanov and Giuseppe Riccardi. 2016a. Unitn end-to-end discourse parser for conll 2016 shared task. In Proceedings of the CoNLL-16 shared task, pages 85-91. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "UniTN end-to-end discourse parser for CoNLL 2016 shared task",
"authors": [
{
"first": "Evgeny",
"middle": [],
"last": "Stepanov",
"suffix": ""
},
{
"first": "Giuseppe",
"middle": [],
"last": "Riccardi",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the CoNLL-16 shared task",
"volume": "",
"issue": "",
"pages": "85--91",
"other_ids": {
"DOI": [
"10.18653/v1/K16-2012"
]
},
"num": null,
"urls": [],
"raw_text": "Evgeny Stepanov and Giuseppe Riccardi. 2016b. UniTN end-to-end discourse parser for CoNLL 2016 shared task. In Proceedings of the CoNLL-16 shared task, pages 85-91, Berlin, Germany. Association for Computational Linguistics.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Speculation and negation: Rules, rankers, and the role of syntax",
"authors": [
{
"first": "Erik",
"middle": [],
"last": "Velldal",
"suffix": ""
},
{
"first": "Lilja",
"middle": [],
"last": "\u00d8vrelid",
"suffix": ""
},
{
"first": "Jonathon",
"middle": [],
"last": "Read",
"suffix": ""
},
{
"first": "Stephan",
"middle": [],
"last": "Oepen",
"suffix": ""
}
],
"year": 2012,
"venue": "Computational Linguistics",
"volume": "38",
"issue": "2",
"pages": "369--410",
"other_ids": {
"DOI": [
"10.1162/COLI_a_00126"
]
},
"num": null,
"urls": [],
"raw_text": "Erik Velldal, Lilja \u00d8vrelid, Jonathon Read, and Stephan Oepen. 2012. Speculation and negation: Rules, rankers, and the role of syntax. Computational Lin- guistics, 38(2):369-410.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "A refined end-toend discourse parser",
"authors": [
{
"first": "Jianxiang",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Man",
"middle": [],
"last": "Lan",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of the Nineteenth Conference on Computational Natural Language Learning -Shared Task",
"volume": "",
"issue": "",
"pages": "17--24",
"other_ids": {
"DOI": [
"10.18653/v1/K15-2002"
]
},
"num": null,
"urls": [],
"raw_text": "Jianxiang Wang and Man Lan. 2015. A refined end-to- end discourse parser. In Proceedings of the Nine- teenth Conference on Computational Natural Lan- guage Learning -Shared Task, pages 17-24, Beijing, China. Association for Computational Linguistics.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Two end-to-end shallow discourse parsers for english and chinese in conll-2016 shared task",
"authors": [
{
"first": "Jianxiang",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Man",
"middle": [],
"last": "Lan",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the CoNLL-16 shared task",
"volume": "",
"issue": "",
"pages": "33--40",
"other_ids": {
"DOI": [
"10.18653/v1/K16-2004"
]
},
"num": null,
"urls": [],
"raw_text": "Jianxiang Wang and Man Lan. 2016. Two end-to-end shallow discourse parsers for english and chinese in conll-2016 shared task. In Proceedings of the CoNLL-16 shared task, pages 33-40. Association for Computational Linguistics.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "The dcu discourse parser for connective, argument identification and explicit sense classification",
"authors": [
{
"first": "Longyue",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Hokamp",
"suffix": ""
},
{
"first": "Tsuyoshi",
"middle": [],
"last": "Okita",
"suffix": ""
},
{
"first": "Xiaojun",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Qun",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of the Nineteenth Conference on Computational Natural Language Learning -Shared Task",
"volume": "",
"issue": "",
"pages": "89--94",
"other_ids": {
"DOI": [
"10.18653/v1/K15-2014"
]
},
"num": null,
"urls": [],
"raw_text": "Longyue Wang, Chris Hokamp, Tsuyoshi Okita, Xiao- jun Zhang, and Qun Liu. 2015. The dcu discourse parser for connective, argument identification and explicit sense classification. In Proceedings of the Nineteenth Conference on Computational Natural Language Learning -Shared Task, pages 89-94. As- sociation for Computational Linguistics.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Ambiguity in explicit discourse connectives",
"authors": [
{
"first": "Bonnie",
"middle": [],
"last": "Webber",
"suffix": ""
},
{
"first": "Rashmi",
"middle": [],
"last": "Prasad",
"suffix": ""
},
{
"first": "Alan",
"middle": [],
"last": "Lee",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 13th International Conference on Computational Semantics -Long Papers",
"volume": "",
"issue": "",
"pages": "134--141",
"other_ids": {
"DOI": [
"10.18653/v1/W19-0411"
]
},
"num": null,
"urls": [],
"raw_text": "Bonnie Webber, Rashmi Prasad, and Alan Lee. 2019. Ambiguity in explicit discourse connectives. In Pro- ceedings of the 13th International Conference on Computational Semantics -Long Papers, pages 134- 141, Gothenburg, Sweden. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "Huggingface's transformers: State-of-the-art natural language processing",
"authors": [
{
"first": "Thomas",
"middle": [],
"last": "Wolf",
"suffix": ""
},
{
"first": "Lysandre",
"middle": [],
"last": "Debut",
"suffix": ""
},
{
"first": "Victor",
"middle": [],
"last": "Sanh",
"suffix": ""
},
{
"first": "Julien",
"middle": [],
"last": "Chaumond",
"suffix": ""
},
{
"first": "Clement",
"middle": [],
"last": "Delangue",
"suffix": ""
},
{
"first": "Anthony",
"middle": [],
"last": "Moi",
"suffix": ""
},
{
"first": "Pierric",
"middle": [],
"last": "Cistac",
"suffix": ""
},
{
"first": "Tim",
"middle": [],
"last": "Rault",
"suffix": ""
},
{
"first": "R'emi",
"middle": [],
"last": "Louf",
"suffix": ""
},
{
"first": "Morgan",
"middle": [],
"last": "Funtowicz",
"suffix": ""
},
{
"first": "Jamie",
"middle": [],
"last": "Brew",
"suffix": ""
}
],
"year": 2019,
"venue": "ArXiv",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thomas Wolf, Lysandre Debut, Victor Sanh, Julien Chaumond, Clement Delangue, Anthony Moi, Pier- ric Cistac, Tim Rault, R'emi Louf, Morgan Funtow- icz, and Jamie Brew. 2019. Huggingface's trans- formers: State-of-the-art natural language process- ing. ArXiv, abs/1910.03771.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"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": "Quoc",
"middle": [
"V"
],
"last": "Le",
"suffix": ""
},
{
"first": "Mohammad",
"middle": [],
"last": "Norouzi",
"suffix": ""
},
{
"first": "Wolfgang",
"middle": [],
"last": "Macherey",
"suffix": ""
},
{
"first": "Maxim",
"middle": [],
"last": "Krikun",
"suffix": ""
},
{
"first": "Yuan",
"middle": [],
"last": "Cao",
"suffix": ""
},
{
"first": "Qin",
"middle": [],
"last": "Gao",
"suffix": ""
},
{
"first": "Klaus",
"middle": [],
"last": "Macherey",
"suffix": ""
},
{
"first": "Jeff",
"middle": [],
"last": "Klingner",
"suffix": ""
},
{
"first": "Apurva",
"middle": [],
"last": "Shah",
"suffix": ""
},
{
"first": "Melvin",
"middle": [],
"last": "Johnson",
"suffix": ""
},
{
"first": "Xiaobing",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Lukasz",
"middle": [],
"last": "Kaiser",
"suffix": ""
},
{
"first": "Stephan",
"middle": [],
"last": "Gouws",
"suffix": ""
},
{
"first": "Yoshikiyo",
"middle": [],
"last": "Kato",
"suffix": ""
},
{
"first": "Taku",
"middle": [],
"last": "Kudo",
"suffix": ""
},
{
"first": "Hideto",
"middle": [],
"last": "Kazawa",
"suffix": ""
},
{
"first": "Keith",
"middle": [],
"last": "Stevens",
"suffix": ""
},
{
"first": "George",
"middle": [],
"last": "Kurian",
"suffix": ""
},
{
"first": "Nishant",
"middle": [],
"last": "Patil",
"suffix": ""
},
{
"first": "Wei",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2016,
"venue": "Oriol Vinyals",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"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 Macherey, Jeff Klingner, Apurva Shah, Melvin Johnson, Xiaobing Liu, Lukasz Kaiser, Stephan Gouws, Yoshikiyo Kato, Taku Kudo, Hideto Kazawa, Keith Stevens, George Kurian, Nishant Patil, Wei Wang, Cliff Young, Ja- son Smith, Jason Riesa, Alex Rudnick, Oriol Vinyals, Greg Corrado, Macduff Hughes, and Jeffrey Dean. 2016. Google's neural machine translation system: Bridging the gap between human and machine trans- lation. CoRR, abs/1609.08144.",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"title": "Learning to extract coherent summary via deep reinforcement learning",
"authors": [
{
"first": "Yuxiang",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Baotian",
"middle": [],
"last": "Hu",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yuxiang Wu and Baotian Hu. 2018. Learning to extract coherent summary via deep reinforcement learning. CoRR, abs/1804.07036.",
"links": null
},
"BIBREF38": {
"ref_id": "b38",
"title": "The conll-2015 shared task on shallow discourse parsing",
"authors": [
{
"first": "Nianwen",
"middle": [],
"last": "Xue",
"suffix": ""
},
{
"first": "Sameer",
"middle": [],
"last": "Hwee Tou Ng",
"suffix": ""
},
{
"first": "Rashmi",
"middle": [],
"last": "Pradhan",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Prasad",
"suffix": ""
},
{
"first": "Attapol",
"middle": [],
"last": "Bryant",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Rutherford",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of the Nineteenth Conference on Computational Natural Language Learning -Shared Task",
"volume": "",
"issue": "",
"pages": "1--16",
"other_ids": {
"DOI": [
"10.18653/v1/K15-2001"
]
},
"num": null,
"urls": [],
"raw_text": "Nianwen Xue, Hwee Tou Ng, Sameer Pradhan, Rashmi Prasad, Christopher Bryant, and Attapol Rutherford. 2015. The conll-2015 shared task on shallow dis- course parsing. In Proceedings of the Nineteenth Conference on Computational Natural Language Learning -Shared Task, pages 1-16. Association for Computational Linguistics.",
"links": null
},
"BIBREF39": {
"ref_id": "b39",
"title": "Conll 2016 shared task on multilingual shallow discourse parsing",
"authors": [
{
"first": "Nianwen",
"middle": [],
"last": "Xue",
"suffix": ""
},
{
"first": "Sameer",
"middle": [],
"last": "Hwee Tou Ng",
"suffix": ""
},
{
"first": "Attapol",
"middle": [],
"last": "Pradhan",
"suffix": ""
},
{
"first": "Bonnie",
"middle": [],
"last": "Rutherford",
"suffix": ""
},
{
"first": "Chuan",
"middle": [],
"last": "Webber",
"suffix": ""
},
{
"first": "Hongmin",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2016,
"venue": "Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "1--19",
"other_ids": {
"DOI": [
"10.18653/v1/K16-2001"
]
},
"num": null,
"urls": [],
"raw_text": "Nianwen Xue, Hwee Tou Ng, Sameer Pradhan, At- tapol Rutherford, Bonnie Webber, Chuan Wang, and Hongmin Wang. 2016. Conll 2016 shared task on multilingual shallow discourse parsing. In Proceed- ings of the CoNLL-16 shared task, pages 1-19. As- sociation for Computational Linguistics.",
"links": null
},
"BIBREF40": {
"ref_id": "b40",
"title": "Discourse level factors for sentence deletion in text simplification",
"authors": [
{
"first": "Yang",
"middle": [],
"last": "Zhong",
"suffix": ""
},
{
"first": "Chao",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Wei",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Junyi Jessy",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2020,
"venue": "AAAI",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yang Zhong, Chao Jiang, Wei Xu, and Junyi Jessy Li. 2020. Discourse level factors for sentence deletion in text simplification. In AAAI.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"type_str": "figure",
"num": null,
"uris": null,
"text": "Precision-recall curves for connective disambiguation for the different models-binary disambiguation (left), joint coarse sense (middle), joint fine sense (right)-and data sets-test (top) and blind (bottom). The baseline is shown as a dashed line."
},
"FIGREF1": {
"type_str": "figure",
"num": null,
"uris": null,
"text": "Confusion matrix of bert-ctx-0 on test data for joint disambiguation and sense classification. Relative class values are reported for coarse and fine senses. The label None represents an absence of connectives."
},
"TABREF1": {
"num": null,
"html": null,
"content": "<table/>",
"type_str": "table",
"text": "Class distribution of the training data."
},
"TABREF2": {
"num": null,
"html": null,
"content": "<table><tr><td/><td>1 conn</td><td>1 conn</td><td>1 sense</td><td>1 conn</td><td>1 sense</td></tr><tr><td/><td/><td colspan=\"2\">Standard WSJ Test (Section 23)</td><td/><td/></tr><tr><td>bert-ctx-1</td><td>97.32 (99.20)</td><td>96.98 (99.77)</td><td>93.03</td><td>96.63 (99.78)</td><td>84.17</td></tr><tr><td>bert-ctx-0</td><td>97.20 (99.29)</td><td>97.45 (99.81)</td><td>92.12</td><td>97.18 (99.76)</td><td>86.26</td></tr><tr><td>bert-ctx-2</td><td>96.97 (99.08)</td><td>95.96 (99.71)</td><td>89.57</td><td>95.81 (99.72)</td><td>81.94</td></tr><tr><td>baseline</td><td>95.46 (97.11)</td><td>-</td><td>-</td><td>-</td><td>-</td></tr><tr><td>fasttext-ctx-1</td><td>92.09 (94.95)</td><td>92.26 (98.61)</td><td>87.51</td><td>92.63 (98.45)</td><td>80.39</td></tr><tr><td>glove-ctx-2</td><td>92.02 (94.58)</td><td>92.03 (98.52)</td><td>85.56</td><td>90.13 (98.20)</td><td>82.35</td></tr><tr><td>glove-ctx-1</td><td>91.76 (94.69)</td><td>91.90 (98.44)</td><td>87.22</td><td>91.30 (98.18)</td><td>78.17</td></tr><tr><td>fasttext-ctx-2</td><td>91.29 (94.98)</td><td>92.51 (98.86)</td><td>88.66</td><td>91.77 (98.47)</td><td>78.18</td></tr><tr><td>glove-ctx-0</td><td>84.99 (80.98)</td><td>84.33 (92.36)</td><td>75.53</td><td>84.80 (92.62)</td><td>66.19</td></tr><tr><td>fasttext-ctx-0</td><td>84.79 (80.72)</td><td>84.20 (92.27)</td><td>77.62</td><td>84.23 (92.59)</td><td>68.79</td></tr><tr><td/><td/><td>Wikipedia Blind Test</td><td/><td/><td/></tr><tr><td>bert-ctx-0</td><td>97.03 (98.52)</td><td>96.75 (99.74)</td><td>88.79</td><td>96.28 (99.72)</td><td>71.69</td></tr><tr><td>bert-ctx-1</td><td>96.98 (98.38)</td><td>96.18 (99.65)</td><td>90.41</td><td>96.31 (99.69)</td><td>71.51</td></tr><tr><td>bert-ctx-2</td><td>96.40 (97.29)</td><td>95.09 (99.56)</td><td>87.92</td><td>94.01 (99.54)</td><td>66.97</td></tr><tr><td>baseline</td><td>94.50 (95.06)</td><td>-</td><td>-</td><td>-</td><td>-</td></tr><tr><td>fasttext-ctx-2</td><td>88.99 (90.31)</td><td>89.34 (97.95)</td><td>82.05</td><td>88.26 (97.42)</td><td>59.81</td></tr><tr><td>fasttext-ctx-1</td><td>88.74 (90.10)</td><td>88.01 (97.56)</td><td>78.46</td><td>89.74 (98.06)</td><td>62.74</td></tr><tr><td>glove-ctx-1</td><td>87.86 (88.80)</td><td>87.39 (96.95)</td><td>77.85</td><td>87.78 (97.19)</td><td>62.92</td></tr><tr><td>glove-ctx-2</td><td>87.54 (87.61)</td><td>87.63 (97.45)</td><td>78.31</td><td>87.01 (97.10)</td><td>61.15</td></tr><tr><td>glove-ctx-0</td><td>81.86 (73.77)</td><td>82.36 (90.66)</td><td>64.16</td><td>81.87 (90.91)</td><td>40.46</td></tr><tr><td>fasttext-ctx-0</td><td>81.76 (73.64)</td><td>82.98 (90.70)</td><td>67.61</td><td>82.28 (90.87)</td><td>45.68</td></tr></table>",
"type_str": "table",
"text": ""
},
"TABREF5": {
"num": null,
"html": null,
"content": "<table/>",
"type_str": "table",
"text": "Task-related F1 scores. Results are taken from the CoNLL 2016 Shared Task website (http://www. cs.brandeis.edu/~clp/conll16st/results.html) for the following parsers: OPT"
}
}
}
} |