File size: 151,262 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 | {
"paper_id": "2021",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T13:14:00.829183Z"
},
"title": "Modality and Negation in Event Extraction",
"authors": [
{
"first": "Sander",
"middle": [],
"last": "Bijl De Vroe",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Edinburgh",
"location": {}
},
"email": ""
},
{
"first": "Liane",
"middle": [],
"last": "Guillou",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Edinburgh",
"location": {}
},
"email": "liane.guillou@ed.ac.uk"
},
{
"first": "Milo\u0161",
"middle": [],
"last": "Stanojevi\u0107",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Edinburgh",
"location": {}
},
"email": "m.stanojevic@ed.ac.uk"
},
{
"first": "Nick",
"middle": [
"M"
],
"last": "C Kenna",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Edinburgh",
"location": {}
},
"email": "nick.mckenna@ed.ac.uk"
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Edinburgh",
"location": {}
},
"email": "steedman@inf.ed.ac.uk"
},
{
"first": "Paul",
"middle": [],
"last": "Thompson",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Edinburgh",
"location": {}
},
"email": ""
},
{
"first": "Raheel",
"middle": [],
"last": "Nawaz",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Edinburgh",
"location": {}
},
"email": ""
},
{
"first": "John",
"middle": [],
"last": "Mcnaught",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Edinburgh",
"location": {}
},
"email": ""
},
{
"first": "Sophia",
"middle": [],
"last": "Ananiadou",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Edinburgh",
"location": {}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Language provides speakers with a rich system of modality for expressing thoughts about events, without being committed to their actual occurrence. Modality is commonly used in the political news domain, where both actual and possible courses of events are discussed. NLP systems struggle with these semantic phenomena, often incorrectly extracting events which did not happen, which can lead to issues in downstream applications. We present an opendomain, lexicon-based event extraction system that captures various types of modality. This information is valuable for Question Answering, Knowledge Graph construction and Factchecking tasks, and our evaluation shows that the system is sufficiently strong to be used in downstream applications.",
"pdf_parse": {
"paper_id": "2021",
"_pdf_hash": "",
"abstract": [
{
"text": "Language provides speakers with a rich system of modality for expressing thoughts about events, without being committed to their actual occurrence. Modality is commonly used in the political news domain, where both actual and possible courses of events are discussed. NLP systems struggle with these semantic phenomena, often incorrectly extracting events which did not happen, which can lead to issues in downstream applications. We present an opendomain, lexicon-based event extraction system that captures various types of modality. This information is valuable for Question Answering, Knowledge Graph construction and Factchecking tasks, and our evaluation shows that the system is sufficiently strong to be used in downstream applications.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Linguistic modality is frequently used in natural language to express uncertainty with respect to events and states. Downstream NLP tasks that depend on knowing whether an event actually occurred, such as Knowledge Graph construction, Fact-checking, Question Answering and Entailment Graph construction, can benefit from understanding modality. Such information is crucial in the medical domain, for instance, where it facilitates more accurate Information Extraction and search for radiology reports (Wu et al., 2011; Peng et al., 2018) . Similarly, if we pose a question in the socio-political domain, such as Did the protesters attack the police?, our answer will be different depending on the evidence that the system has observed: Protesters attacked the police [yes] or Protesters are unlikely to have attacked the police [uncertain] 1 . These challenges are exacerbated by the prevalence of the phenomenon. In a multi-domain uncertainty corpus (Szarvas et al., 2012) , sentences containing uncertainty cues are significantly more common in newswire text (18%) compared to encyclopedic text (13%). Modality is also frequently observed in editorials (Bonyadi, 2011) . We show that within the news genre, modality is common in the politics and sports domains, where experts often make predictions and state their opinions on the possible outcomes of events such as elections or sports matches, and analyse alternative outcomes where situations unfold differently.",
"cite_spans": [
{
"start": 501,
"end": 518,
"text": "(Wu et al., 2011;",
"ref_id": null
},
{
"start": 519,
"end": 537,
"text": "Peng et al., 2018)",
"ref_id": "BIBREF37"
},
{
"start": 767,
"end": 772,
"text": "[yes]",
"ref_id": null
},
{
"start": 951,
"end": 973,
"text": "(Szarvas et al., 2012)",
"ref_id": "BIBREF44"
},
{
"start": 1155,
"end": 1170,
"text": "(Bonyadi, 2011)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We present MONTEE 2 , an open-domain system for Modality and Negation Tagging in Event Extraction. Tagging these phenomena allows us to distinguish between events that took place (e.g. Protesters attacked the police), those that did not take place (Had protesters attacked the police...), or are uncertain at the time that a document is written (Protesters may have attacked the police).",
"cite_spans": [
{
"start": 18,
"end": 19,
"text": "2",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The extracted relations include a predicate and one or two arguments, for example: Protestersattack-police (from the sentence Protesters attacked the police). The predicates are analysed according to the following semantic phenomena: negation, lexical negation, modal operators, conditionality, counterfactuality and propositional attitude. See Table 1 for examples of each category.",
"cite_spans": [],
"ref_spans": [
{
"start": 345,
"end": 352,
"text": "Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We contribute a lexicon of words and phrases that trigger modality, a parser that extracts and tags open-domain event relations for modality (along with an intrinsic evaluation), and a corpus study focusing on the politics domain of a large corpus of news text. If protesters attack the police...",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Had protesters attacked the police...",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Counterfactual",
"sec_num": null
},
{
"text": "Journalists said that attitude protesters attacked the police Modality: In this work, the focus is on any kind of modality indicating uncertainty, including modal verbs, conditionals, propositional attitudes, and negation. We see modality primarily as a signal for determining whether or not the event in question actually occurred, so that downstream applications can take this into account. We begin by discussing the typical, more specific category of modal operators. Linguistic modality communicates a speaker's attitude towards the propositional content of their utterance. Formally, modality has been defined in terms of quantification over possible worlds (Kratzer, 2012) . Other definitions focus on categorising the speaker's attitude, such as epistemic necessity (That must be John.), epistemic possibility (It might rain tomorrow.), deontic necessity (You must go.), and deontic possibility (You may enter.) (Van Der Auwera and Ammann, 2005) . Sometimes a lexical trigger of modality is ambiguous between categories; English may, for example, is ambiguous between an epistemic possibility reading (It may rain tomorrow.) and a deontic possibility reading (You may enter.)",
"cite_spans": [
{
"start": 664,
"end": 679,
"text": "(Kratzer, 2012)",
"ref_id": "BIBREF21"
},
{
"start": 920,
"end": 953,
"text": "(Van Der Auwera and Ammann, 2005)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Propositional",
"sec_num": null
},
{
"text": "These definitions have brought about a variety of annotation schemes in practice. Prabhakaran et al. (2012) propose five classes of modality: ability, effort, intention, success, and want, and train a classifier on crowd-sourced annotated data. Baker et al. (2010) extend the number of modality classes to include requirement, permission, and belief, and combine these with negation. Pe\u00f1as et al. (2011) take a coarser, epistemic approach, asking whether events are asserted, negated, or speculated, and Saur\u0131 et al. (2006) enrich the TimeML specification language with yet other categories (e.g. evidentiality, conditionality).",
"cite_spans": [
{
"start": 82,
"end": 107,
"text": "Prabhakaran et al. (2012)",
"ref_id": "BIBREF38"
},
{
"start": 245,
"end": 264,
"text": "Baker et al. (2010)",
"ref_id": "BIBREF3"
},
{
"start": 384,
"end": 403,
"text": "Pe\u00f1as et al. (2011)",
"ref_id": "BIBREF36"
},
{
"start": 504,
"end": 523,
"text": "Saur\u0131 et al. (2006)",
"ref_id": "BIBREF41"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Propositional",
"sec_num": null
},
{
"text": "In English, modality can be expressed in a va-riety of ways. The modal auxiliaries (e.g. might, should, can) are commonly used, but modality can be lexicalised in many other trigger words. Nouns (e.g. possibility), adjectives (e.g. obligatory), adverbs (e.g. probably) and verbs (e.g. presume that) can all indicate modality. In the long tail, speakers have access to vastly productive phrases that indicate their attitude. The following examples occurred naturally in the news domain (Zhang and Weld, 2013) : That's how close they were to ..., I cannot come up with a scenario that has..., That's based on the world wide assumption that....",
"cite_spans": [
{
"start": 485,
"end": 507,
"text": "(Zhang and Weld, 2013)",
"ref_id": "BIBREF49"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Propositional",
"sec_num": null
},
{
"text": "A conditional sentence is composed of a subordinate clause (which we will refer to as the antecedent) and a main clause (the consequent). The antecedent and consequent are connected by a conditional conjunction (which in English is often the word if ), as in the sentence If they attack there will be war (Dancygier, 1998) . Conditional sentences can have a variety of semantic interpretations, but the most commonly studied, the hypothetical conditional, expresses that the consequent (there will be war) will hold true if the antecedent (the attack) is satisfied (Athanasiadou and Dirven, 1997) . For our purposes, the most important part of their semantics is that neither the antecedent nor the consequent are normally entailed by the sentence, so that the speaker is not committed to their truth.",
"cite_spans": [
{
"start": 305,
"end": 322,
"text": "(Dancygier, 1998)",
"ref_id": "BIBREF10"
},
{
"start": 565,
"end": 596,
"text": "(Athanasiadou and Dirven, 1997)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conditionality:",
"sec_num": null
},
{
"text": "Counterfactuality: In the counterfactual construction a more complicated semantic relation is established between antecedent and consequent, as in the example: Had they protested, they would be content. As with modality, this has been formalised more precisely with a possible world semantics (Lewis, 1973; Kratzer, 1981) . With a counterfactual, the speaker communicates that in any world similar to the current one, differing only by the proposition in the antecedent, the consequent would hold true (Lewis, 1973 ). In the above example, if the world is altered by the protest in the antecedent, they would be content holds true. Again, the crucial semantic information for our work is that neither the antecedent nor the consequent are entailed.",
"cite_spans": [
{
"start": 293,
"end": 306,
"text": "(Lewis, 1973;",
"ref_id": "BIBREF24"
},
{
"start": 307,
"end": 321,
"text": "Kratzer, 1981)",
"ref_id": "BIBREF20"
},
{
"start": 502,
"end": 514,
"text": "(Lewis, 1973",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conditionality:",
"sec_num": null
},
{
"text": "Negation is a semantic category used to change the truth value of a proposition in order to convey that an event, situation or state does not hold (Horn, 1989) . It may be expressed explicitly using various means, most notably closed-class function words such as not, no, never, neither, nor, none and without, but can also be expressed lexically in open grammatical categories such as nouns (e.g. impossibility), verbs (e.g. decline, prevent), and adjectives (e.g. unsuccessful). It may also be expressed implicitly, such as with combinations of certain verb types and tenses (e.g. The polls were supposed to have closed at midnight). In this work we consider only explicit cues of negation.",
"cite_spans": [
{
"start": 147,
"end": 159,
"text": "(Horn, 1989)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conditionality:",
"sec_num": null
},
{
"text": "Propositional Attitude and Evidentiality: Propositional attitude allows speakers to indicate the cognitive relations that entities bear to a proposition (McKay and Nelson, 2000) . For example, in Republicans think that Trump has won, the speaker expresses that Republicans hold certain beliefs. In English, such reports are often made using propositional attitude verbs such as claim, warn or believe. Normally only the entity's thoughts regarding the event are entailed, not the event itself. Propositional attitudes are often used as markers of evidentiality in English (Biber and Finegan, 1989) . These are important in Question Answering. For example when answering a question using the sentence The Kremlin says protesters attacked the police as evidence, mentioning the source (The Kremlin) might be particularly important.",
"cite_spans": [
{
"start": 153,
"end": 177,
"text": "(McKay and Nelson, 2000)",
"ref_id": "BIBREF28"
},
{
"start": 572,
"end": 597,
"text": "(Biber and Finegan, 1989)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conditionality:",
"sec_num": null
},
{
"text": "A number of approaches have been proposed for the automatic tagging of modality in text. These differ in both the granularity of the classes of modality that the model tags, and the model design. At the lowest granularity all modality classes are collapsed into a single label. This strategy was employed in the pilot task on modality and negation detection at CLEF 2012, in which participants were asked to automatically label a set of events/states as negated, modal, neither, or both (Morante and Daelemans, 2012) . The submitted systems were either purely rule-based (Lana-Serrano et al., 2012; Pakray et al., 2012) , or applied rules to the output of a parser (Rosenberg et al., 2012) . Modality tagging has also been cast as a supervised learning task (Prabhakaran et al., 2012) . Performance of their classifier is reasonably strong on in-domain data (variable across 5 proposed modality classes), but out-of-domain data proves challenging.",
"cite_spans": [
{
"start": 487,
"end": 516,
"text": "(Morante and Daelemans, 2012)",
"ref_id": "BIBREF32"
},
{
"start": 571,
"end": 598,
"text": "(Lana-Serrano et al., 2012;",
"ref_id": null
},
{
"start": 599,
"end": 619,
"text": "Pakray et al., 2012)",
"ref_id": "BIBREF35"
},
{
"start": 665,
"end": 689,
"text": "(Rosenberg et al., 2012)",
"ref_id": "BIBREF40"
},
{
"start": 758,
"end": 784,
"text": "(Prabhakaran et al., 2012)",
"ref_id": "BIBREF38"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Modality Taggers and Annotated Datasets",
"sec_num": "2.2"
},
{
"text": "Due to the lack of a large, open-domain modality training dataset, we opt for a lexicon-based approach in line with that of Baker et al. (2010) . They combine a set of eight modality tags that cap-ture factivity with negation, to denote whether an event/state did or did not happen. They employ two strategies for tagging modal triggers and their targets: 1) string and POS-tag matching between entries in a modality lexicon and the input sentence, 2) a structure-based method which applies rules derived from the lexicon to a flattened dependency tree, inserting tags for modality triggers and targets into the sentence.",
"cite_spans": [
{
"start": 124,
"end": 143,
"text": "Baker et al. (2010)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Modality Taggers and Annotated Datasets",
"sec_num": "2.2"
},
{
"text": "Although there is no large, open-domain corpus in which modality is labelled, a number of small datasets exist for specific domains including biomedical text (Thompson et al., 2011) , news (Thompson et al., 2017) , reviews (Konstantinova et al., 2012) , and web-crawled text comprising news, web pages, blogs and Wikipedia (Morante and Daelemans, 2012) .",
"cite_spans": [
{
"start": 158,
"end": 181,
"text": "(Thompson et al., 2011)",
"ref_id": "BIBREF46"
},
{
"start": 189,
"end": 212,
"text": "(Thompson et al., 2017)",
"ref_id": null
},
{
"start": 223,
"end": 251,
"text": "(Konstantinova et al., 2012)",
"ref_id": "BIBREF19"
},
{
"start": 323,
"end": 352,
"text": "(Morante and Daelemans, 2012)",
"ref_id": "BIBREF32"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Modality Taggers and Annotated Datasets",
"sec_num": "2.2"
},
{
"text": "Since the introduction of the Open Information Extraction (OIE) task by Banko et al. (2007) , a range of open-domain information extraction systems have been proposed for the extraction of relation tuples from text. OIE systems make use of patterns, which may be hand-crafted (Fader et al., 2011; Angeli et al., 2015) or learned through methods such as bootstrapping (Wu and Weld, 2010; Mausam et al., 2012) . These patterns may be applied at the sentence level, or to semantically simplified independent clauses identified during a pre-processing step (Del Corro and Gemulla, 2013; Angeli et al., 2015) . The majority of systems are restricted to the extraction of binary relations (i.e. relation triples consisting of a predicate and two arguments), but systems have also been proposed for the extraction of n-ary relations (Akbik and L\u00f6ser, 2012; Mesquita et al., 2013) . Our system is a form of n-ary event extraction; we extract both binary and unary relations, and relations of higher valencies can be inferred by combining sets of binary relations. A comprehensive survey of OIE systems is provided by Niklaus et al. (2018) .",
"cite_spans": [
{
"start": 72,
"end": 91,
"text": "Banko et al. (2007)",
"ref_id": "BIBREF4"
},
{
"start": 276,
"end": 296,
"text": "(Fader et al., 2011;",
"ref_id": "BIBREF13"
},
{
"start": 297,
"end": 317,
"text": "Angeli et al., 2015)",
"ref_id": "BIBREF1"
},
{
"start": 367,
"end": 386,
"text": "(Wu and Weld, 2010;",
"ref_id": "BIBREF47"
},
{
"start": 387,
"end": 407,
"text": "Mausam et al., 2012)",
"ref_id": "BIBREF27"
},
{
"start": 583,
"end": 603,
"text": "Angeli et al., 2015)",
"ref_id": "BIBREF1"
},
{
"start": 826,
"end": 849,
"text": "(Akbik and L\u00f6ser, 2012;",
"ref_id": "BIBREF0"
},
{
"start": 850,
"end": 872,
"text": "Mesquita et al., 2013)",
"ref_id": "BIBREF30"
},
{
"start": 1109,
"end": 1130,
"text": "Niklaus et al. (2018)",
"ref_id": "BIBREF34"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Event Extraction",
"sec_num": "2.3"
},
{
"text": "Whilst many event extraction systems have been developed, none capture the wide range of modality phenomena introduced in Section 2.1. For example, neither OpenIE nor OLLIE extract unary relations. They also fail to adequately handle all of the phenomena we are interested in, in particular counterfactuals and lexical negation. (See Sec-Johnson doubts that Labour will win the election tion 6 for a comparison of our system with OpenIE and OLLIE.) We therefore construct our own event extraction system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Event Extraction System Overview",
"sec_num": "3"
},
{
"text": "N (S[dcl]\\NP)/S[em] S[em]/S[dcl] N (S[dcl]\\NP)/(S[b]\\NP) (S[b]\\NP)/NP NP/N N TC TC > NP NP NP > S[b]\\NP > S[dcl]\\NP < S[dcl] > S[em] > S[dcl]\\NP < S[dcl]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Event Extraction System Overview",
"sec_num": "3"
},
{
"text": "Our system takes as input a text document, and for each sentence outputs a set of event relations. An event relation tuple consists of a predicate and either one, or two arguments (e.g. (The) protest-ended, Angela Merkel-addressed-NPD protesters). We use a pipeline approach similar to that described by Hosseini et al. (2018) , which allows us to extract open-domain relations.",
"cite_spans": [
{
"start": 304,
"end": 326,
"text": "Hosseini et al. (2018)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Event Extraction System Overview",
"sec_num": "3"
},
{
"text": "Each sentence in the document is parsed using the RotatingCCG parser (Stanojevi\u0107 and Steedman, 2019) over which we construct a CCG dependency graph using a method similar to the one proposed by Clark et al. (2002) . (See Figure 2 for an example of a dependency graph and Figure 1 for the CCG parse tree from which it was extracted.) CCG dependency graphs are more expressive than standard dependency trees because they can encode long-range dependencies, coordination and reentrancies. We traverse the dependency graph, starting from verb and preposition nodes, until an argument node is reached. The traversed nodes, which are used to form the predicate strings, may include (non-auxiliary) verbs, verb particles, adjectives, and prepositions. The CCG argument slot position, corresponding to the grammatical case of the argument (e.g. 1 for nominative, 2 for accusative), is appended to the predicate.",
"cite_spans": [
{
"start": 194,
"end": 213,
"text": "Clark et al. (2002)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [
{
"start": 221,
"end": 229,
"text": "Figure 2",
"ref_id": null
},
{
"start": 271,
"end": 279,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Event Extraction System Overview",
"sec_num": "3"
},
{
"text": "Our focus is on the extraction of binary and unary relations. Binary relations may be extracted from dependency paths between two entities. Extraction of unary relations, which have only one such endpoint, poses a harder challenge (Szpektor and Dagan, 2008) -we must decide whether they are truly a unary relation, or form part of a binary relation. Therefore linguistic knowledge must be carefully applied to extract meaningful unary relations. We extract unary relations for the following cases: verbs with a single argument including intransitives (bombs exploded) and passivised transitives (protests were held), and copular constructions (Greta Thunberg is a climate activist).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Event Extraction System Overview",
"sec_num": "3"
},
{
"text": "In addition to binary and unary relations we also extract n-ary relations which combine two binary relations via prepositional attachment. These are of the form: arg1-predicate-arg2-preposition-arg3, and are constructed by combining the two binary relations arg1-predicate-arg2 and arg2-preposition-arg3. For example Protestersmarched on-Parliament Square and Parliament Square-in-London combine to form the new relation Protesters-marched on Parliament Square in-London (from the sentence: Protesters marched on Parliament Square in London).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Event Extraction System Overview",
"sec_num": "3"
},
{
"text": "Passive predicates are mapped to active ones. Modifiers such as managed to as in the example Boris Johnson managed to secure a Brexit deal are also included in the predicate. As these may be rather sparse, we provide the option to also extract the relation without the modifier. Arguments are classified as either a Named Entity (extracted by the CoreNLP (Manning et al., 2014) Named Entity recogniser), or a general entity (all other nouns and noun phrases). Arguments are mapped to types by linking to their Freebase (Bollacker et al., 2008) IDs using AIDA-Light (Nguyen et al., 2014) , and subsequently mapping these IDs to their fine-grained FIGER types (Ling and Weld, 2012) . For example, Angela Merkel would be mapped to person/politician and NPD (Nationaldemokratische Partei Deutschland) to government/political party. The type system may be leveraged to identify events belonging to specific domains, for example, to identify and track political events such as elections, debates, protests etc. and the entities involved.",
"cite_spans": [
{
"start": 355,
"end": 377,
"text": "(Manning et al., 2014)",
"ref_id": "BIBREF26"
},
{
"start": 519,
"end": 543,
"text": "(Bollacker et al., 2008)",
"ref_id": "BIBREF6"
},
{
"start": 554,
"end": 586,
"text": "AIDA-Light (Nguyen et al., 2014)",
"ref_id": null
},
{
"start": 658,
"end": 679,
"text": "(Ling and Weld, 2012)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Event Extraction System Overview",
"sec_num": "3"
},
{
"text": "Since many of the phenomena we capture involve lexical trigger items, we opt for a lexicon-based approach. Triggers identified using the lexicon can then be linked to event nodes in the CCG dependency graph. Entries in the lexicon cover modality, lexical negation, propositional attitude, and conditionality, with counterfactuality handled separately. Each entry contains the lemma, the categories that it covers, the POS-tag and an estimate of the epistemic strength that the word would normally indicate. A few examples are included in Table 2 .",
"cite_spans": [],
"ref_spans": [
{
"start": 538,
"end": 545,
"text": "Table 2",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Lexicon",
"sec_num": "4"
},
{
"text": "Our lexicon is constructed by pooling together various lexical resources. The majority of the entries derive from the modality lexicon presented by Baker et al. (2010) , who use it for a similar rule-based tagging approach. Their lexicon contains just under a thousand instances, but includes multiple forms for each verb inflection. Using only infinitival forms, we add approximately 200 of the modal entries to our own lexicon.",
"cite_spans": [
{
"start": 148,
"end": 167,
"text": "Baker et al. (2010)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Lexicon",
"sec_num": "4"
},
{
"text": "For modelling propositional attitude, we include a list of reporting verbs found in Fay (1990) . This added roughly another 120 phrases to the resource. for n in G do 5:",
"cite_spans": [
{
"start": 84,
"end": 94,
"text": "Fay (1990)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Lexicon",
"sec_num": "4"
},
{
"text": "if check lexicon(n,l) or check cf(n,G) then 6: trigger nodes.add(n) 7: end if 8: end for 9:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lexicon",
"sec_num": "4"
},
{
"text": "for e n in event nodes do 10:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lexicon",
"sec_num": "4"
},
{
"text": "for t n in trigger nodes do 11:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lexicon",
"sec_num": "4"
},
{
"text": "if path between(e n, t n) then 12: e n \u2190 update(e n,t n.tag) 13: end if 14:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lexicon",
"sec_num": "4"
},
{
"text": "end for 15: e n.tag \u2190 tag precedence(e n) 16: event nodes.update(e n) 17: end for 18:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lexicon",
"sec_num": "4"
},
{
"text": "return event nodes 19: end procedure",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lexicon",
"sec_num": "4"
},
{
"text": "The new entries were separated by attitudes expressed through speech (tag ATT SAY, e.g. say, state) and attitudes of thought (tag ATT THINK, e.g. suspect, assume).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lexicon",
"sec_num": "4"
},
{
"text": "More phrases expressing uncertainty are found in a data set of news domain sentences describing conflicting events, such as a win and a loss (Guillou et al., 2020). Such sentences often contained descriptions of events that didn't actually happen. Yet more related words were found by generating each entry's WordNet synonyms and antonyms (Miller, 1995) . We filtered and annotated these manually to obtain just under another 200 phrases, and added these to the lexicon. We also took inspiration from Somasundaran et al. (2007) , especially for conditionals. In aggregate, this work resulted in a resource of 530 phrases.",
"cite_spans": [
{
"start": 339,
"end": 353,
"text": "(Miller, 1995)",
"ref_id": "BIBREF31"
},
{
"start": 501,
"end": 527,
"text": "Somasundaran et al. (2007)",
"ref_id": "BIBREF42"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Lexicon",
"sec_num": "4"
},
{
"text": "We also annotated each phrase with a modal category. Our lexicon contains the categories deontic, intention and desire, and for the remaining phrases lists a indication of epistemic strength, with values 4 (definitely), 3 (probably), 2 (possibly), 1 (probably not) and 0 (definitely not). The latter correspond to lexical negation. The epistemic strength values were manually annotated by the authors, and are proposed as a means to collect subsets of events, such as all events marked as probable or higher. This phenomenon deserves more attention in future research however, as it is highly contextualised. For example, could win the lottery should deserve a different annotation to could have breakfast.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Lexicon",
"sec_num": "4"
},
{
"text": "We use the CCG-based event extraction system (Section 3) and the expanded modality lexicon (Section 4) in tandem to assign modal categories to events. The procedure is described in Algorithm 1. The focus of the tagger is to identify the bulk of uncertain events: we prioritise recall over precision, so that we can expect events without a tag to have actually happened.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Modality Parser",
"sec_num": "5"
},
{
"text": "The event extractor produces a CCG dependency graph G that contains a node n for each word in the sentence (line 2 of the algorithm). We then decide which of these nodes is a trigger (lines 4-7). For modality, negation, lexical negation, propositional attitude and conditionals, we tag these nodes if the node's lemma is present in the lexicon (check lexicon function, line 5). The loop in the algorithm covers the simple case of single token modal triggers (such as possible), and can be extended to multi token triggers (e.g. shoot for) 3 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Modality Parser",
"sec_num": "5"
},
{
"text": "Counterfactual nodes are identified separately.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Modality Parser",
"sec_num": "5"
},
{
"text": "The check cf function (line 5) finds instances of the token \"had\" that are assigned one of two indicative CCG supertags:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Modality Parser",
"sec_num": "5"
},
{
"text": "(((S\\NP)\\(S\\NP))/(S[pt]\\NP))/NP or ((S/S)/(S[pt]\\NP))/NP. For example in the sentence The protesters would have been arrested, had they attacked the police, the token \"had\" would be assigned the CCG supertag (((S\\NP)\\(S\\NP))/(S[pt]\\NP))/NP and is therefore recognised as an instance of counterfactual had. Additionally, any instance of \"if\" that governs an instance of \"had\", is labelled as counterfactual. Upon realising that even this common counterfactual pattern was rare in the corpus, we decided not to engineer further counterfactual patterns.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Modality Parser",
"sec_num": "5"
},
{
"text": "We can then decide whether an event node should be tagged, by checking whether there is a path in the dependency graph from the trigger nodes to the event node (lines 9-12). Figure 2 illustrates the intuition behind walking the dependency graph. The graph shows a path from both doubt and will to win. This works because the existence of a path between a trigger node and an event node corresponds to the trigger node taking syntactic scope over the event node. The semantic phenomena we handle all rely heavily on this syntactic process (for example negation, see McKenna and Steedman (2020) ).",
"cite_spans": [
{
"start": 565,
"end": 592,
"text": "McKenna and Steedman (2020)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [
{
"start": 174,
"end": 182,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Modality Parser",
"sec_num": "5"
},
{
"text": "A single event node may be connected to multiple triggers, so we choose the final tag on line 15. Since our primary concern is whether the event happened, we do not combine tags and instead assign a single tag based on the following order of precedence: MOD, ATT SAY, ATT THINK, COND, COUNT, LNEG, NEG. The negation categories need to be ordered last because an event that is negated and modal is still uncertain (e.g. might not play shouldn't result in NEG play), but the ordering is otherwise arbitrary.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Modality Parser",
"sec_num": "5"
},
{
"text": "We highlight the capabilities of our system on five example sentences, comparing with two existing event extraction systems: OpenIE (Angeli et al., 2015) and OLLIE (Mausam et al., 2012) . Note that this is not intended as a conclusive evaluation of systems, but rather as a high-level overview of the phenomena captured by each of the systems. See Table 3 for a comparison of the relations extracted by MONTEE, OpenIE and OLLIE. The examples are all naturally occurring sentences from the news domain, obtained by a web search targeted to the modality categories discussed in this paper. To enable a fair comparison, we focus on the extraction of binary relations, as neither OpenIE nor OLLIE was designed to extract unary relations. Whilst Stanford OpenIE (Angeli et al., 2015) , OLLIE (Mausam et al., 2012) , and OLLIE's predecessor REVERB (Fader et al., 2011 ) may be used to extract binary relations for events, they do not explicitly mark events for modality or negation. Stanford OpenIE (Angeli et al., 2015) typically includes modals as part of the predicate (for example: (Protesters; may have attacked; police)), but ignores the other categories of linguistic modality described in Section 5. In particular it does not extract relations for sentences involving negation or propositional attitude, omits lexical negations, and is easily confused by sentences involving conditionals or counterfactuals.",
"cite_spans": [
{
"start": 132,
"end": 153,
"text": "(Angeli et al., 2015)",
"ref_id": "BIBREF1"
},
{
"start": 164,
"end": 185,
"text": "(Mausam et al., 2012)",
"ref_id": "BIBREF27"
},
{
"start": 757,
"end": 778,
"text": "(Angeli et al., 2015)",
"ref_id": "BIBREF1"
},
{
"start": 787,
"end": 808,
"text": "(Mausam et al., 2012)",
"ref_id": "BIBREF27"
},
{
"start": 842,
"end": 861,
"text": "(Fader et al., 2011",
"ref_id": "BIBREF13"
},
{
"start": 993,
"end": 1014,
"text": "(Angeli et al., 2015)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [
{
"start": 348,
"end": 355,
"text": "Table 3",
"ref_id": "TABREF6"
}
],
"eq_spans": [],
"section": "Comparison with Existing Event Extraction Systems",
"sec_num": "6"
},
{
"text": "OLLIE (Mausam et al., 2012) handles the phenomena in more detail. It identifies conditionals by detecting markers such as \"if\" and \"when\", and labels the enabling condition for extracted relations that are governed by a conditional 4 . It typically includes modals and negation as part of the predicate, and captures propositional attitude in its handling of attribution (e.g. Ed Miliband says...). Like Ope-nIE, OLLIE is not designed to handle counterfactuals. In terms of lexical negations, OLLIE extracts the predicate both with and without the negation cue, which is undesirable if the downstream NLP application needs to be able to distinguish between events that took place and those that did not.",
"cite_spans": [
{
"start": 6,
"end": 27,
"text": "(Mausam et al., 2012)",
"ref_id": "BIBREF27"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison with Existing Event Extraction Systems",
"sec_num": "6"
},
{
"text": "In the absence of a pre-existing open-domain evaluation dataset that closely matches the task we are interested in, we conduct an intrinsic evaluation of our modality-aware event extraction system. We measure performance on a set of 100 extracted event relations with manually annotated labels denoting the degree of certainty (happened, didn't happen, uncertain). An event relation consists of a predicate plus argument pair (e.g. (Protesters; attack; police)). Note that we exclude both OLLIE and OpenIE from this evaluation as neither system is designed to handle the complete set of modality or negation phenomena we are interested in (c.f. Section 6). We filtered the articles in the NewsSpike corpus (Zhang and Weld, 2013) to obtain those where at least 20% of the event relations are tagged (to guarantee a reasonably dense distribution of modality). We then randomly selected five articles and processed them using our system to extract event relations. From these articles we selected 100 event relations 5 . At the sentence-level we ensured that we include only one event relation for each predicate node in the dependency graph, since all event relations with the same predicate node will be assigned the same modality.",
"cite_spans": [
{
"start": 706,
"end": 728,
"text": "(Zhang and Weld, 2013)",
"ref_id": "BIBREF49"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluating System Performance",
"sec_num": "7"
},
{
"text": "The set of 100 event relations was manually annotated by two of the authors of this paper, one native English speaker and one fluent speaker. For each event relation, we asked the annotators to answer the question Does the text entail that the event definitely happens? using the following labels: the event happened (2), is uncertain (1), didn't happen (0). Inter-annotator agreement over the set of 100 event relations was measured using Cohen's Kappa (Cohen, 1960) . The agreement score was 0.77, indicating substantial agreement, and the annotations differed for only 16 examples. Following the initial annotation task, the two annotators resolved the disagreements, which resulted in the gold standard test set.",
"cite_spans": [
{
"start": 454,
"end": 467,
"text": "(Cohen, 1960)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluating System Performance",
"sec_num": "7"
},
{
"text": "To evaluate our system, we mapped systemassigned modal and negation tags to the set of certainty labels, with LNEG and NEG tags mapped to 0 (didn't happen), empty tags mapped to 2 (happened), and all other tags mapped to 1 (uncertain). In Table 4 we report the micro-and macro-averaged precision, recall and F1 scores. As the number of event relations per modality tag category is too small for a meaningful error analysis over types, we provide aggregated scores. The distribution of certainty labels is also uneven, with few negations marked in the gold standard. We therefore take the micro-averaged F1 score of 0.81 to be the definitive result.",
"cite_spans": [],
"ref_spans": [
{
"start": 239,
"end": 246,
"text": "Table 4",
"ref_id": "TABREF8"
}
],
"eq_spans": [],
"section": "Evaluating System Performance",
"sec_num": "7"
},
{
"text": "We performed an error analysis of the 17 errors made by our system on the test set of 100 event relations. Parsing was a common issue, with five errors attributed to general parsing mistakes, and five errors due to missing dependency links between reporting verbs and events in quoted text (e.g. \"Police were attacked\", they said). Two mistakes were due to human error, as the annotators also missed these reporting verbs in longer sentences. Then, three errors arose from issues with the lexicon. Two of these stemmed from lack of coverage: our lexicon does not handle temporal displacement, as in We won't act until the white house gives more information. The other was caused by incorrect application of a lexical entry, which would need to be disambiguated using context. Finally, two errors could also have been avoided by handling linguistic aspect, as in they began the process to.... Future research could thus focus on expanding the lexicon by these final categories of displacement, and taking context into account when linking a word to the lexicon.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Evaluating System Performance",
"sec_num": "7"
},
{
"text": "We conducted a corpus analysis of extracted relations over the NewsSpike corpus (Zhang and Weld, 2013) . NewsSpike contains approximately 540K multi-source news articles (approximately 20M sentences) collected over a period of six weeks. We report on the distributions of tagged phenomena over the set of binary relations 6 extracted from news articles in the complete corpus (general domain), and for the subsets of articles related to the politics and sports domains.",
"cite_spans": [
{
"start": 80,
"end": 102,
"text": "(Zhang and Weld, 2013)",
"ref_id": "BIBREF49"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus Analysis",
"sec_num": "8"
},
{
"text": "The NewsSpike corpus does not include topic or domain information in the article-level metadata. Therefore to identify articles belonging to the politics and sports domains we leveraged the named 6 The corpus study of unary relations is left for future work -Light (Nguyen et al., 2014) and the FIGER type system (Ling and Weld, 2012) . We first identified the set of fine-grained FIGER types related to each sub-domain, and then obtained the set of entities belonging to each type. Next we used the output of AIDA-Light to identify the set of articles for which more than 40% of the entities found by the linker belonged to the politics domain, with at least two political entities. We repeated this process for the sports domain, with a lowered threshold of 25%, as the sports topic is less likely to overlap with other topics.",
"cite_spans": [
{
"start": 196,
"end": 197,
"text": "6",
"ref_id": null
},
{
"start": 258,
"end": 286,
"text": "-Light (Nguyen et al., 2014)",
"ref_id": null
},
{
"start": 313,
"end": 334,
"text": "(Ling and Weld, 2012)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus Analysis",
"sec_num": "8"
},
{
"text": "The distribution of relation tags over the general, politics, and sports domains is shown in Table 5 . For the politics domain just over 25% of the extracted relations are tagged by the modality parser, which is more than for the sports or general domains. In particular, modals are more prevalent. This suggests that whilst it is important to identify modality in the general news domain, it is particularly important in the politics domain.",
"cite_spans": [],
"ref_spans": [
{
"start": 93,
"end": 100,
"text": "Table 5",
"ref_id": "TABREF10"
}
],
"eq_spans": [],
"section": "Corpus Analysis",
"sec_num": "8"
},
{
"text": "The top ten most frequent trigger words found in the general domain are: the propositional attitude trigger say, the modal triggers will, would, can, could, may, should, want and have to, and the conditional trigger if. The same top ten are also observed for the politics domain (with different frequencies), and for the sports domain the propositional attitude trigger think replaces want. The similarity of these lists is perhaps not surprising as all three domains belong to the news genre.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Corpus Analysis",
"sec_num": "8"
},
{
"text": "An obvious limitation of our approach is that it does not take into account the context in which events and trigger words occur. Modality is a contextdependent phenomenon, so using the sentential context would improve accuracy. For example, the word unbelievable is ambiguous between an unlikely and an amazing, and happened reading. Relatedly, our concept of epistemic strength is highly context-sensitive, and requires further development. A promising avenue is to develop a pre-training procedure for a modality-aware contextualised language model (Devlin et al., 2019; Zhou et al., 2020) . We plan to use our modal lexicon to identify sentences with modality triggers. We will then gather human annotations of the certainty that each event happened, and use this annotated data to train a modality-aware language model able to classify event uncertainty. Such a system might eventually even tackle the long-tail of modal examples mentioned in Section 2.1.",
"cite_spans": [
{
"start": 551,
"end": 572,
"text": "(Devlin et al., 2019;",
"ref_id": "BIBREF12"
},
{
"start": 573,
"end": 591,
"text": "Zhou et al., 2020)",
"ref_id": "BIBREF50"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Future Work",
"sec_num": "9"
},
{
"text": "We will also investigate the application of zero shot and few shot learning to the problem of detecting modality and negation. This could provide a way to leverage a large pre-trained language model together with a small annotated corpus.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Future Work",
"sec_num": "9"
},
{
"text": "Our system was developed for English, but work is already underway to develop event extraction systems for other languages including German and Chinese. Extending to other languages would allow us to apply our methods to multilingual and crosslingual NLP tasks. Finally, most CCG parsers, including the one used in this work, are trained on English CCGbank (Hockenmaier and Steedman, 2007) . This makes them perform well on news text, but accuracy suffers on out-of-domain sentences, primarily those involving questions. The results could be improved by retraining the parser on the CCG annotated questions dataset (Rimell and Clark, 2008; Yoshikawa et al., 2019) , allowing us to apply our system to the task of open-domain Question Answering in an extrinsic evaluation.",
"cite_spans": [
{
"start": 357,
"end": 389,
"text": "(Hockenmaier and Steedman, 2007)",
"ref_id": "BIBREF16"
},
{
"start": 615,
"end": 639,
"text": "(Rimell and Clark, 2008;",
"ref_id": "BIBREF39"
},
{
"start": 640,
"end": 663,
"text": "Yoshikawa et al., 2019)",
"ref_id": "BIBREF48"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Future Work",
"sec_num": "9"
},
{
"text": "We have presented MONTEE, a modality-aware event extraction system that can distinguish between events that took place, did not take place, and for which there is a degree of uncertainty. Being able to make such distinctions is crucial for many downstream NLP applications, including Knowledge Graph construction and Question Answering.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "10"
},
{
"text": "Our parser performs strongly on an intrinsic evaluation of examples from the politics domain and our corpus analysis supports our claim that modality is an important phenomenon to handle in this domain.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "10"
},
{
"text": "https://gitlab.com/lianeg/montee",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We implement this as a recursive loop over a Trie data structure.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The labelling of conditional is not applied in the first example inTable 3as no relation is extracted for the consequent.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We excluded those event relations for which the predicate contains only a preposition as these have little meaning unless they form part of a high-order n-ary relation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "This work was funded by the ERC H2020 Advanced Fellowship GA 742137 SEMANTAX and a grant from The University of Edinburgh and Huawei Technologies.The authors would like to thank Mark Johnson, Ian Wood, and Mohammad Javad Hosseini for helpful discussions, and the reviewers for their valuable feedback.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "KrakeN: Nary facts in open information extraction",
"authors": [
{
"first": "Alan",
"middle": [],
"last": "Akbik",
"suffix": ""
},
{
"first": "Alexander",
"middle": [],
"last": "L\u00f6ser",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the Joint Workshop on Automatic Knowledge Base Construction and Web-scale Knowledge Extraction (AKBC-WEKEX)",
"volume": "",
"issue": "",
"pages": "52--56",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alan Akbik and Alexander L\u00f6ser. 2012. KrakeN: N- ary facts in open information extraction. In Proceed- ings of the Joint Workshop on Automatic Knowledge Base Construction and Web-scale Knowledge Ex- traction (AKBC-WEKEX), pages 52-56, Montr\u00e9al, Canada. Association for Computational Linguistics.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Leveraging linguistic structure for open domain information extraction",
"authors": [
{
"first": "Gabor",
"middle": [],
"last": "Angeli",
"suffix": ""
},
{
"first": "Melvin Jose Johnson",
"middle": [],
"last": "Premkumar",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing",
"volume": "1",
"issue": "",
"pages": "344--354",
"other_ids": {
"DOI": [
"10.3115/v1/P15-1034"
]
},
"num": null,
"urls": [],
"raw_text": "Gabor Angeli, Melvin Jose Johnson Premkumar, and Christopher D. Manning. 2015. Leveraging linguis- tic structure for open domain information extraction. In Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Lan- guage Processing (Volume 1: Long Papers), pages 344-354, Beijing, China. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Conditionality, hypotheticality, counterfactuality. Amsterdam Studies in the Theory and History of Linguistic Science Series",
"authors": [
{
"first": "Angeliki",
"middle": [],
"last": "Athanasiadou",
"suffix": ""
},
{
"first": "Ren\u00e9",
"middle": [],
"last": "Dirven",
"suffix": ""
}
],
"year": 1997,
"venue": "",
"volume": "4",
"issue": "",
"pages": "61--96",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Angeliki Athanasiadou and Ren\u00e9 Dirven. 1997. Condi- tionality, hypotheticality, counterfactuality. Amster- dam Studies in the Theory and History of Linguistic Science Series 4, pages 61-96.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "A modality lexicon and its use in automatic tagging",
"authors": [
{
"first": "Kathryn",
"middle": [],
"last": "Baker",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Bloodgood",
"suffix": ""
},
{
"first": "Bonnie",
"middle": [],
"last": "Dorr",
"suffix": ""
},
{
"first": "Nathaniel",
"middle": [
"W"
],
"last": "Filardo",
"suffix": ""
},
{
"first": "Lori",
"middle": [],
"last": "Levin",
"suffix": ""
},
{
"first": "Christine",
"middle": [],
"last": "Piatko",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the Seventh International Conference on Language Resources and Evaluation (LREC'10)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kathryn Baker, Michael Bloodgood, Bonnie Dorr, Nathaniel W. Filardo, Lori Levin, and Christine Pi- atko. 2010. A modality lexicon and its use in au- tomatic tagging. In Proceedings of the Seventh In- ternational Conference on Language Resources and Evaluation (LREC'10), Valletta, Malta. European Language Resources Association (ELRA).",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Open information extraction from the web",
"authors": [
{
"first": "Michele",
"middle": [],
"last": "Banko",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"J"
],
"last": "Cafarella",
"suffix": ""
},
{
"first": "Stephen",
"middle": [],
"last": "Soderland",
"suffix": ""
},
{
"first": "Matt",
"middle": [],
"last": "Broadhead",
"suffix": ""
},
{
"first": "Oren",
"middle": [],
"last": "Etzioni",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 20th International Joint Conference on Artifical Intelligence, IJCAI'07",
"volume": "",
"issue": "",
"pages": "2670--2676",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michele Banko, Michael J. Cafarella, Stephen Soder- land, Matt Broadhead, and Oren Etzioni. 2007. Open information extraction from the web. In Pro- ceedings of the 20th International Joint Conference on Artifical Intelligence, IJCAI'07, page 2670-2676, San Francisco, CA, USA. Morgan Kaufmann Pub- lishers Inc.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Styles of stance in english: Lexical and grammatical marking of evidentiality and affect. Text-interdisciplinary journal for the study of discourse",
"authors": [
{
"first": "Douglas",
"middle": [],
"last": "Biber",
"suffix": ""
},
{
"first": "Edward",
"middle": [],
"last": "Finegan",
"suffix": ""
}
],
"year": 1989,
"venue": "",
"volume": "9",
"issue": "",
"pages": "93--124",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Douglas Biber and Edward Finegan. 1989. Styles of stance in english: Lexical and grammatical mark- ing of evidentiality and affect. Text-interdisciplinary journal for the study of discourse, 9(1):93-124.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Freebase: A collaboratively created graph database for structuring human knowledge",
"authors": [
{
"first": "Kurt",
"middle": [],
"last": "Bollacker",
"suffix": ""
},
{
"first": "Colin",
"middle": [],
"last": "Evans",
"suffix": ""
},
{
"first": "Praveen",
"middle": [],
"last": "Paritosh",
"suffix": ""
},
{
"first": "Tim",
"middle": [],
"last": "Sturge",
"suffix": ""
},
{
"first": "Jamie",
"middle": [],
"last": "Taylor",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD '08",
"volume": "",
"issue": "",
"pages": "1247--1250",
"other_ids": {
"DOI": [
"10.1145/1376616.1376746"
]
},
"num": null,
"urls": [],
"raw_text": "Kurt Bollacker, Colin Evans, Praveen Paritosh, Tim Sturge, and Jamie Taylor. 2008. Freebase: A collab- oratively created graph database for structuring hu- man knowledge. In Proceedings of the 2008 ACM SIGMOD International Conference on Management of Data, SIGMOD '08, page 1247-1250, New York, NY, USA. Association for Computing Machinery.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Linguistic manifestations of modality in newspaper",
"authors": [
{
"first": "Alireza",
"middle": [],
"last": "Bonyadi",
"suffix": ""
}
],
"year": 2011,
"venue": "International Journal of Linguistics",
"volume": "3",
"issue": "1",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alireza Bonyadi. 2011. Linguistic manifestations of modality in newspaper. International Journal of Lin- guistics, 3(1):E30.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Building deep dependency structures using a wide-coverage CCG parser",
"authors": [
{
"first": "Stephen",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "Julia",
"middle": [],
"last": "Hockenmaier",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "327--334",
"other_ids": {
"DOI": [
"10.3115/1073083.1073138"
]
},
"num": null,
"urls": [],
"raw_text": "Stephen Clark, Julia Hockenmaier, and Mark Steed- man. 2002. Building deep dependency structures us- ing a wide-coverage CCG parser. In Proceedings of the 40th Annual Meeting of the Association for Com- putational Linguistics, pages 327-334, Philadelphia, Pennsylvania, USA. Association for Computational Linguistics.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "A coefficient of agreement for nominal scales",
"authors": [
{
"first": "Jacob",
"middle": [],
"last": "Cohen",
"suffix": ""
}
],
"year": 1960,
"venue": "Educational and Psychological Measurement",
"volume": "20",
"issue": "1",
"pages": "37--46",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jacob Cohen. 1960. A coefficient of agreement for nominal scales. Educational and Psychological Measurement, 20(1):37-46.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Conditionals and Prediction: Time, Knowledge and Causation in Conditional Constructions",
"authors": [
{
"first": "Barbara",
"middle": [],
"last": "Dancygier",
"suffix": ""
}
],
"year": 1998,
"venue": "",
"volume": "87",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Barbara Dancygier. 1998. Conditionals and Predic- tion: Time, Knowledge and Causation in Condi- tional Constructions, volume 87 of Cambridge Stud- ies in Linguistics. Cambridge University Press.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Clausie: Clause-based open information extraction",
"authors": [
{
"first": "Luciano",
"middle": [],
"last": "Del Corro",
"suffix": ""
},
{
"first": "Rainer",
"middle": [],
"last": "Gemulla",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 22nd International Conference on World Wide Web, WWW '13",
"volume": "",
"issue": "",
"pages": "355--366",
"other_ids": {
"DOI": [
"10.1145/2488388.2488420"
]
},
"num": null,
"urls": [],
"raw_text": "Luciano Del Corro and Rainer Gemulla. 2013. Clausie: Clause-based open information extraction. In Pro- ceedings of the 22nd International Conference on World Wide Web, WWW '13, page 355-366, New York, NY, USA. Association for Computing Machin- ery.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "BERT: Pre-training of deep bidirectional transformers for language understanding",
"authors": [
{
"first": "Jacob",
"middle": [],
"last": "Devlin",
"suffix": ""
},
{
"first": "Ming-Wei",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Kenton",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "1",
"issue": "",
"pages": "4171--4186",
"other_ids": {
"DOI": [
"10.18653/v1/N19-1423"
]
},
"num": null,
"urls": [],
"raw_text": "Jacob Devlin, Ming-Wei Chang, Kenton Lee, and Kristina Toutanova. 2019. BERT: Pre-training of deep bidirectional transformers for language under- standing. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pages 4171-4186, Minneapolis, Minnesota. Associ- ation for Computational Linguistics.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Identifying relations for open information extraction",
"authors": [
{
"first": "Anthony",
"middle": [],
"last": "Fader",
"suffix": ""
},
{
"first": "Stephen",
"middle": [],
"last": "Soderland",
"suffix": ""
},
{
"first": "Oren",
"middle": [],
"last": "Etzioni",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1535--1545",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Anthony Fader, Stephen Soderland, and Oren Etzioni. 2011. Identifying relations for open information ex- traction. In Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing, pages 1535-1545, Edinburgh, Scotland, UK. Associ- ation for Computational Linguistics.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Collins Cobuild English Grammar",
"authors": [],
"year": 1990,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Richard Fay, editor. 1990. Collins Cobuild English Grammar. Collins, United Kingdom.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Incorporating temporal information in entailment graph mining",
"authors": [
{
"first": "Liane",
"middle": [],
"last": "Guillou",
"suffix": ""
},
{
"first": "Sander",
"middle": [],
"last": "Bijl De Vroe",
"suffix": ""
},
{
"first": "Mohammad",
"middle": [
"Javad"
],
"last": "Hosseini",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Johnson",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the Graphbased Methods for Natural Language Processing (TextGraphs)",
"volume": "",
"issue": "",
"pages": "60--71",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liane Guillou, Sander Bijl de Vroe, Mohammad Javad Hosseini, Mark Johnson, and Mark Steedman. 2020. Incorporating temporal information in entailment graph mining. In Proceedings of the Graph- based Methods for Natural Language Processing (TextGraphs), pages 60-71.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "CCGbank: A corpus of CCG derivations and dependency structures extracted from the Penn Treebank",
"authors": [
{
"first": "Julia",
"middle": [],
"last": "Hockenmaier",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 2007,
"venue": "Computational Linguistics",
"volume": "33",
"issue": "3",
"pages": "355--396",
"other_ids": {
"DOI": [
"10.1162/coli.2007.33.3.355"
]
},
"num": null,
"urls": [],
"raw_text": "Julia Hockenmaier and Mark Steedman. 2007. CCG- bank: A corpus of CCG derivations and dependency structures extracted from the Penn Treebank. Com- putational Linguistics, 33(3):355-396.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "A Natural History of Negation",
"authors": [
{
"first": "Laurence",
"middle": [],
"last": "Horn",
"suffix": ""
}
],
"year": 1989,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Laurence Horn. 1989. A Natural History of Negation. University of Chicago Press.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Learning typed entailment graphs with global soft constraints. Transactions of the Association for",
"authors": [
{
"first": "Mohammad Javad",
"middle": [],
"last": "Hosseini",
"suffix": ""
},
{
"first": "Nathanael",
"middle": [],
"last": "Chambers",
"suffix": ""
},
{
"first": "Siva",
"middle": [],
"last": "Reddy",
"suffix": ""
},
{
"first": "Xavier",
"middle": [
"R"
],
"last": "Holt",
"suffix": ""
},
{
"first": "Shay",
"middle": [
"B"
],
"last": "Cohen",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Johnson",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 2018,
"venue": "Computational Linguistics",
"volume": "6",
"issue": "",
"pages": "703--717",
"other_ids": {
"DOI": [
"10.1162/tacl_a_00250"
]
},
"num": null,
"urls": [],
"raw_text": "Mohammad Javad Hosseini, Nathanael Chambers, Siva Reddy, Xavier R. Holt, Shay B. Cohen, Mark John- son, and Mark Steedman. 2018. Learning typed en- tailment graphs with global soft constraints. Trans- actions of the Association for Computational Lin- guistics, 6:703-717.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "A review corpus annotated for negation, speculation and their scope",
"authors": [
{
"first": "Natalia",
"middle": [],
"last": "Konstantinova",
"suffix": ""
},
{
"first": "C",
"middle": [
"M"
],
"last": "Sheila",
"suffix": ""
},
{
"first": "Noa",
"middle": [
"P"
],
"last": "De Sousa",
"suffix": ""
},
{
"first": "Manuel",
"middle": [
"J"
],
"last": "Cruz",
"suffix": ""
},
{
"first": "Maite",
"middle": [],
"last": "Ma\u00f1a",
"suffix": ""
},
{
"first": "Ruslan",
"middle": [],
"last": "Taboada",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Mitkov",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the Eighth International Conference on Language Resources and Evaluation (LREC'12)",
"volume": "",
"issue": "",
"pages": "3190--3195",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Natalia Konstantinova, Sheila C.M. de Sousa, Noa P. Cruz, Manuel J. Ma\u00f1a, Maite Taboada, and Rus- lan Mitkov. 2012. A review corpus annotated for negation, speculation and their scope. In Proceed- ings of the Eighth International Conference on Lan- guage Resources and Evaluation (LREC'12), pages 3190-3195, Istanbul, Turkey. European Language Resources Association (ELRA).",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Partition and revision: The semantics of counterfactuals",
"authors": [
{
"first": "Angelika",
"middle": [],
"last": "Kratzer",
"suffix": ""
}
],
"year": 1981,
"venue": "Journal of Philosophical Logic",
"volume": "10",
"issue": "2",
"pages": "201--216",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Angelika Kratzer. 1981. Partition and revision: The semantics of counterfactuals. Journal of Philosophi- cal Logic, 10(2):201-216.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Modals and conditionals: New and revised perspectives",
"authors": [
{
"first": "Angelika",
"middle": [],
"last": "Kratzer",
"suffix": ""
}
],
"year": 2012,
"venue": "",
"volume": "36",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Angelika Kratzer. 2012. Modals and conditionals: New and revised perspectives, volume 36. Oxford University Press.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "An approach for detecting modality and negation in texts by using rule-based techniques",
"authors": [
{
"first": "Paloma",
"middle": [
"Mart\u00ednez"
],
"last": "Fern\u00e1ndez",
"suffix": ""
},
{
"first": "Antonio",
"middle": [],
"last": "Moreno-Sandoval",
"suffix": ""
},
{
"first": "Leonardo",
"middle": [
"Campillos"
],
"last": "Llanos",
"suffix": ""
}
],
"year": 2012,
"venue": "CLEF 2012 Evaluation Labs and Workshop, Online Working Notes",
"volume": "1178",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Paloma Mart\u00ednez Fern\u00e1ndez, Antonio Moreno- Sandoval, and Leonardo Campillos Llanos. 2012. An approach for detecting modality and negation in texts by using rule-based techniques. In CLEF 2012 Evaluation Labs and Workshop, Online Working Notes, Rome, Italy, September 17-20, 2012, volume 1178 of CEUR Workshop Proceedings. CEUR-WS.org.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Counterfactuals and comparative possibility",
"authors": [
{
"first": "David",
"middle": [],
"last": "Lewis",
"suffix": ""
}
],
"year": 1973,
"venue": "Journal of Philosophical Logic",
"volume": "",
"issue": "",
"pages": "418--446",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Lewis. 1973. Counterfactuals and comparative possibility. Journal of Philosophical Logic, pages 418-446.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Fine-grained entity recognition",
"authors": [
{
"first": "Xiao",
"middle": [],
"last": "Ling",
"suffix": ""
},
{
"first": "Daniel",
"middle": [
"S"
],
"last": "Weld",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the Twenty-Sixth AAAI Conference on Artificial Intelligence, AAAI'12",
"volume": "",
"issue": "",
"pages": "94--100",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xiao Ling and Daniel S. Weld. 2012. Fine-grained entity recognition. In Proceedings of the Twenty- Sixth AAAI Conference on Artificial Intelligence, AAAI'12, page 94-100. AAAI Press.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "The Stanford CoreNLP natural language processing toolkit",
"authors": [
{
"first": "Christopher",
"middle": [],
"last": "Manning",
"suffix": ""
},
{
"first": "Mihai",
"middle": [],
"last": "Surdeanu",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Bauer",
"suffix": ""
},
{
"first": "Jenny",
"middle": [],
"last": "Finkel",
"suffix": ""
},
{
"first": "Steven",
"middle": [],
"last": "Bethard",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Mcclosky",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of 52nd Annual Meeting of the Association for Computational Linguistics: System Demonstrations",
"volume": "",
"issue": "",
"pages": "55--60",
"other_ids": {
"DOI": [
"10.3115/v1/P14-5010"
]
},
"num": null,
"urls": [],
"raw_text": "Christopher Manning, Mihai Surdeanu, John Bauer, Jenny Finkel, Steven Bethard, and David McClosky. 2014. The Stanford CoreNLP natural language pro- cessing toolkit. In Proceedings of 52nd Annual Meeting of the Association for Computational Lin- guistics: System Demonstrations, pages 55-60, Bal- timore, Maryland. Association for Computational Linguistics.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Open language learning for information extraction",
"authors": [
{
"first": "Michael",
"middle": [],
"last": "Mausam",
"suffix": ""
},
{
"first": "Stephen",
"middle": [],
"last": "Schmitz",
"suffix": ""
},
{
"first": "Robert",
"middle": [],
"last": "Soderland",
"suffix": ""
},
{
"first": "Oren",
"middle": [],
"last": "Bart",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Etzioni",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning",
"volume": "",
"issue": "",
"pages": "523--534",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mausam, Michael Schmitz, Stephen Soderland, Robert Bart, and Oren Etzioni. 2012. Open language learn- ing for information extraction. In Proceedings of the 2012 Joint Conference on Empirical Methods in Nat- ural Language Processing and Computational Natu- ral Language Learning, pages 523-534, Jeju Island, Korea. Association for Computational Linguistics.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Propositional attitude reports",
"authors": [
{
"first": "Thomas",
"middle": [],
"last": "Mckay",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Nelson",
"suffix": ""
}
],
"year": 2000,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thomas McKay and Michael Nelson. 2000. Proposi- tional attitude reports.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Learning negation scope from syntactic structure",
"authors": [
{
"first": "Nick",
"middle": [],
"last": "Mckenna",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the Ninth Joint Conference on Lexical and Computational Semantics",
"volume": "",
"issue": "",
"pages": "137--142",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nick McKenna and Mark Steedman. 2020. Learning negation scope from syntactic structure. In Proceed- ings of the Ninth Joint Conference on Lexical and Computational Semantics, pages 137-142.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Effectiveness and efficiency of open relation extraction",
"authors": [
{
"first": "Filipe",
"middle": [],
"last": "Mesquita",
"suffix": ""
},
{
"first": "Jordan",
"middle": [],
"last": "Schmidek",
"suffix": ""
},
{
"first": "Denilson",
"middle": [],
"last": "Barbosa",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "447--457",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Filipe Mesquita, Jordan Schmidek, and Denilson Bar- bosa. 2013. Effectiveness and efficiency of open relation extraction. In Proceedings of the 2013 Conference on Empirical Methods in Natural Lan- guage Processing, pages 447-457, Seattle, Washing- ton, USA. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Wordnet: a lexical database for english",
"authors": [
{
"first": "A",
"middle": [],
"last": "George",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Miller",
"suffix": ""
}
],
"year": 1995,
"venue": "Communications of the ACM",
"volume": "38",
"issue": "11",
"pages": "39--41",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "George A Miller. 1995. Wordnet: a lexical database for english. Communications of the ACM, 38(11):39- 41.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Annotating modality and negation for a machine reading evaluation",
"authors": [
{
"first": "Roser",
"middle": [],
"last": "Morante",
"suffix": ""
},
{
"first": "Walter",
"middle": [],
"last": "Daelemans",
"suffix": ""
}
],
"year": 2012,
"venue": "CLEF 2012 Evaluation Labs and Workshop, Online Working Notes",
"volume": "1178",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Roser Morante and Walter Daelemans. 2012. Anno- tating modality and negation for a machine read- ing evaluation. In CLEF 2012 Evaluation Labs and Workshop, Online Working Notes, Rome, Italy, September 17-20, 2012, volume 1178 of CEUR Workshop Proceedings. CEUR-WS.org.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Aida-light: Highthroughput named-entity disambiguation",
"authors": [
{
"first": "Johannes",
"middle": [],
"last": "Dat Ba Nguyen",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Hoffart",
"suffix": ""
},
{
"first": "Gerhard",
"middle": [],
"last": "Theobald",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Weikum",
"suffix": ""
}
],
"year": 2014,
"venue": "Workshop on Linked Data on the Web",
"volume": "1184",
"issue": "",
"pages": "1--10",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dat Ba Nguyen, Johannes Hoffart, Martin Theobald, and Gerhard Weikum. 2014. Aida-light: High- throughput named-entity disambiguation. Workshop on Linked Data on the Web, 1184:1-10.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Association for Computational Linguistics",
"authors": [
{
"first": "Christina",
"middle": [],
"last": "Niklaus",
"suffix": ""
},
{
"first": "Matthias",
"middle": [],
"last": "Cetto",
"suffix": ""
},
{
"first": "Andr\u00e9",
"middle": [],
"last": "Freitas",
"suffix": ""
},
{
"first": "Siegfried",
"middle": [],
"last": "Handschuh",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 27th International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "3866--3878",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Christina Niklaus, Matthias Cetto, Andr\u00e9 Freitas, and Siegfried Handschuh. 2018. A survey on open infor- mation extraction. In Proceedings of the 27th Inter- national Conference on Computational Linguistics, pages 3866-3878, Santa Fe, New Mexico, USA. As- sociation for Computational Linguistics.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "An automatic system for modality and negation detection",
"authors": [
{
"first": "Partha",
"middle": [],
"last": "Pakray",
"suffix": ""
},
{
"first": "Pinaki",
"middle": [],
"last": "Bhaskar",
"suffix": ""
},
{
"first": "Somnath",
"middle": [],
"last": "Banerjee",
"suffix": ""
},
{
"first": "Sivaji",
"middle": [],
"last": "Bandyopadhyay",
"suffix": ""
},
{
"first": "Alexander",
"middle": [
"F"
],
"last": "Gelbukh",
"suffix": ""
}
],
"year": 2012,
"venue": "CLEF 2012 Evaluation Labs and Workshop, Online Working Notes",
"volume": "1178",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Partha Pakray, Pinaki Bhaskar, Somnath Banerjee, Sivaji Bandyopadhyay, and Alexander F. Gelbukh. 2012. An automatic system for modality and nega- tion detection. In CLEF 2012 Evaluation Labs and Workshop, Online Working Notes, Rome, Italy, September 17-20, 2012, volume 1178 of CEUR Workshop Proceedings. CEUR-WS.org.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "Overview of qa4mre at clef 2011: Question answering for machine reading evaluation",
"authors": [
{
"first": "Anselmo",
"middle": [],
"last": "Pe\u00f1as",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Eduard",
"suffix": ""
},
{
"first": "Pamela",
"middle": [],
"last": "Hovy",
"suffix": ""
},
{
"first": "Alvaro",
"middle": [],
"last": "Forner",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Rodrigo",
"suffix": ""
},
{
"first": "F",
"middle": [
"E"
],
"last": "Richard",
"suffix": ""
},
{
"first": "Corina",
"middle": [],
"last": "Sutcliffe",
"suffix": ""
},
{
"first": "Caroline",
"middle": [],
"last": "Forascu",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Sporleder",
"suffix": ""
}
],
"year": 2011,
"venue": "CLEF (Notebook Papers/Labs/Workshop)",
"volume": "",
"issue": "",
"pages": "1--20",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Anselmo Pe\u00f1as, Eduard H Hovy, Pamela Forner, Alvaro Rodrigo, Richard FE Sutcliffe, Corina Forascu, and Caroline Sporleder. 2011. Overview of qa4mre at clef 2011: Question answering for ma- chine reading evaluation. In CLEF (Notebook Pa- pers/Labs/Workshop), pages 1-20. Citeseer.",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"title": "Negbio: a high-performance tool for negation and uncertainty detection in radiology reports",
"authors": [
{
"first": "Yifan",
"middle": [],
"last": "Peng",
"suffix": ""
},
{
"first": "Xiaosong",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Le",
"middle": [],
"last": "Lu",
"suffix": ""
},
{
"first": "Mohammadhadi",
"middle": [],
"last": "Bagheri",
"suffix": ""
},
{
"first": "Ronald",
"middle": [],
"last": "Summers",
"suffix": ""
},
{
"first": "Zhiyong",
"middle": [],
"last": "Lu",
"suffix": ""
}
],
"year": 2018,
"venue": "AMIA Summits on Translational Science Proceedings",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yifan Peng, Xiaosong Wang, Le Lu, Mohammad- hadi Bagheri, Ronald Summers, and Zhiyong Lu. 2018. Negbio: a high-performance tool for nega- tion and uncertainty detection in radiology reports. AMIA Summits on Translational Science Proceed- ings, 2018:188.",
"links": null
},
"BIBREF38": {
"ref_id": "b38",
"title": "Statistical modality tagging from rule-based annotations and crowdsourcing",
"authors": [
{
"first": "Michael",
"middle": [],
"last": "Vinodkumar Prabhakaran",
"suffix": ""
},
{
"first": "Mona",
"middle": [],
"last": "Bloodgood",
"suffix": ""
},
{
"first": "Bonnie",
"middle": [],
"last": "Diab",
"suffix": ""
},
{
"first": "Lori",
"middle": [],
"last": "Dorr",
"suffix": ""
},
{
"first": "Christine",
"middle": [
"D"
],
"last": "Levin",
"suffix": ""
},
{
"first": "Owen",
"middle": [],
"last": "Piatko",
"suffix": ""
},
{
"first": "Benjamin",
"middle": [],
"last": "Rambow",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Van Durme",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the Workshop on Extra-Propositional Aspects of Meaning in Computational Linguistics",
"volume": "",
"issue": "",
"pages": "57--64",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Vinodkumar Prabhakaran, Michael Bloodgood, Mona Diab, Bonnie Dorr, Lori Levin, Christine D. Piatko, Owen Rambow, and Benjamin Van Durme. 2012. Statistical modality tagging from rule-based anno- tations and crowdsourcing. In Proceedings of the Workshop on Extra-Propositional Aspects of Mean- ing in Computational Linguistics, pages 57-64, Jeju, Republic of Korea. Association for Computational Linguistics.",
"links": null
},
"BIBREF39": {
"ref_id": "b39",
"title": "Adapting a lexicalized-grammar parser to contrasting domains",
"authors": [
{
"first": "Laura",
"middle": [],
"last": "Rimell",
"suffix": ""
},
{
"first": "Stephen",
"middle": [],
"last": "Clark",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "475--484",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Laura Rimell and Stephen Clark. 2008. Adapting a lexicalized-grammar parser to contrasting domains. In Proceedings of the 2008 Conference on Empiri- cal Methods in Natural Language Processing, pages 475-484, Honolulu, Hawaii. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF40": {
"ref_id": "b40",
"title": "CLaC Labs: Processing modality and negation. working notes for QA4MRE pilot task at CLEF 2012",
"authors": [
{
"first": "Sabine",
"middle": [],
"last": "Rosenberg",
"suffix": ""
},
{
"first": "Halil",
"middle": [],
"last": "Kilicoglu",
"suffix": ""
},
{
"first": "Sabine",
"middle": [],
"last": "Bergler",
"suffix": ""
}
],
"year": 2012,
"venue": "CLEF (Online Working Notes/Labs/Workshop), volume 1178 of CEUR Workshop Proceedings",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sabine Rosenberg, Halil Kilicoglu, and Sabine Bergler. 2012. CLaC Labs: Processing modality and negation. working notes for QA4MRE pilot task at CLEF 2012. In CLEF (Online Working Notes/Labs/Workshop), volume 1178 of CEUR Workshop Proceedings. CEUR-WS.org.",
"links": null
},
"BIBREF41": {
"ref_id": "b41",
"title": "Annotating and recognizing event modality in text",
"authors": [
{
"first": "Roser",
"middle": [],
"last": "Saur\u0131",
"suffix": ""
},
{
"first": "Marc",
"middle": [],
"last": "Verhagen",
"suffix": ""
},
{
"first": "James",
"middle": [],
"last": "Pustejovsky",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of 19th International FLAIRS Conference",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Roser Saur\u0131, Marc Verhagen, and James Pustejovsky. 2006. Annotating and recognizing event modality in text. In Proceedings of 19th International FLAIRS Conference.",
"links": null
},
"BIBREF42": {
"ref_id": "b42",
"title": "Detecting arguing and sentiment in meetings",
"authors": [
{
"first": "Swapna",
"middle": [],
"last": "Somasundaran",
"suffix": ""
},
{
"first": "Josef",
"middle": [],
"last": "Ruppenhofer",
"suffix": ""
},
{
"first": "Janyce",
"middle": [],
"last": "Wiebe",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 8th SIGdial Workshop on Discourse and Dialogue",
"volume": "",
"issue": "",
"pages": "26--34",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Swapna Somasundaran, Josef Ruppenhofer, and Janyce Wiebe. 2007. Detecting arguing and sentiment in meetings. In Proceedings of the 8th SIGdial Work- shop on Discourse and Dialogue, pages 26-34.",
"links": null
},
"BIBREF43": {
"ref_id": "b43",
"title": "CCG parsing algorithm with incremental tree rotation",
"authors": [
{
"first": "Milo\u0161",
"middle": [],
"last": "Stanojevi\u0107",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"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": "228--239",
"other_ids": {
"DOI": [
"10.18653/v1/N19-1020"
]
},
"num": null,
"urls": [],
"raw_text": "Milo\u0161 Stanojevi\u0107 and Mark Steedman. 2019. CCG parsing algorithm with incremental tree rotation. In Proceedings of the 2019 Conference of the North American Chapter of the Association for Computa- tional Linguistics: Human Language Technologies, Volume 1 (Long and Short Papers), pages 228-239, Minneapolis, Minnesota. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF44": {
"ref_id": "b44",
"title": "Crossgenre and cross-domain detection of semantic uncertainty",
"authors": [
{
"first": "Gy\u00f6rgy",
"middle": [],
"last": "Szarvas",
"suffix": ""
},
{
"first": "Veronika",
"middle": [],
"last": "Vincze",
"suffix": ""
},
{
"first": "Rich\u00e1rd",
"middle": [],
"last": "Farkas",
"suffix": ""
},
{
"first": "Gy\u00f6rgy",
"middle": [],
"last": "M\u00f3ra",
"suffix": ""
},
{
"first": "Iryna",
"middle": [],
"last": "Gurevych",
"suffix": ""
}
],
"year": 2012,
"venue": "Computational Linguistics",
"volume": "38",
"issue": "2",
"pages": "335--367",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gy\u00f6rgy Szarvas, Veronika Vincze, Rich\u00e1rd Farkas, Gy\u00f6rgy M\u00f3ra, and Iryna Gurevych. 2012. Cross- genre and cross-domain detection of semantic uncer- tainty. Computational Linguistics, 38(2):335-367.",
"links": null
},
"BIBREF45": {
"ref_id": "b45",
"title": "Learning entailment rules for unary templates",
"authors": [
{
"first": "Idan",
"middle": [],
"last": "Szpektor",
"suffix": ""
},
{
"first": "Ido",
"middle": [],
"last": "Dagan",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the 22nd International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "849--856",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Idan Szpektor and Ido Dagan. 2008. Learning en- tailment rules for unary templates. In Proceedings of the 22nd International Conference on Compu- tational Linguistics (Coling 2008), pages 849-856, Manchester, UK. Coling 2008 Organizing Commit- tee.",
"links": null
},
"BIBREF46": {
"ref_id": "b46",
"title": "Enriching a biomedical event corpus with meta-knowledge annotation",
"authors": [
{
"first": "P",
"middle": [],
"last": "Thompson",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Nawaz",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Mcnaught",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Ananiadou",
"suffix": ""
}
],
"year": 2011,
"venue": "BMC Bioinformatics",
"volume": "12",
"issue": "",
"pages": "",
"other_ids": {
"DOI": [
"10.1186/1471-2105-12-393"
]
},
"num": null,
"urls": [],
"raw_text": "P. Thompson, R. Nawaz, J. McNaught, and S. Anani- adou. 2011. Enriching a biomedical event corpus with meta-knowledge annotation. BMC Bioinfor- matics, 12:393.",
"links": null
},
"BIBREF47": {
"ref_id": "b47",
"title": "Open information extraction using Wikipedia",
"authors": [
{
"first": "Fei",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Daniel",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Weld",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "118--127",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fei Wu and Daniel S. Weld. 2010. Open information extraction using Wikipedia. In Proceedings of the 48th Annual Meeting of the Association for Compu- tational Linguistics, pages 118-127, Uppsala, Swe- den. Association for Computational Linguistics.",
"links": null
},
"BIBREF48": {
"ref_id": "b48",
"title": "Automatic generation of high quality CCGbanks for parser domain adaptation",
"authors": [
{
"first": "Masashi",
"middle": [],
"last": "Yoshikawa",
"suffix": ""
},
{
"first": "Hiroshi",
"middle": [],
"last": "Noji",
"suffix": ""
},
{
"first": "Koji",
"middle": [],
"last": "Mineshima",
"suffix": ""
},
{
"first": "Daisuke",
"middle": [],
"last": "Bekki",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "129--139",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1013"
]
},
"num": null,
"urls": [],
"raw_text": "Masashi Yoshikawa, Hiroshi Noji, Koji Mineshima, and Daisuke Bekki. 2019. Automatic generation of high quality CCGbanks for parser domain adap- tation. In Proceedings of the 57th Annual Meet- ing of the Association for Computational Linguis- tics, pages 129-139, Florence, Italy. Association for Computational Linguistics.",
"links": null
},
"BIBREF49": {
"ref_id": "b49",
"title": "Harvesting parallel news streams to generate paraphrases of event relations",
"authors": [
{
"first": "Congle",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Daniel S Weld",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1776--1786",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Congle Zhang and Daniel S Weld. 2013. Harvest- ing parallel news streams to generate paraphrases of event relations. In Proceedings of the 2013 Con- ference on Empirical Methods in Natural Language Processing, pages 1776-1786.",
"links": null
},
"BIBREF50": {
"ref_id": "b50",
"title": "Temporal common sense acquisition with minimal supervision",
"authors": [
{
"first": "Ben",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Qiang",
"middle": [],
"last": "Ning",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Khashabi",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Roth",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "7579--7589",
"other_ids": {
"DOI": [
"10.18653/v1/2020.acl-main.678"
]
},
"num": null,
"urls": [],
"raw_text": "Ben Zhou, Qiang Ning, Daniel Khashabi, and Dan Roth. 2020. Temporal common sense acquisition with minimal supervision. In Proceedings of the 58th Annual Meeting of the Association for Compu- tational Linguistics, pages 7579-7589, Online. As- sociation for Computational Linguistics.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"type_str": "figure",
"text": "CCG parse tree for Johnson doubts that Labour will win the election CCG dependency graph for Johnson doubts that Labour will win the election; marked paths from doubts (blue, dotted) and will (orange, solid) to win.",
"num": null,
"uris": null
},
"TABREF0": {
"html": null,
"content": "<table><tr><td>Category</td><td>Example</td></tr><tr><td>\u2205</td><td/></tr></table>",
"num": null,
"text": "Protesters attacked the police Negation Protesters did not attack the police Lexical negation Protesters refrained from attacking the police Modal operator Protesters may have attacked the police Conditional",
"type_str": "table"
},
"TABREF1": {
"html": null,
"content": "<table><tr><td>2 Background</td></tr><tr><td>2.1 Semantic Phenomena</td></tr></table>",
"num": null,
"text": "Modality and negation categories",
"type_str": "table"
},
"TABREF3": {
"html": null,
"content": "<table/>",
"num": null,
"text": "Example lexicon entries",
"type_str": "table"
},
"TABREF5": {
"html": null,
"content": "<table><tr><td>MONTEE</td><td>OpenIE</td><td>OLLIE</td></tr><tr><td>MOD (guerrillas; talk; Soviets)</td><td>(guerrillas; are; ready)</td><td>(Moscow; is; willing)</td></tr><tr><td>COND (Moscow; be willing)</td><td>(guerrillas; talk with; Soviets)</td><td/></tr><tr><td/><td>(guerrillas; talk; if Moscow is willing)</td><td/></tr><tr><td/><td>(guerrillas; talk; willing)</td><td/></tr><tr><td/><td>(Moscow; is; if Moscow is willing)</td><td/></tr><tr><td/><td>(Moscow; is; willing)</td><td/></tr><tr><td colspan=\"2\">Had Trump won the election, Cummings would still be in Downing Street.</td><td/></tr><tr><td>COUNT (Trump; win; election)</td><td>(Trump; Had Trump won; election)</td><td>(Trump; Had won; the election)</td></tr><tr><td>MOD (Cummings; be in; D.St.)</td><td colspan=\"2\">(Cummings; would; would still be in D.St.) (Cummings; would still be in; D.St.)</td></tr><tr><td>Protesters did not attack the Police.</td><td/><td/></tr><tr><td>NEG (Protesters; attack; police)</td><td>\u2205</td><td>(Protesters; did not attack; the police)</td></tr><tr><td colspan=\"2\">Parliament failed to investigate the Kremlin.</td><td/></tr><tr><td colspan=\"2\">(Parliament; failed to investigate; Kremlin) (Parliament; investigate; Kremlin)</td><td>(Parliament; failed to investigate; the Kremlin)</td></tr><tr><td>LNEG (Parliament.; investigate; Kremlin)</td><td/><td>(Parliament; to investigate; the Kremlin)</td></tr><tr><td colspan=\"2\">Ed Miliband says the government betrayed Yorkshire.</td><td/></tr><tr><td colspan=\"2\">ATT SAY (government; betray; Yorkshire) \u2205</td><td>(the government; betrayed; Yorkshire)</td></tr><tr><td>(Ed-Miliband; say)</td><td/><td>[attrib=Ed Miliband says]</td></tr></table>",
"num": null,
"text": "The guerrillas are ready to talk with the Soviets, if Moscow is willing.",
"type_str": "table"
},
"TABREF6": {
"html": null,
"content": "<table/>",
"num": null,
"text": "",
"type_str": "table"
},
"TABREF8": {
"html": null,
"content": "<table/>",
"num": null,
"text": "Intrinsic evaluation results",
"type_str": "table"
},
"TABREF10": {
"html": null,
"content": "<table/>",
"num": null,
"text": "Relation tagging summary by news domain entity linker AIDA",
"type_str": "table"
}
}
}
} |