File size: 147,508 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 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 | {
"paper_id": "2022",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T16:31:36.593219Z"
},
"title": "Graph-combined Coreference Resolution Methods on Conversational Machine Reading Comprehension with Pre-trained Language Model",
"authors": [
{
"first": "Zhaodong",
"middle": [],
"last": "Wang",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Osaka University",
"location": {}
},
"email": ""
},
{
"first": "Kazunori",
"middle": [],
"last": "Komatani",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Osaka University",
"location": {}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Coreference resolution such as for anaphora has been an essential challenge that is commonly found in conversational machine reading comprehension (CMRC). This task aims to determine the referential entity to which a pronoun refers on the basis of contextual information. Existing approaches based on pre-trained language models (PLMs) mainly rely on an endto-end method, which still has limitations in clarifying referential dependency. In this study, a novel graph-based approach is proposed to integrate the coreference of given text into graph structures (called coreference graphs), which can pinpoint a pronoun's referential entity. We propose two graph-combined methods, evidence-enhanced and the fusion model, for CMRC to integrate coreference graphs from different levels of the PLM architecture. Evidenceenhanced refers to textual level methods that include an evidence generator (for generating new text to elaborate a pronoun) and enhanced question (for rewriting a pronoun in a question) as PLM input. The fusion model is a structural level method that combines the PLM with a graph neural network. We evaluated these approaches on a CoQA pronoun-containing dataset and the whole CoQA dataset. The result showed that our methods can outperform baseline PLM methods with BERT and RoBERTa.",
"pdf_parse": {
"paper_id": "2022",
"_pdf_hash": "",
"abstract": [
{
"text": "Coreference resolution such as for anaphora has been an essential challenge that is commonly found in conversational machine reading comprehension (CMRC). This task aims to determine the referential entity to which a pronoun refers on the basis of contextual information. Existing approaches based on pre-trained language models (PLMs) mainly rely on an endto-end method, which still has limitations in clarifying referential dependency. In this study, a novel graph-based approach is proposed to integrate the coreference of given text into graph structures (called coreference graphs), which can pinpoint a pronoun's referential entity. We propose two graph-combined methods, evidence-enhanced and the fusion model, for CMRC to integrate coreference graphs from different levels of the PLM architecture. Evidenceenhanced refers to textual level methods that include an evidence generator (for generating new text to elaborate a pronoun) and enhanced question (for rewriting a pronoun in a question) as PLM input. The fusion model is a structural level method that combines the PLM with a graph neural network. We evaluated these approaches on a CoQA pronoun-containing dataset and the whole CoQA dataset. The result showed that our methods can outperform baseline PLM methods with BERT and RoBERTa.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "In recent years, using a large-scale pre-trained language model (PLM) as a backbone for various challenging machine comprehension tasks (Devlin et al., 2019) has become fundamental, especially in conversational machine reading comprehension (CMRC) (Liu et al., 2019a) . CMRC tasks not only require a model to fully understand the given articles but also propose to mimic the way humans seek information in conversations through questionanswering. Most PLM utilize attention mechanism and achieve positive results on a broad range of CMRC datasets (Choi et al., 2018; Reddy et al., 2019). PLMs generally use an end-to-end approach trained from questions to answers. However, the explainability of the answers generated through the intrinsic multi-head self-attention mechanism remains insufficient. Although these PLMs have demonstrated great advantages in terms of solving questions that simply need semantic matching, limitations in logical comprehension (Ding et al., 2019) such as in coreference resolution still exist.",
"cite_spans": [
{
"start": 136,
"end": 157,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF4"
},
{
"start": 248,
"end": 267,
"text": "(Liu et al., 2019a)",
"ref_id": "BIBREF18"
},
{
"start": 547,
"end": 566,
"text": "(Choi et al., 2018;",
"ref_id": "BIBREF3"
},
{
"start": 567,
"end": 580,
"text": "Reddy et al.,",
"ref_id": "BIBREF30"
},
{
"start": 956,
"end": 975,
"text": "(Ding et al., 2019)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Coreference resolution such as for anaphora (von Heusinger and Egli, 2012) is commonly found in CMRC tasks. Anaphora can be described as a pronoun word (anaphor) contained in a current question, in which its referential entity (antecedent) has already been introduced earlier in the conversation history or article context. As shown in Figure 1 , to answer the current question \"Did she have any visitors?\", the model requires that the pronoun \"she\" be resolved as an anaphor referring to the entity \"Jessica\" as its antecedent, on the basis of the given context and conversation history. Therefore, CMRC models require mechanisms that can resolve referential dependencies to properly understand the intent of current questions.",
"cite_spans": [
{
"start": 44,
"end": 74,
"text": "(von Heusinger and Egli, 2012)",
"ref_id": "BIBREF37"
}
],
"ref_spans": [
{
"start": 336,
"end": 345,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Considering the shortcomings of the PLM approach in logical comprehension such as in coref-erence resolution, research on how to better adapt models to learn reasoning is gradually gaining attention (Yeh and Chen, 2019; Qu et al., 2019; Song et al., 2018) . FlowQA (Huang et al., 2019) was proposed to add a reasoning layer between questions and answers to incorporate intermediate representations of a conversation history. The question rewriting (QR) model (Vakulenko et al., 2021; Lin et al., 2020) was proposed to rewrite current questions on the basis of a conversation history. Specifically, the QR model simplifies complex multi-turn questionanswering (QA) tasks into single-turn QA tasks, which can solve a current question without a conversation history.",
"cite_spans": [
{
"start": 199,
"end": 219,
"text": "(Yeh and Chen, 2019;",
"ref_id": "BIBREF40"
},
{
"start": 220,
"end": 236,
"text": "Qu et al., 2019;",
"ref_id": "BIBREF26"
},
{
"start": 237,
"end": 255,
"text": "Song et al., 2018)",
"ref_id": "BIBREF33"
},
{
"start": 258,
"end": 285,
"text": "FlowQA (Huang et al., 2019)",
"ref_id": null
},
{
"start": 459,
"end": 483,
"text": "(Vakulenko et al., 2021;",
"ref_id": "BIBREF34"
},
{
"start": 484,
"end": 501,
"text": "Lin et al., 2020)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "However, because these models are built through the embeddings of a conversation history (Qu et al., 2019) , they generally suffer from two drawbacks in coreference reasoning for CMRC tasks. (1) Since the input length of a conversation history is limited by the PLM's structure, the current question sometimes contains pronouns whose referential entity does not appear in the conversation history, so the model cannot accordingly resolve referential dependencies. (2) To achieve coreference reasoning, a CMRC model also needs to seek information from the context of articles. Due to the sequence nature of the PLM and the multiple referential dependencies in the context of an article, these models cannot handle each referential dependency precisely, as shown in Figure 2 's context part in different colors.",
"cite_spans": [
{
"start": 89,
"end": 106,
"text": "(Qu et al., 2019)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [
{
"start": 764,
"end": 772,
"text": "Figure 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper, we propose solving the coreference of a target pronoun through additional mined information to enhance PLMs' coreference reasoning ability for CMRC. A novel graph approach is proposed that integrates the coreferences of given text into graph structures, which we call the coreference graph. The coreference graph is constructed separately by using the conversation history and article context as text information. Each entity in the graph holds a unique place label in accordance with the text information, which can be used to pinpoint every pronoun's referential dependency precisely. To better implement the coreference graph as an enhanced component into PLMs, we propose two graph-combined methods: the evidence-enhanced method and the fusion model method. These two methods integrate graph information from the textual and structural levels of the PLM architecture, respectively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The evidence-enhanced method involves two textual level methods that enrich the PLM's input information for coreference reasoning: an evidence generator (EG) generates new text to elaborate pronouns, and an enhanced question (EQ) rewrites a pronoun into a referential entity in a question.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The fusion model is a structural level method that combines the PLM with a graph neural network. This model treats the PLM as an encoder to extract sequence features of pronouns and referential words from input. After that, the graph features of the corresponding words are computed by graph neural networks on the basis of the connectivity of the coreference graph. These two features are integrated using learnable weights to enhance the PLM's coreference reasoning ability.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "For the experiments, we used questions from CoQA (Reddy et al., 2019) that contained pronouns to compose a new dataset (pronoun-containing dataset) specialized for the coreference reasoning ability of the CMRC model. We evaluated various combinations of our proposed methods on different PLMs, and we also compared them with the existing QR approach. The results showed that our methods can greatly outperform in terms of F1 score on the CoQA pronoun-containing dataset, 2.6 on BERT (Devlin et al., 2019) and 0.7 on RoBERTa (Liu et al., 2019b) . We also used the whole CoQA dataset to evaluate the fusion model, which achieved the best performance in our methods, to compare its overall performance with RoBERTa. The contributions of this paper are as follows.",
"cite_spans": [
{
"start": 49,
"end": 69,
"text": "(Reddy et al., 2019)",
"ref_id": "BIBREF30"
},
{
"start": 483,
"end": 504,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF4"
},
{
"start": 524,
"end": 543,
"text": "(Liu et al., 2019b)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 We propose a novel graph approach for coreference resolution. This approach can establish referential dependency that appears not only in a conversation history but also in an article context.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 We show that both our evidence-enhanced and fusion model methods boost the performance of different PLMs in CMRC coreference resolution. Therefore, we prove that the introduction of additional information can further leverage the performance of PLMs in complex reasoning such as in coreference resolution.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "\u2022 Our approaches provide a precise reasoning route for CMRC's coreference resolution and overcome the PLM model's weakness of interpretability. In recent years, the emergence of pre-trained language models (PLMs), including BERT (Devlin et al., 2019) , GPT-2 (Radford et al., 2019) , XL-NET , and RoBERTa (Liu et al., 2019b) , has refreshed the performance of various NLP tasks with advanced comprehension abilities.",
"cite_spans": [
{
"start": 229,
"end": 250,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF4"
},
{
"start": 253,
"end": 281,
"text": "GPT-2 (Radford et al., 2019)",
"ref_id": null
},
{
"start": 305,
"end": 324,
"text": "(Liu et al., 2019b)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "BERT is a representative model that is based on a multi-layer transformer (Vaswani et al., 2017) . It is trained by using a massive amount of text data through a masked language model and next sentence prediction. There have been several improvements to the BERT model (Qiu et al., 2020) , such as ConvBERT (Jiang et al., 2020) , which specifically improves its performance in MRC. These PLM-based models mostly increase the scale of model parameters or improve the attention mechanism through their structure, but they still lack reasoning-level analysis and evidence support due to them using end-to-end learning methods (Chen and Yih, 2020) .",
"cite_spans": [
{
"start": 74,
"end": 96,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF35"
},
{
"start": 269,
"end": 287,
"text": "(Qiu et al., 2020)",
"ref_id": "BIBREF25"
},
{
"start": 307,
"end": 327,
"text": "(Jiang et al., 2020)",
"ref_id": "BIBREF10"
},
{
"start": 623,
"end": 643,
"text": "(Chen and Yih, 2020)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Coreference resolution is the task of retrieving all references in text that refer to the same entity. With the development of deep learning, the neural network has been gradually used to solve coreferencing, such as CoNLL-2012 (Pradhan et al., 2012 , in recent years (Xu and Choi, 2020; Kirstain et al., 2021) . Lee et al. (Lee et al., 2017) first applied the LSTM (Sak et al., 2014) network to coreference resolution; it can extract referential dependencies directly from text. Joshi (Joshi et al., 2019 ) provided a PLM baseline for coreference resolution through BERT. Joshi also provided SpanBERT Joshi et al. (2020), which enhanced the PLM's performance, especially in coreference extraction.",
"cite_spans": [
{
"start": 217,
"end": 227,
"text": "CoNLL-2012",
"ref_id": null
},
{
"start": 228,
"end": 249,
"text": "(Pradhan et al., 2012",
"ref_id": "BIBREF23"
},
{
"start": 268,
"end": 287,
"text": "(Xu and Choi, 2020;",
"ref_id": "BIBREF38"
},
{
"start": 288,
"end": 310,
"text": "Kirstain et al., 2021)",
"ref_id": "BIBREF14"
},
{
"start": 313,
"end": 342,
"text": "Lee et al. (Lee et al., 2017)",
"ref_id": "BIBREF15"
},
{
"start": 366,
"end": 384,
"text": "(Sak et al., 2014)",
"ref_id": "BIBREF31"
},
{
"start": 486,
"end": 505,
"text": "(Joshi et al., 2019",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Coreference Resolution",
"sec_num": "2.2"
},
{
"text": "In this paper, we use AllenNLP Gardner et al. (2018)'s framework as an implementation of the approach by Lee et al.(Lee et al., 2017) with span-BERT for textual word embedding, and we achieve high-precision coreference extraction from a conversation history and article context.",
"cite_spans": [
{
"start": 105,
"end": 133,
"text": "Lee et al.(Lee et al., 2017)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Coreference Resolution",
"sec_num": "2.2"
},
{
"text": "Current machine reading comprehension (MRC) tasks can be classified into single-turn and multiturn types, depending on whether the question-answering relies on the conversation history. To tackle single-turn MRC such as SQuAD (Rajpurkar et al., 2018) , many models based on semantic matching have been proposed, such as BiDAF (Seo et al., 2017) , DrQA (Chen et al., 2017) , (Lin et al., 2018) , QANet (Yu et al., 2018) , and BERT (Devlin et al., 2019) , for MRC.",
"cite_spans": [
{
"start": 226,
"end": 250,
"text": "(Rajpurkar et al., 2018)",
"ref_id": "BIBREF29"
},
{
"start": 326,
"end": 344,
"text": "(Seo et al., 2017)",
"ref_id": "BIBREF32"
},
{
"start": 352,
"end": 371,
"text": "(Chen et al., 2017)",
"ref_id": "BIBREF1"
},
{
"start": 374,
"end": 392,
"text": "(Lin et al., 2018)",
"ref_id": "BIBREF17"
},
{
"start": 401,
"end": 418,
"text": "(Yu et al., 2018)",
"ref_id": "BIBREF33"
},
{
"start": 430,
"end": 451,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Machine Reading Comprehension",
"sec_num": "2.3"
},
{
"text": "However, for multi-turn MRC like CoQA (Reddy et al., 2019) and QuAC (Choi et al., 2018) , conversation-based questions and answers are introduced to enhance the connection between questions (known as CMRC (Liu et al., 2019a) ). The ambiguity of a question increases (Min et al., 2020) due to the addition of a conversation history. Thus, to predict the answer\u00c2 i for the current question Q i , the model should not only have to comprehend the article context C but also the conversation history H i from the beginning (Q 1 , A 1 ) to the previous turn (Q i\u22121 , A i\u22121 ) for integration.",
"cite_spans": [
{
"start": 38,
"end": 58,
"text": "(Reddy et al., 2019)",
"ref_id": "BIBREF30"
},
{
"start": 68,
"end": 87,
"text": "(Choi et al., 2018)",
"ref_id": "BIBREF3"
},
{
"start": 205,
"end": 224,
"text": "(Liu et al., 2019a)",
"ref_id": "BIBREF18"
},
{
"start": 266,
"end": 284,
"text": "(Min et al., 2020)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Machine Reading Comprehension",
"sec_num": "2.3"
},
{
"text": "H i = {Q 1 , A 1 , ..., Q i\u22121 , A i\u22121 }",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Machine Reading Comprehension",
"sec_num": "2.3"
},
{
"text": "(1)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Machine Reading Comprehension",
"sec_num": "2.3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "A i = argmax(P (A i |Q i , C, H i ))",
"eq_num": "(2)"
}
],
"section": "Machine Reading Comprehension",
"sec_num": "2.3"
},
{
"text": "For multi-turn MRC, several works (Huang et al., 2019; Yeh and Chen, 2019; Qu et al., 2019; Song et al., 2018) have incorporated reasoning representation to capture a conversation history's embedding. In comparison, approaches like question rewriting (QR) (Papakonstantinou and Vassalos, 1999) aim to break down multi-turn MRC into single-turn subtasks to minimize the complexity of multi-turn MRC (Vakulenko et al., 2021) . CA-NARD (Elgohary et al., 2019) rewrites QuAC's questions and introduces this rewriting to the QR task. QR models (Vakulenko et al., 2021; Lin et al., 2020) rewrite current questions to incorporate a conversation history. However, due to the variable length of a conversation history, such models still have limitations in precisely resolving the coreference in questions.",
"cite_spans": [
{
"start": 55,
"end": 74,
"text": "Yeh and Chen, 2019;",
"ref_id": "BIBREF40"
},
{
"start": 75,
"end": 91,
"text": "Qu et al., 2019;",
"ref_id": "BIBREF26"
},
{
"start": 92,
"end": 110,
"text": "Song et al., 2018)",
"ref_id": "BIBREF33"
},
{
"start": 256,
"end": 293,
"text": "(Papakonstantinou and Vassalos, 1999)",
"ref_id": "BIBREF22"
},
{
"start": 398,
"end": 422,
"text": "(Vakulenko et al., 2021)",
"ref_id": "BIBREF34"
},
{
"start": 433,
"end": 456,
"text": "(Elgohary et al., 2019)",
"ref_id": "BIBREF7"
},
{
"start": 539,
"end": 563,
"text": "(Vakulenko et al., 2021;",
"ref_id": "BIBREF34"
},
{
"start": 564,
"end": 581,
"text": "Lin et al., 2020)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Machine Reading Comprehension",
"sec_num": "2.3"
},
{
"text": "In this section, we describe the architecture of our methods as an enhanced PLM component, as illustrated in Figure 2 . The model contains two stages.",
"cite_spans": [],
"ref_spans": [
{
"start": 109,
"end": 117,
"text": "Figure 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Propsed Methods",
"sec_num": "3"
},
{
"text": "(1) We construct a coreference graph from textural information towards solving the pronoun's referential entity in a question. (2) We use our two methods, evidence-enhanced and the fusion model, to integrate a referential entity's information into PLMs using textual and structural levels, respectively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Propsed Methods",
"sec_num": "3"
},
{
"text": "Inspired by the previous works (Song et al., 2018; Bastings et al., 2017; Dhingra et al., 2018) , we introduce graph structures for the anaphora in questions. Specifically, our method uses the approach by Lee et al. (Lee et al., 2017) with SpanBERT word embedding to precisely extract all coreferences in text and organize them into graph structures. Additionally, we propose modeling the conversation history and article context separately in structures to fully use the graph information.",
"cite_spans": [
{
"start": 31,
"end": 50,
"text": "(Song et al., 2018;",
"ref_id": "BIBREF33"
},
{
"start": 51,
"end": 73,
"text": "Bastings et al., 2017;",
"ref_id": "BIBREF0"
},
{
"start": 74,
"end": 95,
"text": "Dhingra et al., 2018)",
"ref_id": "BIBREF5"
},
{
"start": 205,
"end": 234,
"text": "Lee et al. (Lee et al., 2017)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Coreference Graph",
"sec_num": "3.1"
},
{
"text": "In the article context part, because there may be multi-identical pronouns referring to different entities in a context (e.g., \"he\" could refer to two males in the same article context), the current sentence number (order number) is kept after entities to ensure their uniqueness. As shown in Figure 3 with different numbers. To organize the entities into a graph, all of the anaphors (pronouns) are connected to the initially-occurring antecedent (referential entity). In this way, the entire context can be processed into a graph with multiple clusters, and each cluster holds a unique referential entity, as illustrated in Figure 3 in different colors.",
"cite_spans": [],
"ref_spans": [
{
"start": 293,
"end": 301,
"text": "Figure 3",
"ref_id": "FIGREF3"
},
{
"start": 626,
"end": 634,
"text": "Figure 3",
"ref_id": "FIGREF3"
}
],
"eq_spans": [],
"section": "Coreference Graph",
"sec_num": "3.1"
},
{
"text": "In the conversation history part, to avoid multiidentical pronouns, the Q i label for the i-th question and A i label for the i-th answer are added behind an entity in a conversation history. In the construction part, considering the time-sequence nature of a conversation history, we use a conversation history's order sequences (Q 1 , A 1 , Q 2 , A 2 , ...) to connect these entities into a queue structure.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Coreference Graph",
"sec_num": "3.1"
},
{
"text": "As illustrated in Figure 3 , this procedure can extract the coreference information from text into a coreference graph. First, we extract reference words with relevant number labels as referential entities. In this way, each reference word can be classified into various clusters (shown in different colors in the top half of Figure 3 ). In the graph construction of the article context part, we use the first referential entity in one cluster and the initially-occurring antecedent as the head node. We connect all the remaining referential entities in the cluster to the head node. For the conversation history part, we connect the referential entities in the cluster in a queue in the order sequence (Q 1 , A 1 , Q 2 , A 2 , ...). Accordingly, this step is repeated for every cluster until each reference word has been processed into a graph structure as a unique entity.",
"cite_spans": [],
"ref_spans": [
{
"start": 18,
"end": 26,
"text": "Figure 3",
"ref_id": "FIGREF3"
},
{
"start": 326,
"end": 334,
"text": "Figure 3",
"ref_id": "FIGREF3"
}
],
"eq_spans": [],
"section": "Coreference Graph Construction",
"sec_num": "3.1.1"
},
{
"text": "Antecedent retrieval is a process of querying the referential entity of a target pronoun through a coreference graph. For retrieval from an article context, the target pronoun and the sentence's order index are considered to form a query entity. When the node of the query entity is found, it is used as the starting node for a graph search until a non-pronoun entity is found as a referential entity for the result.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Antecedent Retrieval",
"sec_num": "3.1.2"
},
{
"text": "We learned from previous studies Ding et al., 2019 ) that additional evidence is essential for a PLM's logical comprehension. Therefore, we present textual reformulation methods for resolving the referential dependency of current pronouns. As shown in Figure 2 , after retrieving the referential entity (\"she\" refers to \"Jessica\"), the model needs to obtain this information for the current question Q i . In PLMs like BERT (Devlin et al., 2019) , the CMRC typically defines the model's input as the concatenation of three segments. Specifically, given a context C, the input for BERT is \"[CLS]H i [SEP]Qi[SEP]C.\" To ensure that new information is introduced with as little impact as possible for the PLM input, we propose two textual-level methods:",
"cite_spans": [
{
"start": 33,
"end": 50,
"text": "Ding et al., 2019",
"ref_id": "BIBREF6"
},
{
"start": 424,
"end": 445,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [
{
"start": 252,
"end": 260,
"text": "Figure 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Method No.1: Evidence-Enhanced",
"sec_num": "3.2"
},
{
"text": "\u2022 Evidence Generator (EG): Generating inferential sentences to solve coreference on the basis of textual rules (like \"She\" is \"Jessica\") and then adding the inferential sentence as evidence before the question. , we propose using the graph neural network to extract a coreference graph's features. We fuse these graph features with sequence features from the PLM to enhance the PLM's coreference reasoning ability.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Method No.1: Evidence-Enhanced",
"sec_num": "3.2"
},
{
"text": "We want the model to learn both the graph and sequence features of an entity during computation. Additionally, we hope that the model can balance the two kinds of features by using learnable weights. Therefore, the final embedding F inalEmb k of all entities k in a coreference graph is calculated as follows ([A : B] means to concatenate the two vectors A and B in a row, and \u2299 means the Hadamard product).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Embeding Fusing",
"sec_num": "3.3.1"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "w k = ReLU (W \u00d7 [P LM k : GN N k ])",
"eq_num": "(3)"
}
],
"section": "Embeding Fusing",
"sec_num": "3.3.1"
},
{
"text": "F inalEmb k = w k \u2299 P LM k + (1 \u2212 w k ) \u2299 GN N k (4)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Embeding Fusing",
"sec_num": "3.3.1"
},
{
"text": "The computed final embedding is passed through the fully connection layer to compute the answer prediction for the current question.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Embeding Fusing",
"sec_num": "3.3.1"
},
{
"text": "CoQA (Reddy et al., 2019) consists of 127K questions and answers from documents in 5 domains (Children, Literature, Middle& High School English Exams, CNN News, Wikipedia). The question-answering can be divided into extractive and non-extractive types (Niu et al., 2020) . Similar to SQuAD, the extractive type selects a span from the context for the final answer to the question. The non-extractive type is defined as choices from Yes/No/Unknown for answering. We used two datasets to perform this experiment:",
"cite_spans": [
{
"start": 5,
"end": 25,
"text": "(Reddy et al., 2019)",
"ref_id": "BIBREF30"
},
{
"start": 252,
"end": 270,
"text": "(Niu et al., 2020)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Datasets Description",
"sec_num": "4.1"
},
{
"text": "\u2022 CoQA all: The complete CoQA dataset.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Datasets Description",
"sec_num": "4.1"
},
{
"text": "\u2022 CoQA pronoun-containing (38% of CoQA all): Used to evaluate the model's performance in coreference resolution for anaphora. Samples in which questions contained pronouns from CoQA were extracted to form a partial dataset.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Datasets Description",
"sec_num": "4.1"
},
{
"text": "Compared with the evidence-enhanced method, the fusion model does not need the input of the model to be changed for learning. Therefore, we additionally used the CoQA-all dataset to evaluate the overall performance of the model. All evaluations were conducted using the overall F1 score by using CoQA's official evaluation script 1 . ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Datasets Description",
"sec_num": "4.1"
},
{
"text": "We applied the coreference resolution model from AllenNLP 2 . This model adopts Lee et al. (Lee et al., 2017) 's approach to extracting the coreferences in clusters. Rather than using GloVe's word embedding in the initial model, SpanBERT (Joshi et al., 2020) for word embedding was used due to its superiority on the task of extraction.",
"cite_spans": [
{
"start": 91,
"end": 109,
"text": "(Lee et al., 2017)",
"ref_id": "BIBREF15"
},
{
"start": 238,
"end": 258,
"text": "(Joshi et al., 2020)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "SpanBERT-based Coreference Extraction",
"sec_num": "4.2"
},
{
"text": "Due to the multi-turn characteristic that CMRC retains compared with MRC tasks, the conversation history before Q i should be considered as input into the model. In this experiment, a BERT-baseuncased (Devlin et al., 2019) fine-tuned by using all CoQA was used as our baseline model. It takes a concatenation of three segments as input (length of conversation history is 2). Specifically, given a context C, the input for BERT is [CLS] ",
"cite_spans": [
{
"start": 201,
"end": 222,
"text": "(Devlin et al., 2019)",
"ref_id": "BIBREF4"
},
{
"start": 430,
"end": 435,
"text": "[CLS]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "BERT",
"sec_num": "4.3.1"
},
{
"text": "(Q i\u22122 , A i\u22122 ), (Q i\u22121 , A i\u22121 )[SEP]Qi[SEP]C, in which \"[CLS]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "BERT",
"sec_num": "4.3.1"
},
{
"text": "\" is a classifier for \"Yes/No/Unknown/Span\" for CoQA's nonextractive questions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "BERT",
"sec_num": "4.3.1"
},
{
"text": "On the basis of BERT model's architecture, RoBERTa (Liu et al., 2019b) removes next sentence prediction and possesses better robustness 2 https://demo.allennlp.org/coreference-resolution through modifications and pre-training with larger data. RoBERTa can exceed almost all performances compared with the BERT model. In the experiment, we adopted a RoBERTa-base-uncased with the same training configuration as BERT. We found that RoBERTa achieves remarkable scores on the CoQA pronoun-containing dataset, which means that the capability RoBERTa holds towards coreference resolution is comparably higher than BERT accordingly.",
"cite_spans": [
{
"start": 51,
"end": 70,
"text": "(Liu et al., 2019b)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "RoBERTa",
"sec_num": "4.3.2"
},
{
"text": "The graph attention network (GAT) (Velickovic et al., 2017) learns the structural features of graphs from the spatial domain through a multi-headed attention mechanism. In this experiment, we used PyTorch Geometric 3 as the implementation of GAT graph embedding, and the number of multi-heads was set to 8.",
"cite_spans": [
{
"start": 34,
"end": 59,
"text": "(Velickovic et al., 2017)",
"ref_id": "BIBREF36"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Graph Attention Networks",
"sec_num": "4.4.1"
},
{
"text": "The graph convolutional network (GCN) (Kipf and Welling, 2017) learns the structural features of graphs from convolution layers. It can be used to study the properties of a graph from the eigenvalues and eigenvectors of a Laplacian matrix. GCN has been successful in processing graph data by extracting structure-aware features. In this experiment, we Table 1 : Comparison of baseline method with QR model, evidence-enhanced method and fusion model for CoQA. \"EG\" and \"EQ\" denote evidence generator and enhanced question, respectively. For coreference graph in antecedent retrieval, \"Hist.\" denotes using conversation history part, \"Cont.\" denotes using article content part, \"Hist.&Cont.\" denotes using both. \"GCN\" and \"GAT\" denote fusion model using graph embedding algorithms of GCN and GAT, respectively.",
"cite_spans": [],
"ref_spans": [
{
"start": 352,
"end": 359,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Graph Convolutional Network",
"sec_num": "4.4.2"
},
{
"text": "used PyTorch Geometric as the implementation of GCN graph embedding.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Graph Convolutional Network",
"sec_num": "4.4.2"
},
{
"text": "For all nodes contained in the coreference graph, we initialize the node features using embeddings at the token level E i generated through PLM. Here, we compute the average value for each node feature F i for initialization. e.g.. the node \"the girl\" is composed of two tokens, \"the\" and \"girl,\" and node feature F the:girl for initialization can be calculated as follows.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Initialization",
"sec_num": "4.4.3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "F the:girl = 1 2 (E the + E girl )",
"eq_num": "(5)"
}
],
"section": "Initialization",
"sec_num": "4.4.3"
},
{
"text": "All experiments were implemented on PyTorch 4 . BERT and RoBERTa were implemented by using the Huggingface Transformers library 5 . The approach by Lee et al. (Lee et al., 2017) was implemented through the pre-trained model \"corefspanbert-large\" from AllenNLP. We used three 11-GB GPUs (GTX 1080Ti), a batch size of 24 for BERT, and a batch size of 10 for RoBERTa in all experiments.",
"cite_spans": [
{
"start": 148,
"end": 177,
"text": "Lee et al. (Lee et al., 2017)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Details",
"sec_num": "4.5"
},
{
"text": "BERT and RoBERTa were utilized as our baseline, represent the basic and advanced PLMs respectively. To compare our approaches with others, we applied Question Rewriting (QR) model (Lin et al., 2020) using T5 (Raffel et al., 2020) , trained on CANARD (Elgohary et al., 2019) . To identify the effectiveness of coreference graph, we proposed to use information from different parts of coreference graph as comparisons.",
"cite_spans": [
{
"start": 180,
"end": 198,
"text": "(Lin et al., 2020)",
"ref_id": "BIBREF16"
},
{
"start": 208,
"end": 229,
"text": "(Raffel et al., 2020)",
"ref_id": "BIBREF28"
},
{
"start": 250,
"end": 273,
"text": "(Elgohary et al., 2019)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Details",
"sec_num": "4.5"
},
{
"text": "The results are shown in Table 1 , which presents a performance comparison of the baseline approaches, end-to-end QR, and our proposed methods integrated with different parts of the coreference graph. We can see that compared with the baselines, both the evidence-enhanced method and fusion model method improved the model's performance in different categories (Child., Liter., M&H., News, Wiki, and Overall) .",
"cite_spans": [
{
"start": 361,
"end": 408,
"text": "(Child., Liter., M&H., News, Wiki, and Overall)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 25,
"end": 32,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results & Analysis",
"sec_num": "5"
},
{
"text": "Specifically, the combination of the EG with the coreference graph (Hist.& Cont.) improved the overall F1 score by 2.6 on the BERT baseline and BERT-base Baseline Our EG F1>0 F1 \u22650.5 F1=1 False False 342 503 997 True False 145 175 180 False True 219 263 244 True True 2356 2121 1641 Total: 3062 Table 2 : Analysis of results for all answers for CoQA pronoun-containing test dataset (3062 samples in total). Comparison of baseline BERT with our best EG method \"BERT+ EG + Hist.&Cont.\" \"True\" and \"False\" indicate whether each answer produced by QA model was correct or incorrect, respectively, in accordance with F1 thresholds provided in right-side columns. by 0.1 on the RoBERTa baseline. Therefore, we concluded that while dealing with anaphora's coreference resolution, both the EG and EQ were effective as enhanced components of the PLM baseline model with BERT.",
"cite_spans": [],
"ref_spans": [
{
"start": 183,
"end": 325,
"text": "F1=1 False False 342 503 997 True False 145 175 180 False True 219 263 244 True True 2356 2121 1641 Total: 3062 Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results & Analysis",
"sec_num": "5"
},
{
"text": "Comparing EG and EQ approaches comprehensively for BERT and RoBERTa, the EG one had generally higher scores. One possible reason is that generating additional evidence behind a question as input maintains the integrity of the original question. Although the EQ approach also achieved relevant performance, the textual substitution of pronouns may alter the intention of the question and mislead the model to make erroneous answer predictions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results & Analysis",
"sec_num": "5"
},
{
"text": "To measure the effectiveness of the evidenceenhanced approach for each question, we compared the F1 scores of the answers produced by the baseline (BERT) and our evidence-enhanced model with the best performance (\"EG+hist.&cont.,\" as shown in Table 2 ). \"True\" and \"False\" indicate whether the answer predicted by the model was correct or incorrect, in accordance with the F1 thresholds provided in the right-side columns. As shown in Table 2 , the second row reflects the case where our model got an erroneous answer when the baseline's answer was correct, which can be interpreted as getting an erroneous referential entity of the target pronoun, thus leading to an erroneous prediction. The third row indicates that the answer of our model was correct and that of the baseline's was wrong. Compared with the second row, the third row shows the effectiveness of our model: introducing the correct referential entity and enhancing the model to output the correct answer. Additionally, in the third row, with the rise of the F1 thresh-old, the number increased from F1 > 0 to F1 \u2265 0.5, which means that our model slightly corrected the baseline's answer from completely wrong into closer to correct. However, from the decline from F1 \u2265 0.5 to F1 = 1, we can infer that our model still has limitations in making fully correct answer predictions.",
"cite_spans": [],
"ref_spans": [
{
"start": 243,
"end": 250,
"text": "Table 2",
"ref_id": null
},
{
"start": 435,
"end": 442,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results & Analysis",
"sec_num": "5"
},
{
"text": "From the results for the fusion model, we found that the fusion model achieved a further improvement (by up to 0.7 on RoBERTa) compared with the baseline and evidence-enhanced methods. This model also showed improvement on the CoQA-all dataset, which contains samples that are not needed for coreference resolution (without pronouns in questions), compared with the baseline. This indicates that the fusion model can effectively use coreference graph information. It can solve coreference resolution and maintain the ability to solve no-coreference questions. Therefore, compared with the evidence-enhanced approach, the fusion model has higher robustness.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results & Analysis",
"sec_num": "5"
},
{
"text": "Through comparing the two different graph embedding methods, GAT and GCN, we found that GCN generally outperformed GAT in terms of score in each category. We assume one reason is that the processed graphs always hold the same structure (a vertex containing multiple one-hop neighbor nodes), and such a simple structure is not adequately learned by GAT's multi-head attention, which is suitable for capturing features from the spatial domain. In contrast, GCN captures the graph features of each neighbor by using convolution layers, so it performed better in this experiment.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Results & Analysis",
"sec_num": "5"
},
{
"text": "We investigated how our approaches improve the coreference reasoning ability of the RoBERTa baseline approach. To compare the differences in answer prediction, we used RoBERTa-base as the baseline. RoBERTa-base + Hist.&Cont. + EG had the best performance in Table 1 as the evidence generator (EG), and RoBERTa-base + Fu-sionMd.(+GCN) had the best performance as the fusion model. We selected several specific cases from CoQA for elaboration.",
"cite_spans": [],
"ref_spans": [
{
"start": 258,
"end": 265,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Case Study",
"sec_num": "6"
},
{
"text": "An example is shown in Figure 4 . In this example, the coreference graph resolves that \"he\" refers to \"Joseph Aloisius Ratzinger.\" Because of the absence of coreference resolution, the baseline incorrectly predicted the answer at the wrong place. EG resolved the referential dependencies, so the prediction's meaning was close to the correct answer. However, the fusion model could integrate the coreference information and predict the answer span accurately.",
"cite_spans": [],
"ref_spans": [
{
"start": 23,
"end": 31,
"text": "Figure 4",
"ref_id": "FIGREF5"
}
],
"eq_spans": [],
"section": "Case Study",
"sec_num": "6"
},
{
"text": "In this paper, we proposed the coreference graph, which can integrate coreferences from text into a graph structure. To use the information retrieved from a coreference graph, we introduced the evidence-enhanced method, which comprises two textual-level coreference resolution approaches to leverage BERT's performance on CMRC. However, the results showed that the improvement for RoBERTa is still limited. Therefore, we proposed the fusion model, using graph neural networks to incorporate the coreference graph into PLM structure. In comparison with the baseline and evidenceenhanced methods, the fusion model showed further improvement on RoBERTa, maintaining relatively higher robustness when learning coreference resolution. We confirmed that in conversational reading comprehension, a graph-structured representation of the article context and conversational history can both be an information supplement for answering a current question, especially with different PLMs. Rather than the end-to-end method in PLMs, our approaches can generate readable text as evidence when answering a question, which strengthens the interpretability of PLMs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "7"
},
{
"text": "https://stanfordnlp.github.io/coqa/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "https://pytorch-geometric.readthedocs.io/en/latest/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "https://pytorch.org/ 5 https://huggingface.co/docs/transformers/index",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Graph convolutional encoders for syntax-aware neural machine translation",
"authors": [
{
"first": "Jasmijn",
"middle": [],
"last": "Bastings",
"suffix": ""
},
{
"first": "Ivan",
"middle": [],
"last": "Titov",
"suffix": ""
},
{
"first": "Wilker",
"middle": [],
"last": "Aziz",
"suffix": ""
},
{
"first": "Diego",
"middle": [],
"last": "Marcheggiani",
"suffix": ""
},
{
"first": "Khalil",
"middle": [],
"last": "Sima",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1957--1967",
"other_ids": {
"DOI": [
"10.18653/v1/d17-1209"
]
},
"num": null,
"urls": [],
"raw_text": "Jasmijn Bastings, Ivan Titov, Wilker Aziz, Diego Marcheggiani, and Khalil Sima'an. 2017. Graph con- volutional encoders for syntax-aware neural machine translation. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Process- ing, EMNLP 2017, Copenhagen, Denmark, Septem- ber 9-11, 2017, pages 1957-1967. Association for Computational Linguistics.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Reading Wikipedia to answer opendomain questions",
"authors": [
{
"first": "Danqi",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Adam",
"middle": [],
"last": "Fisch",
"suffix": ""
},
{
"first": "Jason",
"middle": [],
"last": "Weston",
"suffix": ""
},
{
"first": "Antoine",
"middle": [],
"last": "Bordes",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 55th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1870--1879",
"other_ids": {
"DOI": [
"10.18653/v1/P17-1171"
]
},
"num": null,
"urls": [],
"raw_text": "Danqi Chen, Adam Fisch, Jason Weston, and Antoine Bordes. 2017. Reading Wikipedia to answer open- domain questions. In Proceedings of the 55th Annual Meeting of the Association for Computational Lin- guistics (Volume 1: Long Papers), pages 1870-1879, Vancouver, Canada. Association for Computational Linguistics.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Open-domain question answering",
"authors": [
{
"first": "Danqi",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Wen-Tau",
"middle": [],
"last": "Yih",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics: Tutorial Abstracts",
"volume": "",
"issue": "",
"pages": "34--37",
"other_ids": {
"DOI": [
"10.18653/v1/2020.acl-tutorials.8"
]
},
"num": null,
"urls": [],
"raw_text": "Danqi Chen and Wen-tau Yih. 2020. Open-domain question answering. In Proceedings of the 58th An- nual Meeting of the Association for Computational Linguistics: Tutorial Abstracts, pages 34-37, Online. Association for Computational Linguistics.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "QuAC: Question answering in context",
"authors": [
{
"first": "Eunsol",
"middle": [],
"last": "Choi",
"suffix": ""
},
{
"first": "He",
"middle": [],
"last": "He",
"suffix": ""
},
{
"first": "Mohit",
"middle": [],
"last": "Iyyer",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Yatskar",
"suffix": ""
},
{
"first": "Wentau",
"middle": [],
"last": "Yih",
"suffix": ""
},
{
"first": "Yejin",
"middle": [],
"last": "Choi",
"suffix": ""
},
{
"first": "Percy",
"middle": [],
"last": "Liang",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "2174--2184",
"other_ids": {
"DOI": [
"10.18653/v1/D18-1241"
]
},
"num": null,
"urls": [],
"raw_text": "Eunsol Choi, He He, Mohit Iyyer, Mark Yatskar, Wen- tau Yih, Yejin Choi, Percy Liang, and Luke Zettle- moyer. 2018. QuAC: Question answering in context. In Proceedings of the 2018 Conference on Empiri- cal Methods in Natural Language Processing, pages 2174-2184, Brussels, Belgium. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"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 Tech- nologies, Volume 1 (Long and Short Papers), pages 4171-4186, Minneapolis, Minnesota. Association for Computational Linguistics.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Neural models for reasoning over multiple mentions using coreference",
"authors": [
{
"first": "Bhuwan",
"middle": [],
"last": "Dhingra",
"suffix": ""
},
{
"first": "Qiao",
"middle": [],
"last": "Jin",
"suffix": ""
},
{
"first": "Zhilin",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "William",
"middle": [
"W"
],
"last": "Cohen",
"suffix": ""
},
{
"first": "Ruslan",
"middle": [],
"last": "Salakhutdinov",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT",
"volume": "2",
"issue": "",
"pages": "42--48",
"other_ids": {
"DOI": [
"10.18653/v1/n18-2007"
]
},
"num": null,
"urls": [],
"raw_text": "Bhuwan Dhingra, Qiao Jin, Zhilin Yang, William W. Cohen, and Ruslan Salakhutdinov. 2018. Neural models for reasoning over multiple mentions using coreference. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, NAACL-HLT, New Orleans, Louisiana, USA, June 1-6, 2018, Volume 2 (Short Papers), pages 42-48. Association for Computational Linguistics.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Cognitive graph for multi-hop reading comprehension at scale",
"authors": [
{
"first": "Ming",
"middle": [],
"last": "Ding",
"suffix": ""
},
{
"first": "Chang",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Qibin",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Hongxia",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Jie",
"middle": [],
"last": "Tang",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "2694--2703",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1259"
]
},
"num": null,
"urls": [],
"raw_text": "Ming Ding, Chang Zhou, Qibin Chen, Hongxia Yang, and Jie Tang. 2019. Cognitive graph for multi-hop reading comprehension at scale. In Proceedings of the 57th Annual Meeting of the Association for Com- putational Linguistics, pages 2694-2703, Florence, Italy. Association for Computational Linguistics.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Can you unpack that? learning to rewrite questions-in-context",
"authors": [
{
"first": "Ahmed",
"middle": [],
"last": "Elgohary",
"suffix": ""
},
{
"first": "Denis",
"middle": [],
"last": "Peskov",
"suffix": ""
},
{
"first": "Jordan",
"middle": [
"L"
],
"last": "Boyd-Graber",
"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",
"volume": "",
"issue": "",
"pages": "5917--5923",
"other_ids": {
"DOI": [
"10.18653/v1/D19-1605"
]
},
"num": null,
"urls": [],
"raw_text": "Ahmed Elgohary, Denis Peskov, and Jordan L. Boyd- Graber. 2019. Can you unpack that? learning to rewrite questions-in-context. In Proceedings of the 2019 Conference on Empirical Methods in Natu- ral Language Processing and the 9th International Joint Conference on Natural Language Processing, EMNLP-IJCNLP 2019, Hong Kong, China, Novem- ber 3-7, 2019, pages 5917-5923. Association for Computational Linguistics.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "AllenNLP: A deep semantic natural language processing platform",
"authors": [
{
"first": "Matt",
"middle": [],
"last": "Gardner",
"suffix": ""
},
{
"first": "Joel",
"middle": [],
"last": "Grus",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Neumann",
"suffix": ""
},
{
"first": "Oyvind",
"middle": [],
"last": "Tafjord",
"suffix": ""
},
{
"first": "Pradeep",
"middle": [],
"last": "Dasigi",
"suffix": ""
},
{
"first": "Nelson",
"middle": [
"F"
],
"last": "Liu",
"suffix": ""
},
{
"first": "Matthew",
"middle": [],
"last": "Peters",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Schmitz",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of Workshop for NLP Open Source Software (NLP-OSS)",
"volume": "",
"issue": "",
"pages": "1--6",
"other_ids": {
"DOI": [
"10.18653/v1/W18-2501"
]
},
"num": null,
"urls": [],
"raw_text": "Matt Gardner, Joel Grus, Mark Neumann, Oyvind Tafjord, Pradeep Dasigi, Nelson F. Liu, Matthew Pe- ters, Michael Schmitz, and Luke Zettlemoyer. 2018. AllenNLP: A deep semantic natural language pro- cessing platform. In Proceedings of Workshop for NLP Open Source Software (NLP-OSS), pages 1-6, Melbourne, Australia. Association for Computational Linguistics.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Flowqa: Grasping flow in history for conversational machine comprehension",
"authors": [
{
"first": "",
"middle": [],
"last": "Hsin-Yuan",
"suffix": ""
},
{
"first": "Eunsol",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Wen-Tau",
"middle": [],
"last": "Choi",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Yih",
"suffix": ""
}
],
"year": 2019,
"venue": "7th International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hsin-Yuan Huang, Eunsol Choi, and Wen-tau Yih. 2019. Flowqa: Grasping flow in history for conversational machine comprehension. In 7th International Confer- ence on Learning Representations, ICLR 2019, New Orleans, LA, USA, May 6-9, 2019. OpenReview.net.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Convbert: Improving bert with span-based dynamic convolution",
"authors": [
{
"first": "Zihang",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Weihao",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "Daquan",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Yunpeng",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Jiashi",
"middle": [],
"last": "Feng",
"suffix": ""
},
{
"first": "Shuicheng",
"middle": [],
"last": "Yan",
"suffix": ""
}
],
"year": 2020,
"venue": "Advances in Neural Information Processing Systems 33: Annual Conference on Neural Information Processing Systems 2020",
"volume": "2020",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zihang Jiang, Weihao Yu, Daquan Zhou, Yunpeng Chen, Jiashi Feng, and Shuicheng Yan. 2020. Convbert: Im- proving bert with span-based dynamic convolution. In Advances in Neural Information Processing Sys- tems 33: Annual Conference on Neural Information Processing Systems 2020, NeurIPS 2020, December 6-12, 2020, virtual.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Span-BERT: Improving pre-training by representing and predicting spans",
"authors": [
{
"first": "Mandar",
"middle": [],
"last": "Joshi",
"suffix": ""
},
{
"first": "Danqi",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Yinhan",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Daniel",
"middle": [
"S"
],
"last": "Weld",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
},
{
"first": "Omer",
"middle": [],
"last": "Levy",
"suffix": ""
}
],
"year": 2020,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "8",
"issue": "",
"pages": "64--77",
"other_ids": {
"DOI": [
"10.1162/tacl_a_00300"
]
},
"num": null,
"urls": [],
"raw_text": "Mandar Joshi, Danqi Chen, Yinhan Liu, Daniel S. Weld, Luke Zettlemoyer, and Omer Levy. 2020. Span- BERT: Improving pre-training by representing and predicting spans. Transactions of the Association for Computational Linguistics, 8:64-77.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "BERT for coreference resolution: Baselines and analysis",
"authors": [
{
"first": "Mandar",
"middle": [],
"last": "Joshi",
"suffix": ""
},
{
"first": "Omer",
"middle": [],
"last": "Levy",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
},
{
"first": "Daniel",
"middle": [
"S"
],
"last": "Weld",
"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",
"volume": "",
"issue": "",
"pages": "5802--5807",
"other_ids": {
"DOI": [
"10.18653/v1/D19-1588"
]
},
"num": null,
"urls": [],
"raw_text": "Mandar Joshi, Omer Levy, Luke Zettlemoyer, and Daniel S. Weld. 2019. BERT for coreference res- olution: Baselines and analysis. In Proceedings of the 2019 Conference on Empirical Methods in Natu- ral Language Processing and the 9th International Joint Conference on Natural Language Processing, EMNLP-IJCNLP 2019, Hong Kong, China, Novem- ber 3-7, 2019, pages 5802-5807. Association for Computational Linguistics.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Semisupervised classification with graph convolutional networks",
"authors": [
{
"first": "N",
"middle": [],
"last": "Thomas",
"suffix": ""
},
{
"first": "Max",
"middle": [],
"last": "Kipf",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Welling",
"suffix": ""
}
],
"year": 2017,
"venue": "5th International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thomas N. Kipf and Max Welling. 2017. Semi- supervised classification with graph convolutional networks. In 5th International Conference on Learn- ing Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Conference Track Proceedings. OpenReview.net.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Coreference resolution without span representations",
"authors": [
{
"first": "Yuval",
"middle": [],
"last": "Kirstain",
"suffix": ""
},
{
"first": "Ori",
"middle": [],
"last": "Ram",
"suffix": ""
},
{
"first": "Omer",
"middle": [],
"last": "Levy",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 59th Annual Meeting of the Association for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL/IJCNLP 2021",
"volume": "2",
"issue": "",
"pages": "14--19",
"other_ids": {
"DOI": [
"10.18653/v1/2021.acl-short.3"
]
},
"num": null,
"urls": [],
"raw_text": "Yuval Kirstain, Ori Ram, and Omer Levy. 2021. Coref- erence resolution without span representations. In Proceedings of the 59th Annual Meeting of the Asso- ciation for Computational Linguistics and the 11th International Joint Conference on Natural Language Processing, ACL/IJCNLP 2021, (Volume 2: Short Pa- pers), Virtual Event, August 1-6, 2021, pages 14-19. Association for Computational Linguistics.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "End-to-end neural coreference resolution",
"authors": [
{
"first": "Kenton",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Luheng",
"middle": [],
"last": "He",
"suffix": ""
},
{
"first": "Mike",
"middle": [],
"last": "Lewis",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "188--197",
"other_ids": {
"DOI": [
"10.18653/v1/d17-1018"
]
},
"num": null,
"urls": [],
"raw_text": "Kenton Lee, Luheng He, Mike Lewis, and Luke Zettle- moyer. 2017. End-to-end neural coreference reso- lution. In Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing, EMNLP 2017, Copenhagen, Denmark, September 9-11, 2017, pages 188-197. Association for Compu- tational Linguistics.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Conversational question reformulation via sequence-to-sequence architectures and pretrained language models",
"authors": [
{
"first": "Jheng-Hong",
"middle": [],
"last": "Sheng-Chieh Lin",
"suffix": ""
},
{
"first": "Rodrigo",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Ming-Feng",
"middle": [],
"last": "Nogueira",
"suffix": ""
},
{
"first": "Chuan-Ju",
"middle": [],
"last": "Tsai",
"suffix": ""
},
{
"first": "Jimmy",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 2020,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sheng-Chieh Lin, Jheng-Hong Yang, Rodrigo Nogueira, Ming-Feng Tsai, Chuan-Ju Wang, and Jimmy Lin. 2020. Conversational question reformulation via sequence-to-sequence architectures and pretrained language models. CoRR, abs/2004.01909.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Denoising distantly supervised open-domain question answering",
"authors": [
{
"first": "Yankai",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Haozhe",
"middle": [],
"last": "Ji",
"suffix": ""
},
{
"first": "Zhiyuan",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Maosong",
"middle": [],
"last": "Sun",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1736--1745",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yankai Lin, Haozhe Ji, Zhiyuan Liu, and Maosong Sun. 2018. Denoising distantly supervised open-domain question answering. In Proceedings of the 56th An- nual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 1736- 1745.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Neural machine reading comprehension: Methods and trends. Applied Sciences",
"authors": [
{
"first": "Shanshan",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Xin",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Sheng",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Hui",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Weiming",
"middle": [],
"last": "Zhang",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "9",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shanshan Liu, Xin Zhang, Sheng Zhang, Hui Wang, and Weiming Zhang. 2019a. Neural machine read- ing comprehension: Methods and trends. Applied Sciences, 9(18):3698.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Ambigqa: Answering ambiguous open-domain questions",
"authors": [
{
"first": "Sewon",
"middle": [],
"last": "Min",
"suffix": ""
},
{
"first": "Julian",
"middle": [],
"last": "Michael",
"suffix": ""
},
{
"first": "Hannaneh",
"middle": [],
"last": "Hajishirzi",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing",
"volume": "2020",
"issue": "",
"pages": "5783--5797",
"other_ids": {
"DOI": [
"10.18653/v1/2020.emnlp-main.466"
]
},
"num": null,
"urls": [],
"raw_text": "Sewon Min, Julian Michael, Hannaneh Hajishirzi, and Luke Zettlemoyer. 2020. Ambigqa: Answering am- biguous open-domain questions. In Proceedings of the 2020 Conference on Empirical Methods in Nat- ural Language Processing, EMNLP 2020, Online, November 16-20, 2020, pages 5783-5797. Associa- tion for Computational Linguistics.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Jingfang Xu, and Minlie Huang. 2020. A self-training method for machine reading comprehension with soft evidence extraction",
"authors": [
{
"first": "Yilin",
"middle": [],
"last": "Niu",
"suffix": ""
},
{
"first": "Fangkai",
"middle": [],
"last": "Jiao",
"suffix": ""
},
{
"first": "Mantong",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Ting",
"middle": [],
"last": "Yao",
"suffix": ""
}
],
"year": null,
"venue": "Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "3916--3927",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yilin Niu, Fangkai Jiao, Mantong Zhou, Ting Yao, Jing- fang Xu, and Minlie Huang. 2020. A self-training method for machine reading comprehension with soft evidence extraction. In Proceedings of the 58th An- nual Meeting of the Association for Computational Linguistics, pages 3916-3927. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Query rewriting for semistructured data",
"authors": [
{
"first": "Yannis",
"middle": [],
"last": "Papakonstantinou",
"suffix": ""
},
{
"first": "Vasilis",
"middle": [],
"last": "Vassalos",
"suffix": ""
}
],
"year": 1999,
"venue": "ACM SIG-MOD Record",
"volume": "28",
"issue": "2",
"pages": "455--466",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yannis Papakonstantinou and Vasilis Vassalos. 1999. Query rewriting for semistructured data. ACM SIG- MOD Record, 28(2):455-466.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "CoNLL-2012 shared task: Modeling multilingual unrestricted coreference in OntoNotes",
"authors": [
{
"first": "Alessandro",
"middle": [],
"last": "Sameer Pradhan",
"suffix": ""
},
{
"first": "Nianwen",
"middle": [],
"last": "Moschitti",
"suffix": ""
},
{
"first": "Olga",
"middle": [],
"last": "Xue",
"suffix": ""
},
{
"first": "Yuchen",
"middle": [],
"last": "Uryupina",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Zhang",
"suffix": ""
}
],
"year": 2012,
"venue": "Joint Conference on EMNLP and CoNLL -Shared Task",
"volume": "",
"issue": "",
"pages": "1--40",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sameer Pradhan, Alessandro Moschitti, Nianwen Xue, Olga Uryupina, and Yuchen Zhang. 2012. CoNLL- 2012 shared task: Modeling multilingual unrestricted coreference in OntoNotes. In Joint Conference on EMNLP and CoNLL -Shared Task, pages 1-40, Jeju Island, Korea. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Machine reading comprehension using structural knowledge graph-aware network",
"authors": [
{
"first": "Delai",
"middle": [],
"last": "Qiu",
"suffix": ""
},
{
"first": "Yuanzhe",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Xinwei",
"middle": [],
"last": "Feng",
"suffix": ""
},
{
"first": "Xiangwen",
"middle": [],
"last": "Liao",
"suffix": ""
},
{
"first": "Wenbin",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Yajuan",
"middle": [],
"last": "Lyu",
"suffix": ""
},
{
"first": "Kang",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)",
"volume": "",
"issue": "",
"pages": "5896--5901",
"other_ids": {
"DOI": [
"10.18653/v1/D19-1602"
]
},
"num": null,
"urls": [],
"raw_text": "Delai Qiu, Yuanzhe Zhang, Xinwei Feng, Xiangwen Liao, Wenbin Jiang, Yajuan Lyu, Kang Liu, and Jun Zhao. 2019. Machine reading comprehension us- ing structural knowledge graph-aware network. In Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Lan- guage Processing (EMNLP-IJCNLP), pages 5896- 5901, Hong Kong, China. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Pre-trained models for natural language processing: A survey",
"authors": [
{
"first": "Xipeng",
"middle": [],
"last": "Qiu",
"suffix": ""
},
{
"first": "Tianxiang",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Yige",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Yunfan",
"middle": [],
"last": "Shao",
"suffix": ""
},
{
"first": "Ning",
"middle": [],
"last": "Dai",
"suffix": ""
},
{
"first": "Xuanjing",
"middle": [],
"last": "Huang",
"suffix": ""
}
],
"year": 2020,
"venue": "Science China Technological Sciences",
"volume": "63",
"issue": "10",
"pages": "1872--1897",
"other_ids": {
"DOI": [
"10.1007/s11431-020-1647-3"
]
},
"num": null,
"urls": [],
"raw_text": "XiPeng Qiu, TianXiang Sun, YiGe Xu, YunFan Shao, Ning Dai, and XuanJing Huang. 2020. Pre-trained models for natural language processing: A survey. Science China Technological Sciences, 63(10):1872- 1897.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Bert with history answer embedding for conversational question answering",
"authors": [
{
"first": "Chen",
"middle": [],
"last": "Qu",
"suffix": ""
},
{
"first": "Liu",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Minghui",
"middle": [],
"last": "Qiu",
"suffix": ""
},
{
"first": "Bruce",
"middle": [],
"last": "Croft",
"suffix": ""
},
{
"first": "Yongfeng",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Mohit",
"middle": [],
"last": "Iyyer",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 42nd international ACM SIGIR conference on research and development in information retrieval",
"volume": "",
"issue": "",
"pages": "1133--1136",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chen Qu, Liu Yang, Minghui Qiu, W Bruce Croft, Yongfeng Zhang, and Mohit Iyyer. 2019. Bert with history answer embedding for conversational ques- tion answering. In Proceedings of the 42nd inter- national ACM SIGIR conference on research and development in information retrieval, pages 1133- 1136.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Language models are unsupervised multitask learners",
"authors": [
{
"first": "Alec",
"middle": [],
"last": "Radford",
"suffix": ""
},
{
"first": "Jeffrey",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Rewon",
"middle": [],
"last": "Child",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Luan",
"suffix": ""
},
{
"first": "Dario",
"middle": [],
"last": "Amodei",
"suffix": ""
},
{
"first": "Ilya",
"middle": [],
"last": "Sutskever",
"suffix": ""
}
],
"year": 2019,
"venue": "OpenAI blog",
"volume": "1",
"issue": "8",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alec Radford, Jeffrey Wu, Rewon Child, David Luan, Dario Amodei, Ilya Sutskever, et al. 2019. Language models are unsupervised multitask learners. OpenAI blog, 1(8):9.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Exploring the limits of transfer learning with a unified text-to-text transformer",
"authors": [
{
"first": "Colin",
"middle": [],
"last": "Raffel",
"suffix": ""
},
{
"first": "Noam",
"middle": [],
"last": "Shazeer",
"suffix": ""
},
{
"first": "Adam",
"middle": [],
"last": "Roberts",
"suffix": ""
},
{
"first": "Katherine",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Sharan",
"middle": [],
"last": "Narang",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Matena",
"suffix": ""
},
{
"first": "Yanqi",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Wei",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Peter",
"middle": [
"J"
],
"last": "Liu",
"suffix": ""
}
],
"year": 2020,
"venue": "J. Mach. Learn. Res",
"volume": "21",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Colin Raffel, Noam Shazeer, Adam Roberts, Katherine Lee, Sharan Narang, Michael Matena, Yanqi Zhou, Wei Li, and Peter J. Liu. 2020. Exploring the limits of transfer learning with a unified text-to-text trans- former. J. Mach. Learn. Res., 21:140:1-140:67.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Know what you don't know: Unanswerable questions for SQuAD",
"authors": [
{
"first": "Pranav",
"middle": [],
"last": "Rajpurkar",
"suffix": ""
},
{
"first": "Robin",
"middle": [],
"last": "Jia",
"suffix": ""
},
{
"first": "Percy",
"middle": [],
"last": "Liang",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics",
"volume": "2",
"issue": "",
"pages": "784--789",
"other_ids": {
"DOI": [
"10.18653/v1/P18-2124"
]
},
"num": null,
"urls": [],
"raw_text": "Pranav Rajpurkar, Robin Jia, and Percy Liang. 2018. Know what you don't know: Unanswerable ques- tions for SQuAD. In Proceedings of the 56th Annual Meeting of the Association for Computational Lin- guistics (Volume 2: Short Papers), pages 784-789, Melbourne, Australia. Association for Computational Linguistics.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Coqa: A conversational question answering challenge",
"authors": [
{
"first": "Siva",
"middle": [],
"last": "Reddy",
"suffix": ""
},
{
"first": "Danqi",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
}
],
"year": 2019,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "7",
"issue": "",
"pages": "249--266",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Siva Reddy, Danqi Chen, and Christopher D. Manning. 2019. Coqa: A conversational question answering challenge. Transactions of the Association for Com- putational Linguistics, 7:249-266.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Long short-term memory recurrent neural network architectures for large scale acoustic modeling",
"authors": [
{
"first": "Hasim",
"middle": [],
"last": "Sak",
"suffix": ""
},
{
"first": "Andrew",
"middle": [
"W"
],
"last": "Senior",
"suffix": ""
},
{
"first": "Fran\u00e7oise",
"middle": [],
"last": "Beaufays",
"suffix": ""
}
],
"year": 2014,
"venue": "INTERSPEECH 2014, 15th Annual Conference of the International Speech Communication Association",
"volume": "",
"issue": "",
"pages": "338--342",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hasim Sak, Andrew W. Senior, and Fran\u00e7oise Beaufays. 2014. Long short-term memory recurrent neural net- work architectures for large scale acoustic modeling. In INTERSPEECH 2014, 15th Annual Conference of the International Speech Communication Association, Singapore, September 14-18, 2014, pages 338-342. ISCA.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Bidirectional attention flow for machine comprehension",
"authors": [
{
"first": "Min Joon",
"middle": [],
"last": "Seo",
"suffix": ""
},
{
"first": "Aniruddha",
"middle": [],
"last": "Kembhavi",
"suffix": ""
},
{
"first": "Ali",
"middle": [],
"last": "Farhadi",
"suffix": ""
},
{
"first": "Hannaneh",
"middle": [],
"last": "Hajishirzi",
"suffix": ""
}
],
"year": 2017,
"venue": "5th International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Min Joon Seo, Aniruddha Kembhavi, Ali Farhadi, and Hannaneh Hajishirzi. 2017. Bidirectional attention flow for machine comprehension. In 5th Inter- national Conference on Learning Representations, ICLR 2017, Toulon, France, April 24-26, 2017, Con- ference Track Proceedings. OpenReview.net.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Exploring graph-structured passage representation for multihop reading comprehension with graph neural networks",
"authors": [
{
"first": "Linfeng",
"middle": [],
"last": "Song",
"suffix": ""
},
{
"first": "Zhiguo",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Mo",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "Yue",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Radu",
"middle": [],
"last": "Florian",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Gildea",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Linfeng Song, Zhiguo Wang, Mo Yu, Yue Zhang, Radu Florian, and Daniel Gildea. 2018. Exploring graph-structured passage representation for multi- hop reading comprehension with graph neural net- works. CoRR, abs/1809.02040.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Question rewriting for conversational question answering",
"authors": [
{
"first": "Svitlana",
"middle": [],
"last": "Vakulenko",
"suffix": ""
},
{
"first": "Shayne",
"middle": [],
"last": "Longpre",
"suffix": ""
},
{
"first": "Zhucheng",
"middle": [],
"last": "Tu",
"suffix": ""
},
{
"first": "Raviteja",
"middle": [],
"last": "Anantha",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 14th ACM International Conference on Web Search and Data Mining",
"volume": "",
"issue": "",
"pages": "355--363",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Svitlana Vakulenko, Shayne Longpre, Zhucheng Tu, and Raviteja Anantha. 2021. Question rewriting for conversational question answering. In Proceedings of the 14th ACM International Conference on Web Search and Data Mining, pages 355-363.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "Attention is all you need",
"authors": [
{
"first": "Ashish",
"middle": [],
"last": "Vaswani",
"suffix": ""
},
{
"first": "Noam",
"middle": [],
"last": "Shazeer",
"suffix": ""
},
{
"first": "Niki",
"middle": [],
"last": "Parmar",
"suffix": ""
},
{
"first": "Jakob",
"middle": [],
"last": "Uszkoreit",
"suffix": ""
},
{
"first": "Llion",
"middle": [],
"last": "Jones",
"suffix": ""
},
{
"first": "Aidan",
"middle": [
"N"
],
"last": "Gomez",
"suffix": ""
},
{
"first": "\u0141ukasz",
"middle": [],
"last": "Kaiser",
"suffix": ""
},
{
"first": "Illia",
"middle": [],
"last": "Polosukhin",
"suffix": ""
}
],
"year": 2017,
"venue": "Advances in neural information processing systems",
"volume": "",
"issue": "",
"pages": "5998--6008",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, \u0141ukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In Advances in neural information pro- cessing systems, pages 5998-6008.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "Graph attention networks. stat",
"authors": [
{
"first": "Petar",
"middle": [],
"last": "Velickovic",
"suffix": ""
},
{
"first": "Guillem",
"middle": [],
"last": "Cucurull",
"suffix": ""
},
{
"first": "Arantxa",
"middle": [],
"last": "Casanova",
"suffix": ""
},
{
"first": "Adriana",
"middle": [],
"last": "Romero",
"suffix": ""
},
{
"first": "Pietro",
"middle": [],
"last": "Lio",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "1050",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Petar Velickovic, Guillem Cucurull, Arantxa Casanova, Adriana Romero, Pietro Lio, and Yoshua Bengio. 2017. Graph attention networks. stat, 1050:20.",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"title": "Reference and anaphoric relations",
"authors": [
{
"first": "Urs",
"middle": [],
"last": "Hk Von Heusinger",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Egli",
"suffix": ""
}
],
"year": 2012,
"venue": "",
"volume": "72",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "HK von Heusinger and Urs Egli. 2012. Reference and anaphoric relations, volume 72. Springer Science & Business Media.",
"links": null
},
"BIBREF38": {
"ref_id": "b38",
"title": "Revealing the myth of higher-order inference in coreference resolution",
"authors": [
{
"first": "Liyan",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Jinho",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Choi",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing",
"volume": "2020",
"issue": "",
"pages": "8527--8533",
"other_ids": {
"DOI": [
"10.18653/v1/2020.emnlp-main.686"
]
},
"num": null,
"urls": [],
"raw_text": "Liyan Xu and Jinho D. Choi. 2020. Revealing the myth of higher-order inference in coreference resolution. In Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, EMNLP 2020, Online, November 16-20, 2020, pages 8527- 8533. Association for Computational Linguistics.",
"links": null
},
"BIBREF39": {
"ref_id": "b39",
"title": "Xlnet: Generalized autoregressive pretraining for language understanding",
"authors": [
{
"first": "Zhilin",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Zihang",
"middle": [],
"last": "Dai",
"suffix": ""
},
{
"first": "Yiming",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Jaime",
"middle": [],
"last": "Carbonell",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Russ",
"suffix": ""
},
{
"first": "Quoc V",
"middle": [],
"last": "Salakhutdinov",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Le",
"suffix": ""
}
],
"year": 2019,
"venue": "Advances in neural information processing systems",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zhilin Yang, Zihang Dai, Yiming Yang, Jaime Car- bonell, Russ R Salakhutdinov, and Quoc V Le. 2019. Xlnet: Generalized autoregressive pretraining for lan- guage understanding. Advances in neural informa- tion processing systems, 32.",
"links": null
},
"BIBREF40": {
"ref_id": "b40",
"title": "Flowdelta: Modeling flow information gain in reasoning for conversational machine comprehension",
"authors": [
{
"first": "Yi-Ting",
"middle": [],
"last": "Yeh",
"suffix": ""
},
{
"first": "Yun-Nung",
"middle": [],
"last": "Chen",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2nd Workshop on Machine Reading for Question Answering, MRQA@EMNLP 2019",
"volume": "",
"issue": "",
"pages": "86--90",
"other_ids": {
"DOI": [
"10.18653/v1/D19-5812"
]
},
"num": null,
"urls": [],
"raw_text": "Yi-Ting Yeh and Yun-Nung Chen. 2019. Flowdelta: Modeling flow information gain in reasoning for con- versational machine comprehension. In Proceedings of the 2nd Workshop on Machine Reading for Ques- tion Answering, MRQA@EMNLP 2019, Hong Kong, China, November 4, 2019, pages 86-90. Association for Computational Linguistics.",
"links": null
},
"BIBREF42": {
"ref_id": "b42",
"title": "Qanet: Combining local convolution with global self-attention for reading comprehension",
"authors": [
{
"first": "Le",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 2018,
"venue": "6th International Conference on Learning Representations",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Le. 2018. Qanet: Combining local convolution with global self-attention for reading comprehension. In 6th International Conference on Learning Represen- tations, ICLR 2018, Vancouver, BC, Canada, April 30 -May 3, 2018, Conference Track Proceedings. OpenReview.net.",
"links": null
},
"BIBREF43": {
"ref_id": "b43",
"title": "GEAR: graph-based evidence aggregating and reasoning for fact verification",
"authors": [
{
"first": "Jie",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Xu",
"middle": [],
"last": "Han",
"suffix": ""
},
{
"first": "Cheng",
"middle": [],
"last": "Yang",
"suffix": ""
},
{
"first": "Zhiyuan",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Lifeng",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Changcheng",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Maosong",
"middle": [],
"last": "Sun",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Conference of the Association for Computational Linguistics, ACL 2019",
"volume": "1",
"issue": "",
"pages": "892--901",
"other_ids": {
"DOI": [
"10.18653/v1/p19-1085"
]
},
"num": null,
"urls": [],
"raw_text": "Jie Zhou, Xu Han, Cheng Yang, Zhiyuan Liu, Lifeng Wang, Changcheng Li, and Maosong Sun. 2019. GEAR: graph-based evidence aggregating and rea- soning for fact verification. In Proceedings of the 57th Conference of the Association for Computa- tional Linguistics, ACL 2019, Florence, Italy, July 28-August 2, 2019, Volume 1: Long Papers, pages 892-901. Association for Computational Linguistics.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Coreference resolution is required for end-toend PLM in CMRC task.",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF1": {
"text": "Overview of evidence-enhanced and fusion model. To answer current question, model should determine pronoun's referential entity through context or conversation history; graph-based coreference resolution can precisely determine dependency and add additional information to current question. Left part denotes textual level method of evidence-enhanced method. Right part denotes fusion model and fusion of PLM and graph embedding.",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF3": {
"text": "An example of converting conversation history and article context into the coreference graph. The same color represent entities has same referring entity, also in the same cluster as graph.",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF4": {
"text": "Ratzinger established himself as a highly regarded university theologian by the late 1950s and was appointed a full professor in 1958... Conversation History H i : ... Q i\u22121 : Did he have a lot of experience as a pastor? A i\u22121 : No. Current Question Q i : What was his occupation immediately preceding his papacy? Resolution in coreference graph: his = Joseph Aloisius Ratzinger Answer prediction: Fusion model: Theologian. Evidence-Enhanced: Academic and professor of theology. Baseline: A major figure on the Vatican stage. Gold answer: Theologian.",
"num": null,
"uris": null,
"type_str": "figure"
},
"FIGREF5": {
"text": "Answer predictions from different CMRC models.",
"num": null,
"uris": null,
"type_str": "figure"
}
}
}
} |