File size: 103,094 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 |
{
"paper_id": "2021",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T07:13:15.018877Z"
},
"title": "Blindness to Modality Helps Entailment Graph Mining",
"authors": [
{
"first": "Liane",
"middle": [],
"last": "Guillou",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Edinburgh",
"location": {}
},
"email": "liane.guillou@ed.ac.uk"
},
{
"first": "Sander",
"middle": [],
"last": "Bijl De Vroe",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Edinburgh",
"location": {}
},
"email": ""
},
{
"first": "Mark",
"middle": [],
"last": "Johnson",
"suffix": "",
"affiliation": {},
"email": "mark.mj.johnson@oracle.com"
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Edinburgh",
"location": {}
},
"email": "steedman@inf.ed.ac.uk"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Understanding linguistic modality is widely seen as important for downstream tasks such as Question Answering and Knowledge Graph Population. Entailment Graph learning might also be expected to benefit from attention to modality. We build Entailment Graphs using a news corpus filtered with a modality parser, and show that stripping modal modifiers from predicates in fact increases performance. This suggests that for some tasks, the pragmatics of modal modification of predicates allows them to contribute as evidence of entailment.",
"pdf_parse": {
"paper_id": "2021",
"_pdf_hash": "",
"abstract": [
{
"text": "Understanding linguistic modality is widely seen as important for downstream tasks such as Question Answering and Knowledge Graph Population. Entailment Graph learning might also be expected to benefit from attention to modality. We build Entailment Graphs using a news corpus filtered with a modality parser, and show that stripping modal modifiers from predicates in fact increases performance. This suggests that for some tasks, the pragmatics of modal modification of predicates allows them to contribute as evidence of entailment.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "The ability to recognise textual entailment and paraphrase is crucial in many downstream tasks, including Open Domain Question Answering from text. For example, if we pose the question \"Did Joe Biden run for President?\" and the text states that \"Joe Biden was elected President\", producing the correct answer (Yes) necessitates understanding that being elected President entails running for President 1 .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Entailment Graphs, constructed via unsupervised learning techniques over large text corpora, provide a solution to this problem. They consist of nodes representing predicates and directed edges representing entailment relations between them. Given the importance of detecting uncertainty for other downstream NLP tasks such as Information Extraction (Karttunen and Zaenen, 2005; Farkas et al., 2010) , Information Retrieval (Vincze, 2014) , machine reading (Morante and Daelemans, 2012a) , and Question Answering (Jean et al., 2016) one might expect that it would also be useful in learning Entailment Graphs. That is, they would be more reliable if learned from data in which predications * Equal contribution 1 Assuming a democratic election. We use the typical definition of the premise most likely entailing the hypothesis (Dagan et al., 2006) are asserted as actually happening, rather than data with uncertain predications under scope of various types of modality. We investigate whether this is the case.",
"cite_spans": [
{
"start": 350,
"end": 378,
"text": "(Karttunen and Zaenen, 2005;",
"ref_id": "BIBREF17"
},
{
"start": 379,
"end": 399,
"text": "Farkas et al., 2010)",
"ref_id": "BIBREF11"
},
{
"start": 424,
"end": 438,
"text": "(Vincze, 2014)",
"ref_id": "BIBREF38"
},
{
"start": 457,
"end": 487,
"text": "(Morante and Daelemans, 2012a)",
"ref_id": "BIBREF27"
},
{
"start": 513,
"end": 532,
"text": "(Jean et al., 2016)",
"ref_id": "BIBREF16"
},
{
"start": 827,
"end": 847,
"text": "(Dagan et al., 2006)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The Entailment Graph-learning algorithm depends on descriptions of eventualities in the news, observing directional co-occurrences of typed predicates and their arguments. For example, we expect to observe all the arguments of being president, such as Biden and Obama, also to be encountered in a sufficiently large multiply-sourced body of text as arguments of running for president, but not the other way around (Hillary Clinton will run but not be president). However, if all the reports of Clinton might be president are extracted as be_president(Clinton), one might expect the learning signal to be confusing to the algorithm.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We use the method of Hosseini et al. (2018) combined with a modality parser (Bijl de Vroe et al., 2021) to construct typed Entailment Graphs from raw text corpora under two different settings. Modality-aware: modal predications are removed from the data entirely, and modality-unaware: the model learns from both asserted and modal predications. Our contributions are 1) a comparison of Entailment Graphs learned from modal and nonmodal data, showing (counterintuitively) that ignoring modal distinctions in fact improves Entailment Graph-learning, and 2) insights as to whether this effect applies uniformly across different subdomains.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Entailment rules specify directional inferences between linguistic predicates (Szpektor and Dagan, 2008) , and can be stored in an Entailment Graph, whose global structural properties can be used to learn more accurately (Berant et al., 2011 (Berant et al., , 2015 . They are defined as a directed graph G = {N, E}, in which the nodes N are typed predicates and edges E represent the entailment relation. The lex- If protesters attack the police...",
"cite_spans": [
{
"start": 78,
"end": 104,
"text": "(Szpektor and Dagan, 2008)",
"ref_id": "BIBREF37"
},
{
"start": 221,
"end": 241,
"text": "(Berant et al., 2011",
"ref_id": "BIBREF3"
},
{
"start": 242,
"end": 264,
"text": "(Berant et al., , 2015",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Background",
"sec_num": "2"
},
{
"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 (Eichler et al., 2014) , relation extraction (Eichler et al., 2017) and link prediction (Hosseini et al., 2019) . A subgraph containing predicates of a type-pair (e.g. PERSON-LOCATION) can be learned in an unsupervised way from collections of multiplysourced text. A vector of argument-pair counts for every predicate is first machine read from the corpus. Typically, relation extraction systems used for reading these corpora ignore modal modifiers, possibly introducing noise in the graph. Next, a (directed) similarity score (e.g. DIRT (Lin and Pantel, 2001 ), Weed's score (Weeds and Weir, 2003) or BInc (Szpektor and Dagan, 2008) ) is computed between the vectors, producing a local entailment score between each predicate pair. Then a globalisation process such as the soft constraints algorithm of Hosseini et al. (2018) , which transfers information both within and between type-pair subgraphs, can be used to refine these local scores. When using the graph in practice, all edges with a score above a chosen threshold can be considered an entailment.",
"cite_spans": [
{
"start": 62,
"end": 84,
"text": "(Eichler et al., 2014)",
"ref_id": "BIBREF9"
},
{
"start": 107,
"end": 129,
"text": "(Eichler et al., 2017)",
"ref_id": "BIBREF10"
},
{
"start": 150,
"end": 173,
"text": "(Hosseini et al., 2019)",
"ref_id": "BIBREF15"
},
{
"start": 601,
"end": 622,
"text": "(Lin and Pantel, 2001",
"ref_id": "BIBREF22"
},
{
"start": 639,
"end": 661,
"text": "(Weeds and Weir, 2003)",
"ref_id": "BIBREF39"
},
{
"start": 670,
"end": 696,
"text": "(Szpektor and Dagan, 2008)",
"ref_id": "BIBREF37"
},
{
"start": 867,
"end": 889,
"text": "Hosseini et al. (2018)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Propositional",
"sec_num": null
},
{
"text": "There are various semantic phenomena a speaker can use to mark veridicality (see Table 1 ). Modal operators, e.g. probably, might, should, need to, allow the user to indicate their attitude beyond the propositional content of a phrase, and often don't entail that the eventuality occurs (Kratzer, 2012) . The same holds for predications under scope of conditionals and counterfactuals (Dancygier, 1998; Lewis, 1973) . Propositional attitude, indicated by verbs such as say, imagine or want, allows the speaker to attribute thoughts regarding some possible eventuality to a source (Nelson, 2019) .",
"cite_spans": [
{
"start": 287,
"end": 302,
"text": "(Kratzer, 2012)",
"ref_id": "BIBREF19"
},
{
"start": 385,
"end": 402,
"text": "(Dancygier, 1998;",
"ref_id": "BIBREF7"
},
{
"start": 403,
"end": 415,
"text": "Lewis, 1973)",
"ref_id": "BIBREF21"
},
{
"start": 580,
"end": 594,
"text": "(Nelson, 2019)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [
{
"start": 81,
"end": 88,
"text": "Table 1",
"ref_id": "TABREF0"
}
],
"eq_spans": [],
"section": "Propositional",
"sec_num": null
},
{
"text": "These phenomena have been investigated for various NLP tasks, including uncertainty detection (Vincze, 2014) , hedge detection (Medlock and Briscoe, 2007) and modality annotation (Saur\u0131 et al., 2006) . Capturing this information is valuable to tasks such as Information Extraction, Question Answering and Knowledge Base Population (Karttunen and Zaenen, 2005; Morante and Daelemans, 2012b) .",
"cite_spans": [
{
"start": 94,
"end": 108,
"text": "(Vincze, 2014)",
"ref_id": "BIBREF38"
},
{
"start": 127,
"end": 154,
"text": "(Medlock and Briscoe, 2007)",
"ref_id": "BIBREF25"
},
{
"start": 179,
"end": 199,
"text": "(Saur\u0131 et al., 2006)",
"ref_id": "BIBREF32"
},
{
"start": 331,
"end": 359,
"text": "(Karttunen and Zaenen, 2005;",
"ref_id": "BIBREF17"
},
{
"start": 360,
"end": 389,
"text": "Morante and Daelemans, 2012b)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Propositional",
"sec_num": null
},
{
"text": "Early approaches to detecting modality focused on lexicon design (Szarvas, 2008; Kilicoglu and Bergler, 2008; Baker et al., 2010) , with later approaches using machine learning over annotated corpora (Morante and Daelemans, 2009; Rei and Briscoe, 2010; Jean et al., 2016; Adel and Sch\u00fctze, 2017) . Recently, Bijl de Vroe et al. (2021) designed a parser similar to that by Baker et al. (2010) , to cover a wider range of phenomena, including conditionality and propositional attitude. While modality annotation is clearly useful for recognising entailment from a given text (Snow et al., 2006; De Marneffe et al., 2006) , to our knowledge no research has been conducted on its effect on learning Entailment Graphs.",
"cite_spans": [
{
"start": 65,
"end": 80,
"text": "(Szarvas, 2008;",
"ref_id": "BIBREF36"
},
{
"start": 81,
"end": 109,
"text": "Kilicoglu and Bergler, 2008;",
"ref_id": "BIBREF18"
},
{
"start": 110,
"end": 129,
"text": "Baker et al., 2010)",
"ref_id": "BIBREF1"
},
{
"start": 200,
"end": 229,
"text": "(Morante and Daelemans, 2009;",
"ref_id": "BIBREF26"
},
{
"start": 230,
"end": 252,
"text": "Rei and Briscoe, 2010;",
"ref_id": "BIBREF31"
},
{
"start": 253,
"end": 271,
"text": "Jean et al., 2016;",
"ref_id": "BIBREF16"
},
{
"start": 272,
"end": 295,
"text": "Adel and Sch\u00fctze, 2017)",
"ref_id": "BIBREF0"
},
{
"start": 372,
"end": 391,
"text": "Baker et al. (2010)",
"ref_id": "BIBREF1"
},
{
"start": 573,
"end": 592,
"text": "(Snow et al., 2006;",
"ref_id": "BIBREF33"
},
{
"start": 593,
"end": 618,
"text": "De Marneffe et al., 2006)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Propositional",
"sec_num": null
},
{
"text": "We extend relation extraction to pay attention to modality, so that we can distinguish modal and nonmodal relations in the Entailment Graph mining algorithm. This allows us to investigate the impact of modalised predicate data on the accuracy of learned entailment edges.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Methods",
"sec_num": "3"
},
{
"text": "We extract binary relations of the form arg1predicate-arg2 using MONTEE, an open-domain modality-aware relation extraction system (Bijl de Vroe et al., 2021). MONTEE uses the Rotat-ingCCG parser (Stanojevi\u0107 and Steedman, 2019) as the basis for extracting binary relations and a modality lexicon to identify modality triggers. A relation is tagged as modal (MOD), propositional attitude (ATT_SAY, ATT_THINK) or conditional (COND) if the CCG dependency graph contains a path between a relation node and a node matching an entry in the MONTEE lexicon. Counterfactuals (COUNT) are tagged according to hand-crafted rules. Since we focus on uncertainty and not negation, lexical negation (LNEG) tagging is ignored.",
"cite_spans": [
{
"start": 195,
"end": 226,
"text": "(Stanojevi\u0107 and Steedman, 2019)",
"ref_id": "BIBREF35"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Methods",
"sec_num": "3"
},
{
"text": "In the modality-aware setting, we remove relations tagged by MONTEE as any kind of modal ({MOD, ATT_SAY, ATT_THINK, COUNT, COND}). In local learning, learned entailment edges then have access only to non-modal evidence: eventualities that were asserted as actually happening. For example, the edge between win and lose should now be learned only from non-modal descriptions such as A won today against B or A has been defeated by B, leaving out modal descriptions (A could beat B). The local and globalisation parts of the algorithm are otherwise unchanged.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Methods",
"sec_num": "3"
},
{
"text": "Using MONTEE 2 , we extract 40,669,812 binary relation triples from the NewsSpike corpus (Zhang and Weld, 2013) . Of these, 14.57% are tagged; 10.04% MOD, 3.51% REP_SAY, 0.38% REP_THINK, 0.61% COND, and 0.03% COUNT. We then construct three different datasets and build an Entailment Graph with each. The modalityunaware baseline, BaselineLarge, is trained on the complete set of relations with modality tags removed. This corresponds to the data and model in Hosseini et al. (2018) . For the modality-aware Asserted graph, we extract only the set of 34,744,216 asserted relations (\u223c85% of the relations), i.e. all modal relations are excluded. To rule out effects of data size, we construct BaselineSmall, which is trained on a random sample of 85% relations from the total set. Comparing Asserted to Base-lineLarge shows us whether it is worth filtering out modal data, and comparing Asserted to BaselineSmall shows whether asserted data or mixed data (i.e. asserted and modal) is more effective for learning entailment relations.",
"cite_spans": [
{
"start": 89,
"end": 111,
"text": "(Zhang and Weld, 2013)",
"ref_id": "BIBREF40"
},
{
"start": 459,
"end": 481,
"text": "Hosseini et al. (2018)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "4"
},
{
"text": "We follow the example of Hosseini et al. (2018) and construct typed graphs for all possible type pairs (e.g. PERSON-LOCATION). Relation arguments are typed by linking to a Named Entity Freebase identifier (Bollacker et al., 2008) using the AIDA-light linker (Nguyen et al., 2014) , and mapping these identifiers to a type in the FIGER hierarchy (Ling and Weld, 2012) . The typed relations become the input to the graph learning step of the Entailment Graph mining algorithm. Following previous research, we use the BInc similarity score (Szpektor and Dagan, 2008) to compute entailment scores. We first construct local typed Entailment Graphs and then globalise the scores across graphs as in Hosseini et al. (2018) .",
"cite_spans": [
{
"start": 205,
"end": 229,
"text": "(Bollacker et al., 2008)",
"ref_id": "BIBREF5"
},
{
"start": 258,
"end": 279,
"text": "(Nguyen et al., 2014)",
"ref_id": "BIBREF30"
},
{
"start": 345,
"end": 366,
"text": "(Ling and Weld, 2012)",
"ref_id": "BIBREF23"
},
{
"start": 537,
"end": 563,
"text": "(Szpektor and Dagan, 2008)",
"ref_id": "BIBREF37"
},
{
"start": 693,
"end": 715,
"text": "Hosseini et al. (2018)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "4"
},
{
"text": "We evaluate the Entailment Graphs on two datasets. The first is the Levy/Holt Entailment Dataset, a set of 18,407 entailment pairs for the general domain (Levy and Dagan, 2016; Holt, 2018) . As our training method is unsupervised and we do not tune hyperparameters, we evaluate on the complete Levy/Holt dataset rather than the dev/test split. We also evaluate on the Sports Entailment Dataset (Guillou et al., 2020) , focusing on the sub- set of 718 examples comprising entailments and pairs of match outcome predicates (e.g. win, lose, tie, and their paraphrases) which are always nonentailments. This subset evaluates whether Entailment Graphs can recognise, for example, that win/lose \u2192 play but win lose (with similar patterns for other paraphrases of win, play and lose). We focus on the subgraph of ORGANISATIONs as all predicates are assumed to apply to sports teams. Both datasets use binary labels for each premise/hypothesis pair: entailment (1) and nonentailment (0).",
"cite_spans": [
{
"start": 154,
"end": 176,
"text": "(Levy and Dagan, 2016;",
"ref_id": "BIBREF20"
},
{
"start": 177,
"end": 188,
"text": "Holt, 2018)",
"ref_id": "BIBREF13"
},
{
"start": 394,
"end": 416,
"text": "(Guillou et al., 2020)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "4"
},
{
"text": "We used the entGraph 3 code developed by Hosseini et al. (2018) to construct each of the Entailment Graphs, and the corresponding evaluation scripts 4 to evaluate performance on the Levy/Holt dataset. Performance on the Sports Entailment Dataset 5 is evaluated using scripts 6 developed for this paper. For details on hyperparameters and computational costs see Appendix A. Figures 1 and 2 respectively. Every point on the curve represents a different entailment score threshold (higher thresholds correspond to lower recall and vice versa). We follow the example of Hosseini et al. (2018) and compute AUC for precision in the range [0.5, 1]. All three Entailment Graphs cover this range and predictions with precision higher than random are important for downstream applications. On the Levy/Holt dataset (all examples), Base-lineLarge performs best overall. The strong performance of BaselineLarge compared to Asserted is in itself surprising, and indicates that it is usually not beneficial to distinguish modality when building Entailment Graphs. This can be understood as a data size issue: filtering out data is harmful as it introduces sparsity, and modal data is useful enough to provide a learning signal.",
"cite_spans": [
{
"start": 41,
"end": 63,
"text": "Hosseini et al. (2018)",
"ref_id": "BIBREF14"
},
{
"start": 567,
"end": 589,
"text": "Hosseini et al. (2018)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [
{
"start": 374,
"end": 389,
"text": "Figures 1 and 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "4"
},
{
"text": "More counterintuitive, however, is that even BaselineSmall, which controls for training dataset size, outperforms Asserted. To understand why, we measured the size of each graph in terms of the number of nodes (predicates) and edges (entailment relations) it contained, and the percentage of predicates in the Levy/Holt dataset that were present in the graph (see Table 3 ). This revealed that BaselineSmall contained more of the predicates present in the Levy/Holt dataset, while also being larger in terms of both nodes and edges than Asserted. Thus, Asserted learns with more relations per predicate, while BaselineSmall has more predicate nodes overall. This may lead to the increase in recall that we see for the BaselineSmall graph.",
"cite_spans": [],
"ref_spans": [
{
"start": 364,
"end": 371,
"text": "Table 3",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "4"
},
{
"text": "Another explanation might be that this richer predicate coverage allows BaselineSmall to accurately correlate more of the common paraphrase examples in the Levy/Holt dataset. To this end we investigated the directional portion of the Levy/Holt dataset, which contains 2,414 examples of both the entailment pair and its reverse, where the entailment is true in one direction and false in the other. As noted by Hosseini et al. (2018) this task is much harder than that represented by the original dataset. However, the baselines both outperform the Asserted graph on the directional entailment task. We also observe a similar pattern in the percentage of predicates covered (see last column in Table 3 ). In general, we conclude that modal data is useful even for learning directional entailments.",
"cite_spans": [
{
"start": 410,
"end": 432,
"text": "Hosseini et al. (2018)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [
{
"start": 693,
"end": 700,
"text": "Table 3",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "4"
},
{
"text": "Performance on the Sports Entailment dataset (Figure 2 ) reveals a different pattern. Base-lineLarge outperforms BaselineSmall as expected, but Asserted performs best, despite lower coverage of the predicates in the Sports Entailment Dataset (see Table 4 for a size comparison of the ORGANI-SATIONs subgraph). This supports the suggestion by Guillou et al. (2020) that excluding modal data may help to avoid learning entailments between disjunctive outcomes, i.e. that winning entails losing, which is not measured by the Levy/Holt dataset.",
"cite_spans": [
{
"start": 342,
"end": 363,
"text": "Guillou et al. (2020)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [
{
"start": 45,
"end": 54,
"text": "(Figure 2",
"ref_id": null
},
{
"start": 247,
"end": 254,
"text": "Table 4",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "4"
},
{
"text": "Another appealing intuition for the usefulness of modal relations is that they might generally be expressed in text when the prior probability of the main predicate is already high. This would lead the distributions for the main predicates to be improved in spite of the uncertainty of the evidence. Additionally, if the probability of a premise is high enough to be worth mentioning, then in general that of its entailments will be too. However, this may not hold for the sports scenario because the outcomes are widely speculated upon despite being highly uncertain.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion & Future Work",
"sec_num": "6"
},
{
"text": "Indeed it is easy to find examples in the news corpus to support these intuitions. In the general domain we observe examples of eventualities initially being discussed with uncertainty, and later mentioned as asserted. An example of this is the acquisition of Dell by Michael Dell: on February 5th, 2013 we observe \"... founder and CEO Michael Dell and investment firm Silver Lake Partners will buy Dell.\", and subsequently, on February 6th, 2013 we read \"So Michael Dell and a private equity group have bought Dell and taken it private.\". We also observe the reverse scenario in the sports domain. For example, on January 10th, 2013 we observe \"The popular opinion on this game seems to be Seattle beating Atlanta because...\", while shortly afterwards we are informed that \"Falcons come back to beat Seahawks\". The latter is likely rather domain-specific, and we may expect to find a similar effect for other domains that share the disjunctive outcome property, for example elections, court cases and battles, where modals are used when speculating about potential and counterfactual outcomes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion & Future Work",
"sec_num": "6"
},
{
"text": "We will explore ways to leverage this information and consider other sub-domains for which it is useful to retain or remove modal data. This may involve creating more domain-specific datasets. It is also worth investigating the effects of negation, which shares similar properties to modality, on learning Entailment Graphs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion & Future Work",
"sec_num": "6"
},
{
"text": "Relatedly, we could retain predicates under specific modal modifiers, as these correspond to different prior probabilities of eventualities, carrying a different epistemic commitment from the writer. Eventualities that happen \"undoubtedly\" might be preferred over those that are \"unlikely\", for instance, and the modality parser can output specific categories of modality, allowing us to choose the subsets that should be kept.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion & Future Work",
"sec_num": "6"
},
{
"text": "Finally, we will experiment with learning Entailment Graphs with modal predicate nodes, by retaining modal relations with tags attached as input. Many of these entailments are trivial, because any entailment of a consequence can be reproduced under modal scope (if buy \u2192 own, then also MOD_buy \u2192 MOD_own). More notably, we might recover that following an entailment in the reverse direction can produce a modal entailment (e.g. if beat \u2192 play, then we know play \u2192 MOD_beat), and many preconditions will behave interestingly (e.g. beat \u2192 play, but also MOD_beat \u2192 play).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion & Future Work",
"sec_num": "6"
},
{
"text": "To evaluate this idea, we will design a dataset of modal entailments, drawing inspiration from previous research on veridicality in entailment datasets (Stali\u016bnait\u0117, 2018) .",
"cite_spans": [
{
"start": 152,
"end": 171,
"text": "(Stali\u016bnait\u0117, 2018)",
"ref_id": "BIBREF34"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion & Future Work",
"sec_num": "6"
},
{
"text": "We have investigated the role of modally modified relations in Entailment Graph mining, and shown that, contrary to results from other tasks, uncertain predications actually constitute a valuable learning signal overall. Further analysis shows that there are specific predicate domains in which removing modal data is beneficial.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "7"
},
{
"text": "https://github.com/mjhosseini/entGraph 4 https://github.com/mjhosseini/entgraph_eval 5 https://gitlab.com/lianeg/temporal-entailment-sportsdataset 6 https://gitlab.com/lianeg/sports-entailment-evaluation",
"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 Mohammad Javad Hosseini and Nick McKenna for helpful discussions, and the reviewers for their valuable feedback.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
},
{
"text": "When using MoNTEE to extract relations we used the default settings, with the exception of disabling unary relation extraction (writeUnaryRels=False) and restricting binary relations to those that include at least one named entity (acceptGGBinary=False). When using entGraph to construct Entailment Graphs we raised the threshold values for infrequent predicates (minPredForArgPair=4) and argument pairs (minArgPairForPred=4), and used the default values for all other parameters.All experiments were conducted on a single server with 330GB RAM, and two Intel Xeon E5-2697 v4 2.3GHz CPUs (each with 18 cores). The computational cost of training a single Entailment Graph is approximately one day for the local learning step, and eight hours for globalisation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Experimental Settings / Requirements",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Exploring different dimensions of attention for uncertainty detection",
"authors": [
{
"first": "Heike",
"middle": [],
"last": "Adel",
"suffix": ""
},
{
"first": "Hinrich",
"middle": [],
"last": "Sch\u00fctze",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 15th Conference of the European Chapter of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "22--34",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Heike Adel and Hinrich Sch\u00fctze. 2017. Exploring dif- ferent dimensions of attention for uncertainty detec- tion. In Proceedings of the 15th Conference of the European Chapter of the Association for Computa- tional Linguistics: Volume 1, Long Papers, pages 22-34, Valencia, Spain. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"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
},
"BIBREF2": {
"ref_id": "b2",
"title": "Efficient global learning of entailment graphs",
"authors": [
{
"first": "Jonathan",
"middle": [],
"last": "Berant",
"suffix": ""
},
{
"first": "Noga",
"middle": [],
"last": "Alon",
"suffix": ""
},
{
"first": "Ido",
"middle": [],
"last": "Dagan",
"suffix": ""
},
{
"first": "Jacob",
"middle": [],
"last": "Goldberger",
"suffix": ""
}
],
"year": 2015,
"venue": "Computational Linguistics",
"volume": "41",
"issue": "2",
"pages": "221--263",
"other_ids": {
"DOI": [
"10.1162/COLI_a_00220"
]
},
"num": null,
"urls": [],
"raw_text": "Jonathan Berant, Noga Alon, Ido Dagan, and Jacob Goldberger. 2015. Efficient global learning of entail- ment graphs. Computational Linguistics, 41(2):221- 263.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Global learning of typed entailment rules",
"authors": [
{
"first": "Jonathan",
"middle": [],
"last": "Berant",
"suffix": ""
},
{
"first": "Ido",
"middle": [],
"last": "Dagan",
"suffix": ""
},
{
"first": "Jacob",
"middle": [],
"last": "Goldberger",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "610--619",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jonathan Berant, Ido Dagan, and Jacob Goldberger. 2011. Global learning of typed entailment rules. In Proceedings of the 49th Annual Meeting of the Asso- ciation for Computational Linguistics: Human Lan- guage Technologies, pages 610-619, Portland, Ore- gon, USA. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Modality and negation in event extraction",
"authors": [
{
"first": "Sander",
"middle": [],
"last": "Bijl De Vroe",
"suffix": ""
},
{
"first": "Liane",
"middle": [],
"last": "Guillou",
"suffix": ""
},
{
"first": "Milo\u0161",
"middle": [],
"last": "Stanojevi\u0107",
"suffix": ""
},
{
"first": "Nick",
"middle": [],
"last": "Mckenna",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 4th Workshop on Challenges and Applications of Automated Extraction of Socio-political Events from Text (CASE 2021)",
"volume": "",
"issue": "",
"pages": "31--42",
"other_ids": {
"DOI": [
"10.18653/v1/2021.case-1.6"
]
},
"num": null,
"urls": [],
"raw_text": "Sander Bijl de Vroe, Liane Guillou, Milo\u0161 Stanojevi\u0107, Nick McKenna, and Mark Steedman. 2021. Modal- ity and negation in event extraction. In Proceedings of the 4th Workshop on Challenges and Applications of Automated Extraction of Socio-political Events from Text (CASE 2021), pages 31-42, Online. As- sociation for Computational Linguistics.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"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
},
"BIBREF6": {
"ref_id": "b6",
"title": "The pascal recognising textual entailment challenge",
"authors": [
{
"first": "Oren",
"middle": [],
"last": "Ido Dagan",
"suffix": ""
},
{
"first": "Bernardo",
"middle": [],
"last": "Glickman",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Magnini",
"suffix": ""
}
],
"year": 2006,
"venue": "Machine learning challenges. evaluating predictive uncertainty, visual object classification, and recognising textual entailment",
"volume": "",
"issue": "",
"pages": "177--190",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ido Dagan, Oren Glickman, and Bernardo Magnini. 2006. The pascal recognising textual entailment challenge. In Machine learning challenges. evalu- ating predictive uncertainty, visual object classifica- tion, and recognising textual entailment, pages 177- 190. Springer.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"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
},
"BIBREF8": {
"ref_id": "b8",
"title": "Learning to distinguish valid textual entailments",
"authors": [
{
"first": "Marie-Catherine De",
"middle": [],
"last": "Marneffe",
"suffix": ""
},
{
"first": "Bill",
"middle": [],
"last": "Maccartney",
"suffix": ""
},
{
"first": "Trond",
"middle": [],
"last": "Grenager",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Cer",
"suffix": ""
},
{
"first": "Anna",
"middle": [],
"last": "Rafferty",
"suffix": ""
},
{
"first": "Christopher D",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2006,
"venue": "Second Pascal RTE Challenge Workshop",
"volume": "62",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marie-Catherine De Marneffe, Bill MacCartney, Trond Grenager, Daniel Cer, Anna Rafferty, and Christo- pher D Manning. 2006. Learning to distinguish valid textual entailments. In Second Pascal RTE Challenge Workshop, volume 62.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "An analysis of textual inference in german customer emails",
"authors": [
{
"first": "Kathrin",
"middle": [],
"last": "Eichler",
"suffix": ""
},
{
"first": "Aleksandra",
"middle": [],
"last": "Gabryszak",
"suffix": ""
},
{
"first": "G\u00fcnter",
"middle": [],
"last": "Neumann",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the Third Joint Conference on Lexical and Computational Semantics (* SEM 2014)",
"volume": "",
"issue": "",
"pages": "69--74",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kathrin Eichler, Aleksandra Gabryszak, and G\u00fcnter Neumann. 2014. An analysis of textual inference in german customer emails. In Proceedings of the Third Joint Conference on Lexical and Computa- tional Semantics (* SEM 2014), pages 69-74.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Generating pattern-based entailment graphs for relation extraction",
"authors": [
{
"first": "Kathrin",
"middle": [],
"last": "Eichler",
"suffix": ""
},
{
"first": "Feiyu",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Hans",
"middle": [],
"last": "Uszkoreit",
"suffix": ""
},
{
"first": "Sebastian",
"middle": [],
"last": "Krause",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 6th Joint Conference on Lexical and Computational Semantics (*SEM 2017)",
"volume": "",
"issue": "",
"pages": "220--229",
"other_ids": {
"DOI": [
"10.18653/v1/S17-1026"
]
},
"num": null,
"urls": [],
"raw_text": "Kathrin Eichler, Feiyu Xu, Hans Uszkoreit, and Sebas- tian Krause. 2017. Generating pattern-based entail- ment graphs for relation extraction. In Proceedings of the 6th Joint Conference on Lexical and Computa- tional Semantics (*SEM 2017), pages 220-229, Van- couver, Canada. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "The conll-2010 shared task: learning to detect hedges and their scope in natural language text",
"authors": [
{
"first": "Rich\u00e1rd",
"middle": [],
"last": "Farkas",
"suffix": ""
},
{
"first": "Veronika",
"middle": [],
"last": "Vincze",
"suffix": ""
},
{
"first": "Gy\u00f6rgy",
"middle": [],
"last": "M\u00f3ra",
"suffix": ""
},
{
"first": "J\u00e1nos",
"middle": [],
"last": "Csirik",
"suffix": ""
},
{
"first": "Gy\u00f6rgy",
"middle": [],
"last": "Szarvas",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the fourteenth conference on computational natural language learning-Shared task",
"volume": "",
"issue": "",
"pages": "1--12",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rich\u00e1rd Farkas, Veronika Vincze, Gy\u00f6rgy M\u00f3ra, J\u00e1nos Csirik, and Gy\u00f6rgy Szarvas. 2010. The conll-2010 shared task: learning to detect hedges and their scope in natural language text. In Proceedings of the fourteenth conference on computational natural language learning-Shared task, pages 1-12.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"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
},
"BIBREF13": {
"ref_id": "b13",
"title": "Probabilistic models of relational implication",
"authors": [
{
"first": "Xavier",
"middle": [],
"last": "Holt",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xavier Holt. 2018. Probabilistic models of relational implication. Master's thesis, Macquarie University.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"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
},
"BIBREF15": {
"ref_id": "b15",
"title": "Duality of link prediction and entailment graph induction",
"authors": [
{
"first": "Mohammad Javad",
"middle": [],
"last": "Hosseini",
"suffix": ""
},
{
"first": "Shay",
"middle": [
"B"
],
"last": "Cohen",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Johnson",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Steedman",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "4736--4746",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1468"
]
},
"num": null,
"urls": [],
"raw_text": "Mohammad Javad Hosseini, Shay B. Cohen, Mark Johnson, and Mark Steedman. 2019. Duality of link prediction and entailment graph induction. In Pro- ceedings of the 57th Annual Meeting of the Asso- ciation for Computational Linguistics, pages 4736- 4746, Florence, Italy. Association for Computational Linguistics.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Uncertainty detection in natural language: A probabilistic model",
"authors": [
{
"first": "Pierre-Antoine",
"middle": [],
"last": "Jean",
"suffix": ""
},
{
"first": "S\u00e9bastien",
"middle": [],
"last": "Harispe",
"suffix": ""
},
{
"first": "Sylvie",
"middle": [],
"last": "Ranwez",
"suffix": ""
},
{
"first": "Patrice",
"middle": [],
"last": "Bellot",
"suffix": ""
},
{
"first": "Jacky",
"middle": [],
"last": "Montmain",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 6th International Conference on Web Intelligence, Mining and Semantics",
"volume": "",
"issue": "",
"pages": "1--10",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pierre-Antoine Jean, S\u00e9bastien Harispe, Sylvie Ran- wez, Patrice Bellot, and Jacky Montmain. 2016. Un- certainty detection in natural language: A probabilis- tic model. In Proceedings of the 6th International Conference on Web Intelligence, Mining and Seman- tics, pages 1-10.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Dagstuhl Seminar Proceedings. Schloss Dagstuhl-Leibniz-Zentrum f\u00fcr Informatik",
"authors": [
{
"first": "Lauri",
"middle": [],
"last": "Karttunen",
"suffix": ""
},
{
"first": "Annie",
"middle": [],
"last": "Zaenen",
"suffix": ""
}
],
"year": 2005,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lauri Karttunen and Annie Zaenen. 2005. Veridicity. In Dagstuhl Seminar Proceedings. Schloss Dagstuhl- Leibniz-Zentrum f\u00fcr Informatik.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Recognizing speculative language in biomedical research articles: a linguistically motivated perspective",
"authors": [
{
"first": "Halil",
"middle": [],
"last": "Kilicoglu",
"suffix": ""
},
{
"first": "Sabine",
"middle": [],
"last": "Bergler",
"suffix": ""
}
],
"year": 2008,
"venue": "BMC bioinformatics",
"volume": "9",
"issue": "11",
"pages": "1--10",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Halil Kilicoglu and Sabine Bergler. 2008. Recognizing speculative language in biomedical research articles: a linguistically motivated perspective. BMC bioin- formatics, 9(11):1-10.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"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
},
"BIBREF20": {
"ref_id": "b20",
"title": "Annotating relation inference in context via question answering",
"authors": [
{
"first": "Omer",
"middle": [],
"last": "Levy",
"suffix": ""
},
{
"first": "Ido",
"middle": [],
"last": "Dagan",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "2",
"issue": "",
"pages": "249--255",
"other_ids": {
"DOI": [
"10.18653/v1/P16-2041"
]
},
"num": null,
"urls": [],
"raw_text": "Omer Levy and Ido Dagan. 2016. Annotating relation inference in context via question answering. In Pro- ceedings of the 54th Annual Meeting of the Associa- tion for Computational Linguistics (Volume 2: Short Papers), pages 249-255, Berlin, Germany. Associa- tion for Computational Linguistics.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"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
},
"BIBREF22": {
"ref_id": "b22",
"title": "DIRT: Discovery of Inference Rules from Text",
"authors": [
{
"first": "Dekang",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Patrick",
"middle": [],
"last": "Pantel",
"suffix": ""
}
],
"year": 2001,
"venue": "Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'01)",
"volume": "",
"issue": "",
"pages": "323--328",
"other_ids": {
"DOI": [
"10.1145/502512.502559"
]
},
"num": null,
"urls": [],
"raw_text": "Dekang Lin and Patrick Pantel. 2001. DIRT: Discovery of Inference Rules from Text. In Proceedings of the Seventh ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD'01), pages 323-328, New York, NY, USA. ACM Press.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"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
},
"BIBREF24": {
"ref_id": "b24",
"title": "Mohammad Javad Hosseini, Sander Bijl de Vroe, and Mark Steedman. 2021. Multivalent entailment graphs for question answering",
"authors": [
{
"first": "Nick",
"middle": [],
"last": "Mckenna",
"suffix": ""
},
{
"first": "Liane",
"middle": [],
"last": "Guillou",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:2104.07846"
]
},
"num": null,
"urls": [],
"raw_text": "Nick McKenna, Liane Guillou, Mohammad Javad Hos- seini, Sander Bijl de Vroe, and Mark Steedman. 2021. Multivalent entailment graphs for question an- swering. arXiv preprint arXiv:2104.07846.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Weakly supervised learning for hedge classification in scientific literature",
"authors": [
{
"first": "Ben",
"middle": [],
"last": "Medlock",
"suffix": ""
},
{
"first": "Ted",
"middle": [],
"last": "Briscoe",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 45th annual meeting of the association of computational linguistics",
"volume": "",
"issue": "",
"pages": "992--999",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ben Medlock and Ted Briscoe. 2007. Weakly super- vised learning for hedge classification in scientific literature. In Proceedings of the 45th annual meet- ing of the association of computational linguistics, pages 992-999.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Learning the scope of hedge cues in biomedical texts",
"authors": [
{
"first": "Roser",
"middle": [],
"last": "Morante",
"suffix": ""
},
{
"first": "Walter",
"middle": [],
"last": "Daelemans",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the BioNLP 2009 workshop",
"volume": "",
"issue": "",
"pages": "28--36",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Roser Morante and Walter Daelemans. 2009. Learn- ing the scope of hedge cues in biomedical texts. In Proceedings of the BioNLP 2009 workshop, pages 28-36.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"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. 2012a. 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
},
"BIBREF28": {
"ref_id": "b28",
"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 (Online Working Notes/Labs/Workshop)",
"volume": "",
"issue": "",
"pages": "17--20",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Roser Morante and Walter Daelemans. 2012b. An- notating modality and negation for a machine reading evaluation. In CLEF (Online Working Notes/Labs/Workshop), pages 17-20.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "The Stanford Encyclopedia of Philosophy",
"authors": [
{
"first": "Michael",
"middle": [],
"last": "Nelson",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michael Nelson. 2019. Propositional Attitude Reports. In Edward N. Zalta, editor, The Stanford Encyclope- dia of Philosophy, Spring 2019 edition. Metaphysics Research Lab, Stanford University.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"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
},
"BIBREF31": {
"ref_id": "b31",
"title": "Combining manual rules and supervised learning for hedge cue and scope detection",
"authors": [
{
"first": "Marek",
"middle": [],
"last": "Rei",
"suffix": ""
},
{
"first": "Ted",
"middle": [],
"last": "Briscoe",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the Fourteenth Conference on Computational Natural Language Learning-Shared Task",
"volume": "",
"issue": "",
"pages": "56--63",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marek Rei and Ted Briscoe. 2010. Combining man- ual rules and supervised learning for hedge cue and scope detection. In Proceedings of the Four- teenth Conference on Computational Natural Lan- guage Learning-Shared Task, pages 56-63.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"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
},
"BIBREF33": {
"ref_id": "b33",
"title": "Effectively using syntax for recognizing false entailment",
"authors": [
{
"first": "Rion",
"middle": [],
"last": "Snow",
"suffix": ""
},
{
"first": "Lucy",
"middle": [],
"last": "Vanderwende",
"suffix": ""
},
{
"first": "Arul",
"middle": [],
"last": "Menezes",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the Main Conference on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, HLT-NAACL '06",
"volume": "",
"issue": "",
"pages": "33--40",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rion Snow, Lucy Vanderwende, and Arul Menezes. 2006. Effectively using syntax for recognizing false entailment. In Proceedings of the Main Confer- ence on Human Language Technology Conference of the North American Chapter of the Association of Computational Linguistics, HLT-NAACL '06, page 33-40. Association for Computational Linguistics.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Learning about nonveridicality in textual entailment",
"authors": [
{
"first": "R",
"middle": [],
"last": "Ieva",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Stali\u016bnait\u0117",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ieva R. Stali\u016bnait\u0117. 2018. Learning about non- veridicality in textual entailment. Master's thesis, Utrecht University.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"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
},
"BIBREF36": {
"ref_id": "b36",
"title": "Hedge classification in biomedical texts with a weakly supervised selection of keywords",
"authors": [
{
"first": "Gy\u00f6rgy",
"middle": [],
"last": "Szarvas",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of ACL-08: HLT",
"volume": "",
"issue": "",
"pages": "281--289",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gy\u00f6rgy Szarvas. 2008. Hedge classification in biomed- ical texts with a weakly supervised selection of key- words. In Proceedings of ACL-08: HLT, pages 281- 289.",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"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
},
"BIBREF38": {
"ref_id": "b38",
"title": "Uncertainty detection in natural language texts",
"authors": [
{
"first": "Veronika",
"middle": [],
"last": "Vincze",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Veronika Vincze. 2014. Uncertainty detection in nat- ural language texts. Ph.D. thesis, University of Szeged.",
"links": null
},
"BIBREF39": {
"ref_id": "b39",
"title": "A general framework for distributional similarity",
"authors": [
{
"first": "Julie",
"middle": [],
"last": "Weeds",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Weir",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the 2003 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "81--88",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Julie Weeds and David Weir. 2003. A general frame- work for distributional similarity. In Proceedings of the 2003 Conference on Empirical Methods in Natu- ral Language Processing, pages 81-88.",
"links": null
},
"BIBREF40": {
"ref_id": "b40",
"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
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"text": "police Modal operator Protesters may have attacked the police Conditional",
"type_str": "figure",
"uris": null
},
"FIGREF1": {
"num": null,
"text": "Precision/recall on Levy/Holt dataset Figure 2: Precision/recall on Sports Entailment Dataset 5 Results",
"type_str": "figure",
"uris": null
},
"TABREF0": {
"html": null,
"num": null,
"content": "<table><tr><td>: Modality categories</td></tr><tr><td>ical entailment knowledge stored within them is</td></tr><tr><td>useful for Question Answering (McKenna et al.,</td></tr><tr><td>2021), as well as other tasks such as email cate-</td></tr><tr><td>gorisation</td></tr></table>",
"text": "",
"type_str": "table"
},
"TABREF2": {
"html": null,
"num": null,
"content": "<table><tr><td/><td colspan=\"2\">Nodes Edges % Levy preds found</td></tr><tr><td/><td colspan=\"2\">all ex. directional</td></tr><tr><td>BaselineLarge</td><td>334K 72,7M 63.06</td><td>70.29</td></tr><tr><td colspan=\"2\">BaselineSmall 277K 58,4M 61.13</td><td>69.29</td></tr><tr><td>Asserted</td><td>254K 46,3M 58.51</td><td>67.92</td></tr></table>",
"text": "AUC scores",
"type_str": "table"
},
"TABREF3": {
"html": null,
"num": null,
"content": "<table><tr><td colspan=\"3\">: Graph size comparison and predicate coverage</td></tr><tr><td colspan=\"3\">for Levy/Holt dataset (all examples) and its directional</td></tr><tr><td>portion</td><td/><td/></tr><tr><td/><td colspan=\"2\">Nodes Edges % Sports preds found</td></tr><tr><td>BaselineLarge</td><td>4,514 1.65M</td><td>92.86</td></tr><tr><td colspan=\"2\">BaselineSmall 3,823 1.29M</td><td>90.48</td></tr><tr><td>Asserted</td><td>3,682 1.09M</td><td>88.10</td></tr></table>",
"text": "",
"type_str": "table"
},
"TABREF4": {
"html": null,
"num": null,
"content": "<table/>",
"text": "",
"type_str": "table"
},
"TABREF5": {
"html": null,
"num": null,
"content": "<table><tr><td>contains area under the precision/recall</td></tr><tr><td>curve (AUC) scores for Asserted, BaselineSmall,</td></tr><tr><td>and BaselineLarge on the Levy/Holt dataset (all</td></tr><tr><td>examples), the directional portion of the Levy/Holt</td></tr><tr><td>dataset (2,414 examples), and the Sports Entail-</td></tr><tr><td>ment dataset. The precision-recall curves for the</td></tr><tr><td>Levy/Holt (all examples) and Sports Entailment</td></tr><tr><td>datasets are displayed in</td></tr></table>",
"text": "",
"type_str": "table"
}
}
}
} |