File size: 121,952 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 |
{
"paper_id": "2021",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T07:24:19.261103Z"
},
"title": "CO-NNECT: A Framework for Revealing Commonsense Knowledge Paths as Explicitations of Implicit Knowledge in Texts",
"authors": [
{
"first": "Maria",
"middle": [],
"last": "Becker",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Heidelberg University",
"location": {}
},
"email": ""
},
{
"first": "Katharina",
"middle": [],
"last": "Korfhage",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Heidelberg University",
"location": {}
},
"email": ""
},
{
"first": "Debjit",
"middle": [],
"last": "Paul",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Heidelberg University",
"location": {}
},
"email": ""
},
{
"first": "Anette",
"middle": [],
"last": "Frank",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Heidelberg University",
"location": {}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "In this work we leverage commonsense knowledge in the form of knowledge paths to establish connections between sentences, as a form of explicitation of implicit knowledge. Such connections can be direct (singlehop paths) or require intermediate concepts (multihop paths). To construct such paths we combine two model types in a joint framework we call CONNECT: a relation classifier that predicts direct connections between concepts; and a target prediction model that generates target or intermediate concepts given a source concept and a relation, which we use to construct multihop paths. Unlike prior work that relies exclusively on static knowledge sources, we leverage language models finetuned on knowledge stored in ConceptNet, to dynamically generate knowledge paths, as explanations of implicit knowledge that connects sentences in texts. As a central contribution we design manual and automatic evaluation settings for assessing the quality of the generated paths. We conduct evaluations on two argumentative datasets and show that a combination of the two model types generates meaningful, high-quality knowledge paths between sentences that reveal implicit knowledge conveyed in text.",
"pdf_parse": {
"paper_id": "2021",
"_pdf_hash": "",
"abstract": [
{
"text": "In this work we leverage commonsense knowledge in the form of knowledge paths to establish connections between sentences, as a form of explicitation of implicit knowledge. Such connections can be direct (singlehop paths) or require intermediate concepts (multihop paths). To construct such paths we combine two model types in a joint framework we call CONNECT: a relation classifier that predicts direct connections between concepts; and a target prediction model that generates target or intermediate concepts given a source concept and a relation, which we use to construct multihop paths. Unlike prior work that relies exclusively on static knowledge sources, we leverage language models finetuned on knowledge stored in ConceptNet, to dynamically generate knowledge paths, as explanations of implicit knowledge that connects sentences in texts. As a central contribution we design manual and automatic evaluation settings for assessing the quality of the generated paths. We conduct evaluations on two argumentative datasets and show that a combination of the two model types generates meaningful, high-quality knowledge paths between sentences that reveal implicit knowledge conveyed in text.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Commonsense knowledge covers simple facts about the world, people and everyday life, e.g., Birds can fly or Cars are used for driving. It is increasily used for many NLP tasks, e.g. for question answering (Mihaylov et al., 2018) , textual entailment (Weissenborn et al., 2018) , or classifying argumentative functions . In this work, we leverage commonsense knowledge in the form of single-and multihop knowledge paths for establishing connections between concepts from different sentences in texts, and show that these paths can explicate implicit information conveyed by the text. Connections can either be direct, e.g. given the sentences The car was too old and The engine broke down, the concepts car and engine can be linked with a direct relation (singlehop path) car \u2192 HASA \u2192 engine; or indirect -here intermediate concepts are required to establish the link, as between Berliners produce too much waste and Environmental protection should play a more important role, where the link between waste and environmental protection requires a multihop reasoning path: waste \u2192 RECEIVESACTION \u2192 recycle \u2192 PARTOF \u2192 environmental protection.",
"cite_spans": [
{
"start": 205,
"end": 228,
"text": "(Mihaylov et al., 2018)",
"ref_id": "BIBREF14"
},
{
"start": 250,
"end": 276,
"text": "(Weissenborn et al., 2018)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We show that two complementary model types can be combined to solve the two subtasks: (i) for predicting singlehop paths between concepts, we propose a relation classification model that is very precise, but restricted to direct connections between concepts; (ii) for constructing longer paths we rely on a target prediction model that can generate intermediate concepts and is thus able to generate multihop paths. However, the intermediate concepts can be irrelevant or misleading. To our knowledge, prior work has applied either relation classification or target prediction models. We propose CO-NNECT, a framework that establishes COmmonsense knowledge paths for CON-NECTing sentences by combining relation classification and target prediction models, leveraging their strengths and minimizing their weaknesses. With CO-NNECT, we obtain high-quality knowledge paths that explicate implicit knowledge conveyed by the text.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We focus on commonsense knowledge in Con-ceptNet (Speer et al., 2017) , a knowledge graph (KG) that represents concepts (words or phrases) as nodes, and relations between them as edges, e.g., oven,USEDFOR, baking . As instances of the model types we use COREC (Becker et al., 2019) , a multi-label relation classifier that predicts relation types and that we enhance with a pretrained language model; and COMET (Bosselut et al., 2019) , a pretrained transformer model that learns to generate target concepts given a source concept and a relation. In contrast to models that retrieve knowledge from static KGs (Mihaylov et al., 2018; Lin et al., 2019) , both models are fine-tuned on Con-ceptNet and applied on the fly, to dynamically generate knowledge paths that generalize beyond the static knowledge, allowing us to predict unseen knowledge paths. We compare our models to a baseline model that solely relies on static KGs.",
"cite_spans": [
{
"start": 49,
"end": 69,
"text": "(Speer et al., 2017)",
"ref_id": "BIBREF22"
},
{
"start": 260,
"end": 281,
"text": "(Becker et al., 2019)",
"ref_id": "BIBREF4"
},
{
"start": 411,
"end": 434,
"text": "(Bosselut et al., 2019)",
"ref_id": "BIBREF6"
},
{
"start": 609,
"end": 632,
"text": "(Mihaylov et al., 2018;",
"ref_id": "BIBREF14"
},
{
"start": 633,
"end": 650,
"text": "Lin et al., 2019)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We evaluate our framework on two English argumentative datasets, IKAT and ARC (Habernal et al., 2018) , which offer annotations that explain implicit connections between sentences. While knowledge paths have been widely used in NLP downstream tasks, a careful evaluation of these paths has not received much attention. As a central contribution of our work, we address this shortcoming by designing manual and automatic settings for path evaluation: we evaluate the relevance and quality of the paths and their ability to represent implicit knowledge in an annotation experiment; and we compare the paths to the annotations of implicit knowledge in IKAT and ARC, using automatic similarity metrics.",
"cite_spans": [
{
"start": 78,
"end": 101,
"text": "(Habernal et al., 2018)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Our main contributions are: i) we propose CO-NNECT, a framework that combines two complementary types of knowledge path prediction models that have previously only been applied separately; 1 ii) we show that commonsense knowledge paths generated with CO-NNECT effectively represent implied knowledge between sentences; iii) we propose an evaluation scheme that measures the quality of the knowledge paths, going beyond many approaches that use knowledge paths for downstream applications without analyzing their quality.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this work we combine relation classification and target prediction for generating commonsense knowledge representations over text. Relation classification covers a range of methods and learning paradigms for representing relations. A variety of neural architectures such as RNNs (Zhang et al., 2018) , CNNs (Guo et al., 2019) , sequenceto-sequence models (Trisedya et al., 2019) or language models (Wu and He, 2019) achieved state-of-the-art results. To our knowledge, Becker et al. (2019) is the only work that proposed a relation classification model specifically for ConceptNet relations, which we adapt for our work. Besides COMET (Bosselut et al., 2019) , the model used in our approach, Saito et al. (2018) perform target prediction on ConceptNet using an attentional encoder-decoder model. They improve the KB completion model of Li et al. (2016) by jointly scoring triples and predicting target concepts.",
"cite_spans": [
{
"start": 282,
"end": 302,
"text": "(Zhang et al., 2018)",
"ref_id": "BIBREF29"
},
{
"start": 310,
"end": 328,
"text": "(Guo et al., 2019)",
"ref_id": "BIBREF9"
},
{
"start": 358,
"end": 381,
"text": "(Trisedya et al., 2019)",
"ref_id": "BIBREF23"
},
{
"start": 401,
"end": 418,
"text": "(Wu and He, 2019)",
"ref_id": "BIBREF27"
},
{
"start": 472,
"end": 492,
"text": "Becker et al. (2019)",
"ref_id": "BIBREF4"
},
{
"start": 638,
"end": 661,
"text": "(Bosselut et al., 2019)",
"ref_id": "BIBREF6"
},
{
"start": 696,
"end": 715,
"text": "Saito et al. (2018)",
"ref_id": "BIBREF20"
},
{
"start": 840,
"end": 856,
"text": "Li et al. (2016)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Utilizing commonsense knowledge paths. When using commonsense knowledge for question answering (Mihaylov et al., 2018) , commonsense reasoning (Lin et al., 2019) or NLI (Kapanipathi et al., 2020) , most approaches rely on paths retrieved from static knowledge resources. In contrast, we propose a framework that in addition makes use of dynamic knowledge provided by language models. Few other models have used knowledge paths dynamically, e.g. , who enrich ConceptNet on the fly when classifying argumentative functions. Wang et al. (2020) make use of language models for question answering. They generate multihop paths by sampling random walks from Con-ceptNet and finetune a language model on these paths to connect question and answers, improving accuracy on two question answering benchmarks. Bosselut et al. (2021) generate knowledge paths using a language model for zero-shot question answering, which they use to select the answer to a question, surpassing performance of pretrained language models on SocialIQA (a multiple-choice question answering dataset for probing machine's emotional and social intelligence in a variety of everyday situations). Similarly, Chang et al. (2020) incorporate knowledge from ConceptNet in pretrained language models for SocialIQA. They extract keywords from question and answers, query ConceptNet for relevant triples, and incorporate them in their language models via attention. Their evaluation shows that their knowledge-enhanced model outperforms knowledge-agnostic baselines. Finally, propose an attention model that encodes commonsense inference rules and incorporates them in a transformer based reasoning cell, taking advantage of pretrained language models and structured knowledge. Their evaluation on two reasoning tasks shows that their model improves performance over models that lack external knowledge. Hence, none of these sys-tems directly evaluates the quality of the generated paths, but measure the effectiveness of commonsense knowledge indirectly by evaluation on downstream tasks. We will address this shortcoming in our work by carefully evaluating the quality of the generated paths.",
"cite_spans": [
{
"start": 95,
"end": 118,
"text": "(Mihaylov et al., 2018)",
"ref_id": "BIBREF14"
},
{
"start": 143,
"end": 161,
"text": "(Lin et al., 2019)",
"ref_id": "BIBREF13"
},
{
"start": 169,
"end": 195,
"text": "(Kapanipathi et al., 2020)",
"ref_id": null
},
{
"start": 522,
"end": 540,
"text": "Wang et al. (2020)",
"ref_id": "BIBREF25"
},
{
"start": 799,
"end": 821,
"text": "Bosselut et al. (2021)",
"ref_id": "BIBREF5"
},
{
"start": 1172,
"end": 1191,
"text": "Chang et al. (2020)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "This section describes CO-NNECT, the framework we propose for enriching texts with commonsense knowledge, by establishing relations or paths between concepts from different sentences. Towards this aim, we apply relation classification and target prediction models in combination. We first characterize differences between the two model types and their instantiations, COREC-LM and COMET, describe how we adapt them to our task and evaluate them on ConceptNet to assess their performance ( \u00a73.1). We then show how we utilize the models to establish connections between concepts in texts ( \u00a73.2) and present a baseline model that uses Con-ceptNet as a static KG to establish commonsense knowledge paths ( \u00a73.3).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Enriching Texts with Commonsense Knowledge Paths",
"sec_num": "3"
},
{
"text": "Relation classification and target prediction both aim at representing relational commonsense knowledge, but the respective task settings are fundamentally different. We choose two models that have been developed for representing commonsense knowledge in CN: COREC, a relation classification and COMET, a target prediction model. Relation Classification with COREC-LM. A relation classifier is ideally suited to predict direct relations between concepts, hence we can apply COREC (Becker et al., 2019) , an open-world multilabel relation classification system, for this task. Given a pair of concepts c s , c t from sentences, it predicts one or several relations r i from a set of relation types R CN that hold between c s and c t . We enhance the original neural model with the pretrained language model DistilBERT (Sanh et al., 2019) to construct a classifier we call COREC-LM. We finetune this model on ConceptNet by masking the relations and use sigmoid as output layer to model the probability of each relation independently, accounting for ambiguous relations in CN.",
"cite_spans": [
{
"start": 480,
"end": 501,
"text": "(Becker et al., 2019)",
"ref_id": "BIBREF4"
},
{
"start": 817,
"end": 836,
"text": "(Sanh et al., 2019)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Comparing and Evaluating Model Types",
"sec_num": "3.1"
},
{
"text": "Target Prediction with COMET. To generate multihop paths that include (possibly novel) intermediate concepts, we apply COMET (Bosselut et al., 2019) , a transformer encoder-decoder based on GPT-2 (Radford et al., 2019) . Input to the model is a source concept c s and a relation r i . Then the pretrained language model is finetuned using Con-ceptNet as labelled train set for the task of generating new concepts. Depending on the beam size, COMET can propose multiple targets per input instance.",
"cite_spans": [
{
"start": 125,
"end": 148,
"text": "(Bosselut et al., 2019)",
"ref_id": "BIBREF6"
},
{
"start": 196,
"end": 218,
"text": "(Radford et al., 2019)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Comparing and Evaluating Model Types",
"sec_num": "3.1"
},
{
"text": "Datasets. To compare model performances, we evaluate COREC-LM and COMET on the CN-100k benchmark dataset of Li et al. (2016) , which is based on the OMCS subpart of ConceptNet. The dataset comprises 37 relation types such as ISA, PARTOF or CAUSES and contains 100k relation triples in the train set and 1200 in the development and the test set, respectively. CN-100k contains a lot of infrequent relations which are hard to learn and often overspecific (e.g. HASFIRST-SUBEVENT), and hence not useful for establishing high quality relations and paths between concepts. We therefore extract a subset that contains all triples of the 13 most frequent relations (CN-13). 2 CN-13 covers 90,600 triples for training, 1080 triples for development, and 1080 triples for testing.",
"cite_spans": [
{
"start": 108,
"end": 124,
"text": "Li et al. (2016)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Comparing and Evaluating Model Types",
"sec_num": "3.1"
},
{
"text": "Since our application task requires that the relation classifier also learns to detect that a given concept pair is not related, we extend the data for training and testing COREC-LM with a RANDOM class that contains unrelated concept pairs, which we add to CN-100k and CN-13. 3 PoS Sequence Filtering. We apply a typebased PoS sequence filtering for COREC-LM and COMET, where the type is dependent on the predicted relation. The relation ISA, for example, is supposed to connect two noun phrases; in contrast, HASPREREQUISITE typically relates two verb phrases. We determine frequent PoS sequence patterns for specific argument types from the Con-ceptNet resource and use them to filter relation and path predictions.",
"cite_spans": [
{
"start": 276,
"end": 277,
"text": "3",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Comparing and Evaluating Model Types",
"sec_num": "3.1"
},
{
"text": "Metrics. We evaluate COREC-LM in terms of weighted F1-scores, precision and recall, which is its genuine evaluation setting. For COMET we report precision scores for the first prediction with highest confidence score (hits@1); we further report hits@10 which gives information if the correct triple is included in the first ten predictions (which will be important since we later use a beamsize of 10 for generating paths). In addition, we report accuracy using the Bilinear AVG model of Li et al. 2016(COMET's genuine evaluation setting), which is trained on CN-100k and produces a probability for a generated relation triple to be correct. Following Bosselut et al. (2019), we apply a beamsize of 1 and a threshold at 0.5 for judging a triple as correct.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparing and Evaluating Model Types",
"sec_num": "3.1"
},
{
"text": "Model Performances. COREC-LM achieves high F1-scores on CN-100k (76.5) and CN-13 (86.0). 4 Scores are significantly lower when adding the RANDOM class (-7pp on CN-100k&CN-13), indicating that detecting unrelated concept pairs is not trivial. The results show that a strength of COREC-LM is its precision (90.1/CN-100k; 88.2/CN-13) -which we will leverage when combining models. COMET achieves high accuracy scores (92.3/CN-100k; 96.3/CN-13) according to the bi-score. For the much stricter metric hits@1 which judges a triple as correct only if it matches the respective triple in the testset, much lower scores are achieved (25/CN-100k; 23.5/CN-13), which is evident given the wide range of possible target generations. Higher scores for hits@10 (65.3/CN-100k; 65.9/CN-13) show that the chance for correct predictions significantly rises with increasing beam size.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparing and Evaluating Model Types",
"sec_num": "3.1"
},
{
"text": "In sum, COREC-LM and COMET both aim at learning commonsense knowledge representations, but tackle different tasks and have different strengths and weaknesses. COREC-LM is very precise in its predictions, but is restricted to predicting direct relations between two given concepts. COMET is more powerful since it can genuinely generate novel target concepts and thus can generate multihop paths. However, it tends to be more imprecise, and bears the risk of generating irrelevant or noisy concepts. Hence, a combination of models seems beneficial, to predict high-quality single-and multihop paths between concepts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparing and Evaluating Model Types",
"sec_num": "3.1"
},
{
"text": "In the following we describe how we combine and apply COREC-LM and COMET in a joint framework, CO-NNECT, to establish high-quality knowledge paths between sentences. An overview is given in Fig.1 . In the first step we extract relevant concepts from the text. For this we integrate the concept extraction tool COCO-EX (Becker et al., 2021a) , which extracts meaningful concepts from texts and maps them to concept nodes in CN, considering all surface forms.",
"cite_spans": [
{
"start": 318,
"end": 340,
"text": "(Becker et al., 2021a)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [
{
"start": 190,
"end": 195,
"text": "Fig.1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Establishing Connections Using Relation Classification and Target Prediction",
"sec_num": "3.2"
},
{
"text": "Linking Concepts with Direct Relations. We construct all possible pairs of concepts extracted from S 1 and S 2 by taking the cross product c s \u00d7c t , where c s is a concept from S 1 , and c t a concept from S 2 (Fig. 1, Step 2, left). We then apply COREC-LM trained on CN-13+RANDOM with a tuned threshold of 0.9 for predicting which rela-tion r i \u2208 R CN 13 holds between the concept pairs, or whether no relation holds (RANDOM) (cf. Fig. 1, Step 3 (left) for examples).",
"cite_spans": [],
"ref_spans": [
{
"start": 211,
"end": 219,
"text": "(Fig. 1,",
"ref_id": "FIGREF0"
},
{
"start": 433,
"end": 441,
"text": "Fig. 1,",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Establishing Connections Using Relation Classification and Target Prediction",
"sec_num": "3.2"
},
{
"text": "Linking Concepts with Multihop Paths. COMET requires as input a source concept and a relation. For each concept pair c s , c t we build such inputs by combining c s with each relation r i \u2208 R CN 13 , yielding 13 pairs c s , r i which we input for target prediction (Step 2, right). To discover relation chains starting from S 2 , we apply the same process to c t , using c s as target concept. We also include inverse relations, which gives us greater flexibility for connecting entities, i.e., paths are allowed to contain inverted triplets (e.g. baking \u2190 USEDFOR \u2190 oven \u2192 ATLOCATION \u2192 kitchen).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Establishing Connections Using Relation Classification and Target Prediction",
"sec_num": "3.2"
},
{
"text": "To this end, we switch the order of concept pairs within a given relation r i , relabel the relation as r \u22121 i , and add the inverted relation pair to COMET's training set.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Establishing Connections Using Relation Classification and Target Prediction",
"sec_num": "3.2"
},
{
"text": "Forward Chaining. For all pairs in the crossproduct c s \u00d7 c t , for each input c s , r i and c s , r \u22121 i we generate the 10 most confident concepts c t i with COMET (beamsize 10) trained on CN-13 including inverse triples. We continue with all paths where the generated concept c t i has minimum cosine distance of 0.7 to the respective target concept c t . We generate the next hop by using each c t i as a new source concept, combine it with each of the 13 original and inverse relations, generate novel target predictions, and again compare to the target concept. This similarity comparison guides the forward chaining process towards the chosen target concepts and helps detecting contextually relevant paths. We use ConceptNet numberbatch embeddings for the encoding of concepts; for multiword concepts we average the embeddings of all non-stopwords.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Establishing Connections Using Relation Classification and Target Prediction",
"sec_num": "3.2"
},
{
"text": "Terminating Paths. We terminate path generation as soon as the similarity between c t i and c t is higher than 0.95 -here we expect the two concepts to express the same meaning. We restrict the path length to 3 hops and consider only completed paths for evaluation (Step 3, right in Fig. 1) .",
"cite_spans": [],
"ref_spans": [
{
"start": 283,
"end": 290,
"text": "Fig. 1)",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Establishing Connections Using Relation Classification and Target Prediction",
"sec_num": "3.2"
},
{
"text": "Combining Approaches. With our framework CO-NNECT we leverage the potential of the complementarity of the two model types by combining COREC-LM and COMET in a straightforward way. Our hypothesis is that a system that admits both single and multihop connections for establishing links between concepts offers the greatest flexibility. We further hypothesize that direct relations should be preferred over indirect multihop paths, since the latter could include irrelevant or misleading intermediate nodes. Thus, we discard all multihop paths for each concept pair for which COREC-LM predicted a direct connection (Fig. 1, Step 4, pair 4) . If COMET and COREC-LM produce a singlehop path, we also prefer COREC-LM's prediction, relying on the model's high precision (pair 1 in Step 4). We keep the paths generated by COMET for concept pairs for which no direct relation could be established (i.e., COREC-LM predicted RANDOM or no prediction above its threshold, pair 3&6), assuming that in such cases intermediate concepts are required to establish a link. If only one of the models establishes a link, we keep this connection (pair 2), and if none of the models finds a link, we assume that the concepts are not (closely) connected (pair 5).",
"cite_spans": [],
"ref_spans": [
{
"start": 612,
"end": 636,
"text": "(Fig. 1, Step 4, pair 4)",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Establishing Connections Using Relation Classification and Target Prediction",
"sec_num": "3.2"
},
{
"text": "We compare COREC-LM and COMET against the model of Paul and Frank (2019) that uses Concept-Net as a static KG. The system extracts paths between pairs of concepts from sentence pairs, hence conforms well to our setting. Following Paul and Frank (2019) , starting from concepts in a sentence pair ( \u00a73.2), we construct a subgraph G = (V , E ) of the ConceptNet graph, where V comprises all concepts c i in S 1 , S 2 . The system then finds all shortest paths p from ConceptNet that connect any concept pairs in V , and includes them in G . It then includes, for any concepts in G , all directly connected concepts from ConceptNet together with their edges. This yields a small sub-graph from ConceptNet that contains concepts and relations relevant for capturing conceptual links across the sentence pair. To select relevant paths, G is filtered by computing scores for vertices and paths using PageRank and Closeness Centrality score, and we constrain path lengths to 3 hops.",
"cite_spans": [
{
"start": 51,
"end": 72,
"text": "Paul and Frank (2019)",
"ref_id": "BIBREF15"
},
{
"start": 230,
"end": 251,
"text": "Paul and Frank (2019)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Static Baseline Model",
"sec_num": "3.3"
},
{
"text": "In this section we evaluate the paths generated by our proposed models. We first present our datasets and statistics on established connections ( \u00a74.1), and then evaluate the quality of the paths manually ( \u00a74.2) and automatically ( \u00a74.3). ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Revealing Implicit Knowledge through Knowledge Paths: Experiments and Evaluation",
"sec_num": "4"
},
{
"text": "The IKAT dataset is based on the English Microtexts Corpus of short argumentative texts (Peldszus and Stede, 2016) . For all sentence pairs that are adjacent or argumentatively related, annotators added the implicit knowledge that connects them, using short sentences. IKAT contains 719 such sentence pairs, from which we extracted 60,294 concept pairs. The ARC dataset (Habernal et al., 2018) contains arguments taken from online discussions in English, consisting of a claim and a premise, and an annotated implicit warrant that explains why the claim follows from the premise. We evaluate our models on the ARC test set that comprises 444 argument pairs, from which we extracted 21,898 concept pairs; and the corresponding warrants. Example generations for both datasets from our three model types -COREC-LM, COREC, and ranked CN-graphs -appear in Fig. 2 , where the first three sentence pairs come from IKAT, and the last two from ARC.",
"cite_spans": [
{
"start": 88,
"end": 114,
"text": "(Peldszus and Stede, 2016)",
"ref_id": "BIBREF18"
},
{
"start": 370,
"end": 393,
"text": "(Habernal et al., 2018)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [
{
"start": 851,
"end": 857,
"text": "Fig. 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Datasets and Statistics",
"sec_num": "4.1"
},
{
"text": "Number of links and hops. Table 1 gives statistics of the paths generated between concepts from sentence pairs from IKAT and ARC using our different models. We find that COREC-LM finds relations between around 22k from 66k concept pairs in IKAT, while COMET only generates paths between 3,660 pairs. This can be explained by the very high similarity threshold we imposed for guiding the forward chaining process towards the target concept, since our motivation was not to generate as many paths as possible, but paths that are meaningful and contextually relevant. When combining paths from COMET and COREC-LM, we find links for more than 24k concept pairs in IKAT. The highest number of links is established by ranking CN-subgraphs (50k linked concept pairs). For ARC, which contains 22k concept pairs, COREC-LM finds links between around 10k and COMET around 2k concept pairs, while almost 15k pairs can be connected using ranked CN-graphs. In both datasets, the ranked CN-graphs contain on average 2.1 hops (relations) per path, while the paths generated by COMET are shorter (1.4 on IKAT/1.5 on ARC). In fact, COMET establishes many direct relations (69% of all paths are single hops), whereas the ranked CN-graphs are mostly two-(49%) or three-hop paths (37%).",
"cite_spans": [],
"ref_spans": [
{
"start": 26,
"end": 33,
"text": "Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Datasets and Statistics",
"sec_num": "4.1"
},
{
"text": "Replacing Vague Relations in CN-Graphs. We find that in contrast to COREC-LM and COMET, the ranked CN-graphs are constructed using mostly the very general relation RELAT-EDTO (71%/IKAT; 72%/ARC), followed by the likewise vague relation HASCONTEXT (8% in both datasets). 5 For determining the impact of vague relations on path quality, we replace all RELAT-EDTO and HASCONTEXT relations in the ranked CN-graphs with relations predicted by COREC-LM (trained on CN-13, threshold 0.9). For IKAT, we replace 43.4% of all RELATEDTO and 46.2% of all HASCONTEXT instances, in ARC we replace 70.7% of all RELATEDTO and 37% of all HAS-CONTEXT relations. We use this version when evaluating paths, in addition to the original ranked CN-graphs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Datasets and Statistics",
"sec_num": "4.1"
},
{
"text": "Our statistics showed that most links between concepts can be revealed using knowledge paths retrieved from ConceptNet as a static KG, whereby these paths tend to contain multiple hops and a high amount of vague relations. Fewer links are established using the dynamic models COREC-LM and COMET, which produce shorter paths using only specific relation types from CN-13. Since our aim is to construct high-quality, meaningful knowledge paths that help to explain implicit information (rather than establishing as many links as possible), we now examine the quality and relevance of the knowledge paths. We set up an annotation experiment, providing annotators with 100 sentence pairs from each dataset, with marked concepts (one from S 1 and one from S 2 ) and the path generated between these concepts by (i) COREC-LM, (ii) COMET, (iii) ranked paths from CN, and (iv) ranked paths with replaced vague relations (CN-r). Annotation Setup. For each sentence pair, our annotators evaluated if 1) the path is a meaningful and relevant explanation for the connection between the two sentences (very relevant/relevant/neutral/not relevant/misleading); if 2) the path represents implicit information not explicitly expressed in the sentences (yes/no); and 3) which model generates the path that is most helpful and expressive for understanding the connection between the sentences. 4) To evaluate the combination of COREC-LM and COMET in CO-NNECT, we generate a subset for each dataset that includes all sentence/concept pairs for which COREC-LM predicted a singlehop path and COMET generated a multihop path (10 pairs per subset). For these instances we ask in addition whether the multihop paths include unrelated, unnecessary or uninformative intermediate nodes (yes/no), misleading intermediate nodes (yes/no); or intermediate nodes that are important for explaining the connection and missing in the direct relation predicted by COREC-LM (yes/no). 6 Annotations were performed by two annotators with a linguistic background. We measure IAA using Cohen's Kappa and achieve an agreement of 81%. Remaining conflicts were COR COM CN CN-r COR COM CN CN-r Predictions 74 64 88 88 78 60 76 76 Relev. +2 70 50 36 40 63 49 30 34 +1 19 27 22 24 25 28 28 32 0 8 18 27 21 8 9 29 22 -1 3 5 10 10 2 6 4 3 -2 0 0 5 5 2 8 9 (CN-r) ; all numbers in %.: How many concept pairs could be linked (line 1), are the links relevant and meaningful (2-6), do the links represent implicit knowledge (7-8), how often a link was chosen to be most helpful for understanding the connection (9).",
"cite_spans": [],
"ref_spans": [
{
"start": 2116,
"end": 2360,
"text": "COR COM CN CN-r COR COM CN CN-r Predictions 74 64 88 88 78 60 76 76 Relev. +2 70 50 36 40 63 49 30 34 +1 19 27 22 24 25 28 28 32 0 8 18 27 21 8 9 29 22 -1 3 5 10 10 2 6 4 3 -2 0 0 5 5 2 8 9",
"ref_id": "TABREF1"
},
{
"start": 2361,
"end": 2367,
"text": "(CN-r)",
"ref_id": null
}
],
"eq_spans": [],
"section": "Manual Evaluation of Path Quality",
"sec_num": "4.2"
},
{
"text": "resolved by an expert annotator. Results. Table 2 shows the results of our annotation experiment. On IKAT, 89% of the paths established by COREC-LM and 77% of the relations predicted by COMET were annotated as very relevant (+2) or relevant connections (+1), which only applies for 58% of the ranked CN-paths. 15% of the ranked CN-paths were annotated as not relevant (-1) or misleading (-2), which can be explained by noisy intermediate nodes; and 27% as vague (0), which can be explained by the large amount of unspecific relations. When replacing RELATEDTO and HASCONTEXT (CN-r), the amount of paths annotated as vague slightly decreases, and the amount of paths labelled as relevant and very relevant increases.",
"cite_spans": [],
"ref_spans": [
{
"start": 42,
"end": 49,
"text": "Table 2",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "IKAT ARC",
"sec_num": null
},
{
"text": "Moreover, paths generated by COREC-LM and COMET were found to yield better implicit knowledge representations than ranked CN-paths (line 8-9, Table 2), while we find that replacing vague relations in the CN-paths improves their ability of representing implicit knowledge. Finally, 65% of relations predicted by COREC-LM and 64% of paths generated by COMET were chosen as explaining the connections between sentences best, which is only the case for 28% of the CN-paths, and slightly better for the replaced version of the CN-paths (34%).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "IKAT ARC",
"sec_num": null
},
{
"text": "On ARC, the high amount of CN-paths annotated as vague (29%) again indicates uninformative connections and can be reduced when replacing vague with more specific relations. Relations predicted by COREC-LM were found to be less relevant for connecting sentences in ARC than in IKAT, but 87% of them were evaluated as appropriate expressions of implicit knowledge. 76% of the relations predicted by COREC-LM were evaluated as best connections, which applies only for 7% of CN-paths and 14% of CN-paths with replaced relations. For COMET we find overall comparable results between IKAT and ARC.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "IKAT ARC",
"sec_num": null
},
{
"text": "Regarding the combination of COREC-LM and COMET addressed with question 4, according to our annotators 50% of the multihop paths in the IKAT subset include misleading nodes and all of them include irrelevant or uninformative nodes. Still, compared against the direct relations predicted by COREC-LM, annotators state for 30% of the multihop paths from COMET that they contain intermediate concepts that are important for explaining the connection. On the ARC subset, 40% of the multihop paths include misleading and 60% include irrelevant nodes, and only 20% contain important intermediate concepts that are missing in the direct relation. For each subset, annotators preferred the shorter path over the multihop path in 90% of the given sentence pairs. Comparing singlehop paths generated by COMET to direct relations predicted by COREC-LM for the same concept pairs, our annotators preferred the relation predicted by COREC-LM in 64% of the cases, in 29% the link was annotated as equally good, and only in 7% COMET's generation was preferred.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "IKAT ARC",
"sec_num": null
},
{
"text": "To summarize, according to our manual evaluation, the dynamic models COMET and COREC-LM are better suited for generating meaningful knowledge paths that express implicit knowledge between sentences than ranked paths from the static CN knowledge graph, even though replacing vague by more specific relations slightly improves results. When comparing multihop paths to direct relations established between the same concept pairs, we find that longer paths tend to contain irrelevant or even misleading nodes, and that direct relations are preferred by human annotators. These findings support our proposed joint framework CO-NNECT, which gives preference to direct relations and utilizes multihop paths only if no direct connection between concepts can be revealed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "IKAT ARC",
"sec_num": null
},
{
"text": "Our goal is to generate meaningful paths that convey implicit knowledge between sentences. In our automatic evaluation we compare the set of modelgenerated paths between all concept pairs from two related sentences to the implicit knowledge annotated in IKAT and ARC for these sentences, using similarity metrics.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Automatic Evaluation Against Gold",
"sec_num": "4.3"
},
{
"text": "Since the generated relation and path representations differ from the annotated natural sentences, we approximate a common representation as follows: We encode the golden annotations of implicit knowledge -usually short sentences -using three settings: (i) Silver Paths: we encode their relational knowledge, by extracting all concepts from each golden implicit knowledge sentence (My dog has a bone \u2192 dog, bone) using the CN-extraction tool COCO-EX (Becker et al., 2021a) , and predict the relations between them using COREC-LM, trained on HASA, bone) . If a sentence contains more than two relations, we concatenate the predicted relation triples. (ii) IKAT provides manual annotations of ConceptNet relations for the golden implicit knowledge sentences, which we use as Gold Paths (The tree is in the garden \u2192 tree ATLOCATION garden). (iii) Gold-NL: Here we use the implicit knowledge (in natural language) as provided in the datasets: IKAT's implicit knowledge sentences and ARC's implicit warrants.",
"cite_spans": [
{
"start": 450,
"end": 472,
"text": "(Becker et al., 2021a)",
"ref_id": "BIBREF1"
},
{
"start": 541,
"end": 546,
"text": "HASA,",
"ref_id": null
},
{
"start": 547,
"end": 552,
"text": "bone)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Automatic Evaluation Against Gold",
"sec_num": "4.3"
},
{
"text": "For encoding the generated paths we apply two settings: (i) we concatenate all concepts and relations within the paths; (Generated Paths) and (ii) we translate the relation triples and paths to (pseudo) natural language using templates provided by ConceptNet (e.g. c s CAUSES c t \u2192 The effect of c s is c t ; Generated Paths-NL).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Automatic Evaluation Against Gold",
"sec_num": "4.3"
},
{
"text": "We apply two automatic similarity metrics, comparing (a) Generated vs. Silver Paths, (b) Generated Paths-NL vs. Gold-NL, and (c) Generated vs. Gold Paths (only IKAT). (i) We encode each representation as described above using ConceptNet numberbatch embeddings (Speer et al., 2017 ) (for multiword concepts we average the embeddings of all non-stopwords), and compute cosine similarity between them, and (ii) we use BERTScore F1 (Zhang et al., 2020) to compare representations, which computes string similarity using contextualized embeddings. Both metrics lie in [\u22121, 1] .",
"cite_spans": [
{
"start": 260,
"end": 279,
"text": "(Speer et al., 2017",
"ref_id": "BIBREF22"
},
{
"start": 428,
"end": 448,
"text": "(Zhang et al., 2020)",
"ref_id": "BIBREF28"
},
{
"start": 563,
"end": 570,
"text": "[\u22121, 1]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Automatic Evaluation Against Gold",
"sec_num": "4.3"
},
{
"text": "Results. Table 3 shows that the paths generated by combining COREC-LM and COMET in our framework CO-NNECT achieve the highest similarity scores according to Numberbatch-Cosim on IKAT in setting (a) and (b), while for (c) we get the highest Cosim scores for ranked CNgraphs with replaced vague relations. According to BERTScore, either COREC-LM (setting a) or COMET (setting b) applied separately, or both applied in combination (setting c) achieve highest results on IKAT. On ARC, CO-NNECT achieves both highest Cosim and BERTScores in setting (a), while in (b) we get the best scores for CN-r according to Cosim, and the best scores for COMET according to BERTScore.",
"cite_spans": [],
"ref_spans": [
{
"start": 9,
"end": 16,
"text": "Table 3",
"ref_id": "TABREF5"
}
],
"eq_spans": [],
"section": "Automatic Evaluation Against Gold",
"sec_num": "4.3"
},
{
"text": "Summarizing our insights from automatic evaluations, we find that COREC-LM achieves high scores when applied separately or in combination with COMET (CO-NNECT). COMET applied in isolation does not yield the highest scores, but helps to boost COREC-LM's performance in the joint CO-NNECT framework. Ranked CN-graphs achieve highest Cosim in two settings/datasets (ARC-b; IKAT-c), but we do not find significant improvements when replacing vague relations in CN-graphs (expect for Cosim in setting b). This can be explained by the fact that even though many RELATEDTO and HASCONTEXT instances could be replaced, for both datasets a large amount of vague relations still remain (56.6% of RELAT-EDTO/53.2% of HASCONTEXT in IKAT; 29.3% RELATEDTO/63% HASCONTEXT in ARC). Therefore, the vague relation types in the CN-graphs still remain problematic when representing implicit knowledge.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Automatic Evaluation Against Gold",
"sec_num": "4.3"
},
{
"text": "When comparing our manual evaluation results to the automatic scores, we find that the generations that were manually evaluated as most relevant and meaningful explanations of implicit knowledge are not always highest-ranked by automatic metrics, which points to two limitations of our automatic evaluation: Besides well-known issues regarding the reliability, interpretability, and biases of automatic metrics (Callison-Burch et al., 2006) , we evaluate the generated paths against an annotated reference -paths or sentences -which is often only one among several valid options for expressing the implicit knowledge (cf. Becker et al. 2017) . This means that a generated path may still be a relevant explicitation of implicit information, even if not similar to the reference. Hence, automatic scores are to be considered with caution.",
"cite_spans": [
{
"start": 411,
"end": 440,
"text": "(Callison-Burch et al., 2006)",
"ref_id": "BIBREF7"
},
{
"start": 622,
"end": 641,
"text": "Becker et al. 2017)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Automatic Evaluation Against Gold",
"sec_num": "4.3"
},
{
"text": "Our work aims to leverage commonsense knowledge in the form of single and multihop paths, to establish knowledge connections between concepts from different sentences, as a form of explicitation of implicitly conveyed information. We combine existing relation classification and target prediction models in a dynamic knowledge prediction framework, CO-NNECT, utilizing language models finetuned on knowledge relations from Concept-Net. We compare against a path ranking system that employs static knowledge from ConceptNet as a baseline and evaluate the quality of the obtained paths (i) through manual evaluation and (ii) using automatic similarity metrics, by comparing generated paths to annotations of implicit knowledge in two argumentative datasets. Our evaluations show that we obtain the highest number of connections from the static ConceptNet graph, however, they are often noisy due to unrelated intermediate nodes, and -even after replacements -still contain many unspecific relations. Our framework CO-NNECT, instead, combines relation classification and target prediction, leveraging the high precision of the former, and the ability to perform forward chaining of the latter, and obtain high-quality, meaningful and relevant knowledge paths that reveal implicit knowledge conveyed by the text, as shown in a profound manual evaluation experiment.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "5"
},
{
"text": "We believe that CO-NNECT is a useful framework which can be applied for different tasks, such as enriching texts with commonsense knowledge relations and paths, for dynamically enriching knowledge bases, or for building knowledge constraints for language generation. In Becker et al. (2021b) for example we inject single-and multihop commonsense knowledge paths predicted by CO-NNECT as constraints into language models and show that this improves the model's ability of generating sentences that explicate implicit knowledge which connects sentences in texts. We furthermore believe that the paths established with CO-NNECT, which can provide explicitations of implicit knowledge, can be useful to enhance many other NLP downstream tasks, such as argument classification, stance detection, or commonsense reasoning.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "5"
},
{
"text": "The code for our framework can be found here: https: //github.com/Heidelberg-NLP/CO-NNECT.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "These are: ATLOCATION, CAUSES, CAPABLEOF, ISA, HASPREREQUISITE, HASPROPERTY, HASSUBEVENT, USEDFOR, CAUSESDESIRE, DESIRES, HASA, MOTIVATED-BYGOAL and RECEIVESACTION.3 For details about the construction of the RANDOM class, cf. Appendix.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The original version of COREC(Becker et al., 2019) achieves F1 of 53.31/CN-100k; 72.33/CN-13.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "For details on relation distributions cf. Appendix.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The annotation manual together with example annotations can be found here: https://github.com/ Heidelberg-NLP/CO-NNECT/blob/main/manual. pdf",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "This work has been funded by the DFG within the project ExpLAIN as part of the Priority Program \"Robust Argumentation Machines\" (SPP-1999). We thank our annotators for their contribution.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
},
{
"text": "A Constructing the RANDOM Class for Training COREC-LM in an Open World Setting Our downstream application task -finding connections between concepts -requires that our relation classifier also learns to detect that no direct relation holds between a given pair of concepts. We thus extend the data for training and testing COREC-LM with a RANDOM class which contains concept pairs that are not related which we add to CN-100k and CN-13 Instances for this class are generated similarly to Vylomova et al. (2016) : 50% of them are opposite pairs which we obtain by switching the order of concept pairs within the same relation, and 50% are corrupt pairs, obtained by replacing one concept in a pair with a random concept from the same relation. Corrupt pairs ensure that COREC-LM learns to encode relation instances rather than simply learning properties of the word classes. We add these instances (2070 for training and 260 for development and testing, respectively) to CN-100k and CN-13 when training and evaluating in an open world setting. Table 4 lists the three most frequently used relations when constructing single and multihop knowledge paths using COMET, COREC-LM, their combination, and ranked subgraphs, respectively for the two datasets IKAT and ARC. The top three relations used by COREC-LM within both datasets are ATLOCATION, HASPROPERTY, and ISA. Interestingly, besides ISA and HASA, COMET frequently uses the only causal relation in the CN inventory CAUSES. In contrast to COREC-LM and COMET, the ranked CN-graphs are constructed using mostly the very general relation RELATEDTO, followed by the likewise vague relation HASCON-TEXT. When excluding paths that contain RELAT-EDTO, only 2,551 connected concept pairs remain in IKAT and 6,858 in ARC.",
"cite_spans": [
{
"start": 488,
"end": 510,
"text": "Vylomova et al. (2016)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [
{
"start": 1043,
"end": 1050,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "APPENDIX",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Implicit Knowledge in Argumentative Texts: An Annotated Corpus",
"authors": [
{
"first": "Maria",
"middle": [],
"last": "Becker",
"suffix": ""
},
{
"first": "Katharina",
"middle": [],
"last": "Korfhage",
"suffix": ""
},
{
"first": "Anette",
"middle": [],
"last": "Frank",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the Conference on Language Resources and Evaluation (LREC)",
"volume": "",
"issue": "",
"pages": "2316--2324",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Maria Becker, Katharina Korfhage, and Anette Frank. 2020. Implicit Knowledge in Argumentative Texts: An Annotated Corpus. In Proceedings of the Con- ference on Language Resources and Evaluation (LREC), pages 2316-2324, Online.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "COCO-EX: A Tool for Linking Concepts from Texts to ConceptNet",
"authors": [
{
"first": "Maria",
"middle": [],
"last": "Becker",
"suffix": ""
},
{
"first": "Katharina",
"middle": [],
"last": "Korfhage",
"suffix": ""
},
{
"first": "Anette",
"middle": [],
"last": "Frank",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the Conference of the European Chapter of the Association for Computational Linguistics (EACL), Demo Papers",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Maria Becker, Katharina Korfhage, and Anette Frank. 2021a. COCO-EX: A Tool for Linking Concepts from Texts to ConceptNet. In Proceedings of the Conference of the European Chapter of the Associ- ation for Computational Linguistics (EACL), Demo Papers, Online.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Reconstructing Implicit Knowledge with Language Models",
"authors": [
{
"first": "Maria",
"middle": [],
"last": "Becker",
"suffix": ""
},
{
"first": "Siting",
"middle": [],
"last": "Liang",
"suffix": ""
},
{
"first": "Anette",
"middle": [],
"last": "Frank",
"suffix": ""
}
],
"year": 2021,
"venue": "Deep Learning Inside Out (DeeLIO): Workshop on Knowledge Extraction and Integration for Deep Learning Architectures",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Maria Becker, Siting Liang, and Anette Frank. 2021b. Reconstructing Implicit Knowledge with Language Models. Accepted at: Deep Learning Inside Out (DeeLIO): Workshop on Knowledge Extraction and Integration for Deep Learning Architectures.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Enriching Argumentative Texts with Implicit Knowledge",
"authors": [
{
"first": "Maria",
"middle": [],
"last": "Becker",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Staniek",
"suffix": ""
},
{
"first": "Vivi",
"middle": [],
"last": "Nastase",
"suffix": ""
},
{
"first": "Anette",
"middle": [],
"last": "Frank",
"suffix": ""
}
],
"year": 2017,
"venue": "Applications of Natural Language to Data Bases (NLDB) -Natural Language Processing and Information Systems",
"volume": "",
"issue": "",
"pages": "84--96",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Maria Becker, Michael Staniek, Vivi Nastase, and Anette Frank. 2017. Enriching Argumentative Texts with Implicit Knowledge. In Applications of Natu- ral Language to Data Bases (NLDB) -Natural Lan- guage Processing and Information Systems, Lecture Notes in Computer Science, pages 84-96. Springer.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Assessing the Difficulty of Classifying ConceptNet Relations in a Multi-Label Classification Setting",
"authors": [
{
"first": "Maria",
"middle": [],
"last": "Becker",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Staniek",
"suffix": ""
},
{
"first": "Vivi",
"middle": [],
"last": "Nastase",
"suffix": ""
},
{
"first": "Anette",
"middle": [],
"last": "Frank",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of RELA-TIONS -Workshop on Meaning Relations between Phrases and Sentences",
"volume": "",
"issue": "",
"pages": "1--15",
"other_ids": {
"DOI": [
"10.18653/v1/W19-0801"
]
},
"num": null,
"urls": [],
"raw_text": "Maria Becker, Michael Staniek, Vivi Nastase, and Anette Frank. 2019. Assessing the Difficulty of Classifying ConceptNet Relations in a Multi-Label Classification Setting. In Proceedings of RELA- TIONS -Workshop on Meaning Relations between Phrases and Sentences, pages 1-15, Gothenburg, Sweden.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Dynamic neuro-symbolic knowledge graph construction for zero-shot commonsense question answering",
"authors": [
{
"first": "Antoine",
"middle": [],
"last": "Bosselut",
"suffix": ""
},
{
"first": ",",
"middle": [],
"last": "Ronan Le Bras",
"suffix": ""
},
{
"first": "Yejin",
"middle": [],
"last": "Choi",
"suffix": ""
}
],
"year": 2021,
"venue": "Proceedings of the 35th AAAI Conference on Artificial Intelligence (AAAI)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Antoine Bosselut, Ronan Le Bras, , and Yejin Choi. 2021. Dynamic neuro-symbolic knowledge graph construction for zero-shot commonsense question answering. In Proceedings of the 35th AAAI Con- ference on Artificial Intelligence (AAAI).",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "COMET: Commonsense transformers for automatic knowledge graph construction",
"authors": [
{
"first": "Antoine",
"middle": [],
"last": "Bosselut",
"suffix": ""
},
{
"first": "Hannah",
"middle": [],
"last": "Rashkin",
"suffix": ""
},
{
"first": "Maarten",
"middle": [],
"last": "Sap",
"suffix": ""
},
{
"first": "Chaitanya",
"middle": [],
"last": "Malaviya",
"suffix": ""
},
{
"first": "Asli",
"middle": [],
"last": "Celikyilmaz",
"suffix": ""
},
{
"first": "Yejin",
"middle": [],
"last": "Choi",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "4762--4779",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1470"
]
},
"num": null,
"urls": [],
"raw_text": "Antoine Bosselut, Hannah Rashkin, Maarten Sap, Chai- tanya Malaviya, Asli Celikyilmaz, and Yejin Choi. 2019. COMET: Commonsense transformers for au- tomatic knowledge graph construction. In Proceed- ings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 4762-4779, Florence, Italy. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Re-evaluating the role of Bleu in machine translation research",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Callison",
"suffix": ""
},
{
"first": "-",
"middle": [],
"last": "Burch",
"suffix": ""
},
{
"first": "Miles",
"middle": [],
"last": "Osborne",
"suffix": ""
},
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
}
],
"year": 2006,
"venue": "11th Conference of the European Chapter of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chris Callison-Burch, Miles Osborne, and Philipp Koehn. 2006. Re-evaluating the role of Bleu in ma- chine translation research. In 11th Conference of the European Chapter of the Association for Com- putational Linguistics, Trento, Italy. Association for Computational Linguistics.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Incorporating commonsense knowledge graph in pretrained models for social commonsense tasks",
"authors": [
{
"first": "Ting-Yun",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Karthik",
"middle": [],
"last": "Gopalakrishnan",
"suffix": ""
},
{
"first": "Behnam",
"middle": [],
"last": "Hedayatnia",
"suffix": ""
},
{
"first": "Pei",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Dilek",
"middle": [],
"last": "Hakkani-Tur",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of Deep Learning Inside Out (DeeLIO): The First Workshop on Knowledge Extraction and Integration for Deep Learning Architectures",
"volume": "",
"issue": "",
"pages": "74--79",
"other_ids": {
"DOI": [
"10.18653/v1/2020.deelio-1.9"
]
},
"num": null,
"urls": [],
"raw_text": "Ting-Yun Chang, Yang Liu, Karthik Gopalakrishnan, Behnam Hedayatnia, Pei Zhou, and Dilek Hakkani- Tur. 2020. Incorporating commonsense knowledge graph in pretrained models for social commonsense tasks. In Proceedings of Deep Learning Inside Out (DeeLIO): The First Workshop on Knowledge Ex- traction and Integration for Deep Learning Architec- tures, pages 74-79, Online. Association for Compu- tational Linguistics.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Attention guided graph convolutional networks for relation extraction",
"authors": [
{
"first": "Zhijiang",
"middle": [],
"last": "Guo",
"suffix": ""
},
{
"first": "Yan",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Wei",
"middle": [],
"last": "Lu",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "241--251",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1024"
]
},
"num": null,
"urls": [],
"raw_text": "Zhijiang Guo, Yan Zhang, and Wei Lu. 2019. Atten- tion guided graph convolutional networks for rela- tion extraction. In Proceedings of the 57th Annual Meeting of the Association for Computational Lin- guistics, pages 241-251, Florence, Italy. Association for Computational Linguistics.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "The argument reasoning comprehension task: Identification and reconstruction of implicit warrants",
"authors": [
{
"first": "Ivan",
"middle": [],
"last": "Habernal",
"suffix": ""
},
{
"first": "Henning",
"middle": [],
"last": "Wachsmuth",
"suffix": ""
},
{
"first": "Iryna",
"middle": [],
"last": "Gurevych",
"suffix": ""
},
{
"first": "Benno",
"middle": [],
"last": "Stein",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "1",
"issue": "",
"pages": "1930--1940",
"other_ids": {
"DOI": [
"10.18653/v1/N18-1175"
]
},
"num": null,
"urls": [],
"raw_text": "Ivan Habernal, Henning Wachsmuth, Iryna Gurevych, and Benno Stein. 2018. The argument reasoning comprehension task: Identification and reconstruc- tion of implicit warrants. In Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Volume 1 (Long Papers), pages 1930-1940, New Orleans, Louisiana. Associ- ation for Computational Linguistics.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Kartik Talamadupula, and Achille Fokoue. 2020. Infusing knowledge into the textual entailment task using graph convolutional networks",
"authors": [
{
"first": "Pavan",
"middle": [],
"last": "Kapanipathi",
"suffix": ""
},
{
"first": "Veronika",
"middle": [],
"last": "Thost",
"suffix": ""
},
{
"first": "Siva",
"middle": [],
"last": "Patel",
"suffix": ""
},
{
"first": "Spencer",
"middle": [],
"last": "Whitehead",
"suffix": ""
},
{
"first": "Ibrahim",
"middle": [],
"last": "Abdelaziz",
"suffix": ""
},
{
"first": "Avinash",
"middle": [],
"last": "Balakrishnan",
"suffix": ""
},
{
"first": "Maria",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Kshitij",
"middle": [],
"last": "Fadnis",
"suffix": ""
},
{
"first": "Chulaka",
"middle": [],
"last": "Gunasekara",
"suffix": ""
},
{
"first": "Bassem",
"middle": [],
"last": "Makni",
"suffix": ""
},
{
"first": "Nicholas",
"middle": [],
"last": "Mattei",
"suffix": ""
}
],
"year": null,
"venue": "Proceedings of the AAAI Conference on Artificial Intelligence",
"volume": "34",
"issue": "",
"pages": "8074--8081",
"other_ids": {
"DOI": [
"10.1609/aaai.v34i05.6318"
]
},
"num": null,
"urls": [],
"raw_text": "Pavan Kapanipathi, Veronika Thost, Siva Patel, Spencer Whitehead, Ibrahim Abdelaziz, Avinash Balakrishnan, Maria Chang, Kshitij Fadnis, Chulaka Gunasekara, Bassem Makni, Nicholas Mattei, Kar- tik Talamadupula, and Achille Fokoue. 2020. Infus- ing knowledge into the textual entailment task using graph convolutional networks. Proceedings of the AAAI Conference on Artificial Intelligence, 34:8074- 8081.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Commonsense knowledge base completion",
"authors": [
{
"first": "Xiang",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Aynaz",
"middle": [],
"last": "Taheri",
"suffix": ""
},
{
"first": "Lifu",
"middle": [],
"last": "Tu",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Gimpel",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1445--1455",
"other_ids": {
"DOI": [
"10.18653/v1/P16-1137"
]
},
"num": null,
"urls": [],
"raw_text": "Xiang Li, Aynaz Taheri, Lifu Tu, and Kevin Gimpel. 2016. Commonsense knowledge base completion. In Proceedings of the 54th Annual Meeting of the As- sociation for Computational Linguistics (Volume 1: Long Papers), pages 1445-1455, Berlin, Germany. Association for Computational Linguistics.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "KagNet: Knowledge-aware graph networks for commonsense reasoning",
"authors": [
{
"first": "Xinyue",
"middle": [],
"last": "Bill Yuchen Lin",
"suffix": ""
},
{
"first": "Jamin",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Xiang",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ren",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint Conference on Natural Language Processing (EMNLP-IJCNLP)",
"volume": "",
"issue": "",
"pages": "2829--2839",
"other_ids": {
"DOI": [
"10.18653/v1/D19-1282"
]
},
"num": null,
"urls": [],
"raw_text": "Bill Yuchen Lin, Xinyue Chen, Jamin Chen, and Xi- ang Ren. 2019. KagNet: Knowledge-aware graph networks for commonsense reasoning. In Proceed- ings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th Inter- national Joint Conference on Natural Language Pro- cessing (EMNLP-IJCNLP), pages 2829-2839, Hong Kong, China. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Can a suit of armor conduct electricity? a new dataset for open book question answering",
"authors": [
{
"first": "Todor",
"middle": [],
"last": "Mihaylov",
"suffix": ""
},
{
"first": "Peter",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "Tushar",
"middle": [],
"last": "Khot",
"suffix": ""
},
{
"first": "Ashish",
"middle": [],
"last": "Sabharwal",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "2381--2391",
"other_ids": {
"DOI": [
"10.18653/v1/D18-1260"
]
},
"num": null,
"urls": [],
"raw_text": "Todor Mihaylov, Peter Clark, Tushar Khot, and Ashish Sabharwal. 2018. Can a suit of armor conduct elec- tricity? a new dataset for open book question an- swering. In Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing, pages 2381-2391, Brussels, Belgium. Association for Computational Linguistics.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Ranking and selecting multi-hop knowledge paths to better predict human needs",
"authors": [
{
"first": "Debjit",
"middle": [],
"last": "Paul",
"suffix": ""
},
{
"first": "Anette",
"middle": [],
"last": "Frank",
"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": "3671--3681",
"other_ids": {
"DOI": [
"10.18653/v1/N19-1368"
]
},
"num": null,
"urls": [],
"raw_text": "Debjit Paul and Anette Frank. 2019. Ranking and se- lecting multi-hop knowledge paths to better predict human needs. In Proceedings of the 2019 Confer- ence of the North American Chapter of the Associ- ation for Computational Linguistics: Human Lan- guage Technologies, Volume 1 (Long and Short Pa- pers), pages 3671-3681, Minneapolis, Minnesota. Association for Computational Linguistics.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Social commonsense reasoning with multi-head knowledge attention",
"authors": [
{
"first": "Debjit",
"middle": [],
"last": "Paul",
"suffix": ""
},
{
"first": "Anette",
"middle": [],
"last": "Frank",
"suffix": ""
}
],
"year": 2020,
"venue": "Findings of the Association for Computational Linguistics: EMNLP 2020",
"volume": "",
"issue": "",
"pages": "2969--2980",
"other_ids": {
"DOI": [
"10.18653/v1/2020.findings-emnlp.267"
]
},
"num": null,
"urls": [],
"raw_text": "Debjit Paul and Anette Frank. 2020. Social common- sense reasoning with multi-head knowledge atten- tion. In Findings of the Association for Computa- tional Linguistics: EMNLP 2020, pages 2969-2980, Online. Association for Computational Linguistics.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Argumentative Relation Classification with Background Knowledge",
"authors": [
{
"first": "Debjit",
"middle": [],
"last": "Paul",
"suffix": ""
},
{
"first": "Juri",
"middle": [],
"last": "Opitz",
"suffix": ""
},
{
"first": "Maria",
"middle": [],
"last": "Becker",
"suffix": ""
},
{
"first": "Jonathan",
"middle": [],
"last": "Kobbe",
"suffix": ""
},
{
"first": "Graeme",
"middle": [],
"last": "Hirst",
"suffix": ""
},
{
"first": "Anette",
"middle": [],
"last": "Frank",
"suffix": ""
}
],
"year": 2020,
"venue": "Proceedings of the International Conference on Computational Models of Argument (COMMA)",
"volume": "",
"issue": "",
"pages": "319--330",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Debjit Paul, Juri Opitz, Maria Becker, Jonathan Kobbe, Graeme Hirst, and Anette Frank. 2020. Argu- mentative Relation Classification with Background Knowledge. In Proceedings of the International Conference on Computational Models of Argument (COMMA), pages 319-330, Online.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "An annotated corpus of argumentative microtexts",
"authors": [
{
"first": "Andreas",
"middle": [],
"last": "Peldszus",
"suffix": ""
},
{
"first": "Manfred",
"middle": [],
"last": "Stede",
"suffix": ""
}
],
"year": 2015,
"venue": "Argumentation and Reasoned Action: Proceedings of the 1st European Conference on Argumentation",
"volume": "2",
"issue": "",
"pages": "801--815",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Andreas Peldszus and Manfred Stede. 2016. An anno- tated corpus of argumentative microtexts. In Argu- mentation and Reasoned Action: Proceedings of the 1st European Conference on Argumentation, Lisbon 2015 / Vol. 2, pages 801-815, London. College Pub- lications.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Language Models are Unsupervised Multitask Learners",
"authors": [
{
"first": "Alec",
"middle": [],
"last": "Radford",
"suffix": ""
},
{
"first": "Jeffrey",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Rewon",
"middle": [],
"last": "Child",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Luan",
"suffix": ""
},
{
"first": "Dario",
"middle": [],
"last": "Amodei",
"suffix": ""
},
{
"first": "Ilya",
"middle": [],
"last": "Sutskever",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alec Radford, Jeffrey Wu, Rewon Child, David Luan, Dario Amodei, and Ilya Sutskever. 2019. Language Models are Unsupervised Multitask Learners.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Commonsense knowledge base completion and generation",
"authors": [
{
"first": "Itsumi",
"middle": [],
"last": "Saito",
"suffix": ""
},
{
"first": "Kyosuke",
"middle": [],
"last": "Nishida",
"suffix": ""
},
{
"first": "Hisako",
"middle": [],
"last": "Asano",
"suffix": ""
},
{
"first": "Junji",
"middle": [],
"last": "Tomita",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 22nd Conference on Computational Natural Language Learning",
"volume": "",
"issue": "",
"pages": "141--150",
"other_ids": {
"DOI": [
"10.18653/v1/K18-1014"
]
},
"num": null,
"urls": [],
"raw_text": "Itsumi Saito, Kyosuke Nishida, Hisako Asano, and Junji Tomita. 2018. Commonsense knowledge base completion and generation. In Proceedings of the 22nd Conference on Computational Natural Lan- guage Learning, pages 141-150, Brussels, Belgium. Association for Computational Linguistics.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter",
"authors": [
{
"first": "Victor",
"middle": [],
"last": "Sanh",
"suffix": ""
},
{
"first": "Lysandre",
"middle": [],
"last": "Debut",
"suffix": ""
},
{
"first": "Julien",
"middle": [],
"last": "Chaumond",
"suffix": ""
},
{
"first": "Thomas",
"middle": [],
"last": "Wolf",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "2",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Victor Sanh, Lysandre Debut, Julien Chaumond, and Thomas Wolf. 2019. Distilbert, a distilled version of bert: smaller, faster, cheaper and lighter. EMC2: 5th Edition. Co-located with NeurIPS'19.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Conceptnet 5.5: An open multilingual graph of general knowledge",
"authors": [
{
"first": "Robyn",
"middle": [],
"last": "Speer",
"suffix": ""
},
{
"first": "Joshua",
"middle": [],
"last": "Chin",
"suffix": ""
},
{
"first": "Catherine",
"middle": [],
"last": "Havasi",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, February 4-9",
"volume": "",
"issue": "",
"pages": "4444--4451",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Robyn Speer, Joshua Chin, and Catherine Havasi. 2017. Conceptnet 5.5: An open multilingual graph of gen- eral knowledge. In Proceedings of the Thirty-First AAAI Conference on Artificial Intelligence, Febru- ary 4-9, 2017, San Francisco, California, USA, pages 4444-4451. AAAI Press.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Neural relation extraction for knowledge base enrichment",
"authors": [
{
"first": "Gerhard",
"middle": [],
"last": "Bayu Distiawan Trisedya",
"suffix": ""
},
{
"first": "Jianzhong",
"middle": [],
"last": "Weikum",
"suffix": ""
},
{
"first": "Rui",
"middle": [],
"last": "Qi",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Zhang",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "229--240",
"other_ids": {
"DOI": [
"10.18653/v1/P19-1023"
]
},
"num": null,
"urls": [],
"raw_text": "Bayu Distiawan Trisedya, Gerhard Weikum, Jianzhong Qi, and Rui Zhang. 2019. Neural relation extrac- tion for knowledge base enrichment. In Proceed- ings of the 57th Annual Meeting of the Association for Computational Linguistics, pages 229-240, Flo- rence, Italy. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Take and took, gaggle and goose, book and read: Evaluating the utility of vector differences for lexical relation learning",
"authors": [
{
"first": "Ekaterina",
"middle": [],
"last": "Vylomova",
"suffix": ""
},
{
"first": "Laura",
"middle": [],
"last": "Rimell",
"suffix": ""
},
{
"first": "Trevor",
"middle": [],
"last": "Cohn",
"suffix": ""
},
{
"first": "Timothy",
"middle": [],
"last": "Baldwin",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1671--1682",
"other_ids": {
"DOI": [
"10.18653/v1/P16-1158"
]
},
"num": null,
"urls": [],
"raw_text": "Ekaterina Vylomova, Laura Rimell, Trevor Cohn, and Timothy Baldwin. 2016. Take and took, gaggle and goose, book and read: Evaluating the utility of vec- tor differences for lexical relation learning. In Pro- ceedings of the 54th Annual Meeting of the Associa- tion for Computational Linguistics (Volume 1: Long Papers), pages 1671-1682, Berlin, Germany. Asso- ciation for Computational Linguistics.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Connecting the dots: A knowledgeable path generator for commonsense question answering",
"authors": [
{
"first": "Peifeng",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Nanyun",
"middle": [],
"last": "Peng",
"suffix": ""
},
{
"first": "Filip",
"middle": [],
"last": "Ilievski",
"suffix": ""
},
{
"first": "Pedro",
"middle": [],
"last": "Szekely",
"suffix": ""
},
{
"first": "Xiang",
"middle": [],
"last": "Ren",
"suffix": ""
}
],
"year": 2020,
"venue": "EMNLP Findings",
"volume": "",
"issue": "",
"pages": "4129--4140",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peifeng Wang, Nanyun Peng, Filip Ilievski, Pedro Szekely, and Xiang Ren. 2020. Connecting the dots: A knowledgeable path generator for commonsense question answering. EMNLP Findings, pages 4129- 4140.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Dynamic Integration of Background Knowledge in Neural NLU Systems",
"authors": [
{
"first": "Dirk",
"middle": [],
"last": "Weissenborn",
"suffix": ""
},
{
"first": "Tomas",
"middle": [],
"last": "Kocisky",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Dyer",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dirk Weissenborn, Tomas Kocisky, and Chris Dyer. 2018. Dynamic Integration of Background Knowl- edge in Neural NLU Systems. ICLR 2018.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Enriching pretrained language model with entity information for relation classification",
"authors": [
{
"first": "Shanchan",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Yifan",
"middle": [],
"last": "He",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the 28th ACM International Conference on Information and Knowledge Management, CIKM '19",
"volume": "",
"issue": "",
"pages": "2361--2364",
"other_ids": {
"DOI": [
"10.1145/3357384.3358119"
]
},
"num": null,
"urls": [],
"raw_text": "Shanchan Wu and Yifan He. 2019. Enriching pre- trained language model with entity information for relation classification. In Proceedings of the 28th ACM International Conference on Informa- tion and Knowledge Management, CIKM '19, page 2361-2364, New York, NY, USA. Association for Computing Machinery.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Bertscore: Evaluating text generation with bert",
"authors": [
{
"first": "Tianyi",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Varsha",
"middle": [],
"last": "Kishore",
"suffix": ""
},
{
"first": "Felix",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Kilian",
"middle": [
"Q"
],
"last": "Weinberger",
"suffix": ""
},
{
"first": "Yoav",
"middle": [],
"last": "Artzi",
"suffix": ""
}
],
"year": 2020,
"venue": "ICLR",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tianyi Zhang, Varsha Kishore, Felix Wu, Kilian Q. Weinberger, and Yoav Artzi. 2020. Bertscore: Eval- uating text generation with bert. In ICLR.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "A Combination of RNN and CNN for Attentionbased Relation Classification",
"authors": [
{
"first": "Xiaobin",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Fucai",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Ruiyang",
"middle": [],
"last": "Huang",
"suffix": ""
}
],
"year": 2018,
"venue": "Procedia Computer Science",
"volume": "131",
"issue": "",
"pages": "911--917",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xiaobin Zhang, Fucai Chen, and Ruiyang Huang. 2018. A Combination of RNN and CNN for Attention- based Relation Classification. In Procedia Com- puter Science, volume 131, pages 911 -917.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Our framework CO-NNECT: It finds single-and multihop paths between concepts, as explicitations of implicit knowledge that connects sentences.",
"num": null,
"type_str": "figure",
"uris": null
},
"FIGREF1": {
"text": "Example generations from our three model types (first three instances from IKAT, last two from ARC).",
"num": null,
"type_str": "figure",
"uris": null
},
"TABREF1": {
"num": null,
"type_str": "table",
"content": "<table><tr><td>COMET, their combination (CO-NNECT), and ranking</td></tr><tr><td>CN-graphs (CN): number of concepts pairs between</td></tr><tr><td>which a link was found, and average number of hops</td></tr><tr><td>per path.</td></tr></table>",
"text": "Statistics of paths generated by COREC-LM,",
"html": null
},
"TABREF3": {
"num": null,
"type_str": "table",
"content": "<table><tr><td>: Manual evaluation of paths from COREC-LM,</td></tr><tr><td>COMET, ranked CN-graphs (CN), and CN-graphs with re-</td></tr><tr><td>placed vague relations</td></tr></table>",
"text": "",
"html": null
},
"TABREF4": {
"num": null,
"type_str": "table",
"content": "<table><tr><td>COR</td><td>COM</td><td>CONN CN</td><td>CN-r</td></tr><tr><td>(a)</td><td/><td/><td/></tr></table>",
"text": "Generated Paths vs. Silver Paths IKAT .61/.85 .54/.82 .62/.84 .57/.78 .58/.80 ARC .41/.84 .39/.82 .42/.86 .40/.77 .40/.78 (b) Generated Paths-NL vs. Gold-NL IKAT .69/.81 .65/.83 .70/.81 .65/.75 .69/.76 ARC .72/.81 .66/.82 .72/.81 .71/.75 .77/.76 (c) Generated Paths vs. Gold Paths IKAT .57/.78 .49/.78 .58/.79 .66/.73 .67/.74",
"html": null
},
"TABREF5": {
"num": null,
"type_str": "table",
"content": "<table/>",
"text": "Comparing generated paths to implicit knowledge annotations on IKAT and ARC, measured by Cosim/BERTScore (F1).",
"html": null
}
}
}
} |