File size: 133,874 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 | {
"paper_id": "P16-1012",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:59:52.357092Z"
},
"title": "Language Transfer Learning for Supervised Lexical Substitution",
"authors": [
{
"first": "Gerold",
"middle": [],
"last": "Hintz",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Chris",
"middle": [],
"last": "Biemann",
"suffix": "",
"affiliation": {},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We propose a framework for lexical substitution that is able to perform transfer learning across languages. Datasets for this task are available in at least three languages (English, Italian, and German). Previous work has addressed each of these tasks in isolation. In contrast, we regard the union of three shared tasks as a combined multilingual dataset. We show that a supervised system can be trained effectively, even if training and evaluation data are from different languages. Successful transfer learning between languages suggests that the learned model is in fact independent of the underlying language. We combine state-of-the-art unsupervised features obtained from syntactic word embeddings and distributional thesauri in a supervised delexicalized ranking system. Our system improves over state of the art in the full lexical substitution task in all three languages.",
"pdf_parse": {
"paper_id": "P16-1012",
"_pdf_hash": "",
"abstract": [
{
"text": "We propose a framework for lexical substitution that is able to perform transfer learning across languages. Datasets for this task are available in at least three languages (English, Italian, and German). Previous work has addressed each of these tasks in isolation. In contrast, we regard the union of three shared tasks as a combined multilingual dataset. We show that a supervised system can be trained effectively, even if training and evaluation data are from different languages. Successful transfer learning between languages suggests that the learned model is in fact independent of the underlying language. We combine state-of-the-art unsupervised features obtained from syntactic word embeddings and distributional thesauri in a supervised delexicalized ranking system. Our system improves over state of the art in the full lexical substitution task in all three languages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "The lexical substitution task is defined as replacing a target word in a sentence context with a synonym, which does not alter the meaning of the utterance. Although this appears easy to humans, automatically performing such a substitution is challenging, as it implicitly addresses the problem of both determining semantically similar substitutes, as well as resolving the ambiguity of polysemous words. In fact, lexical substitution was originally conceived as an extrinsic evaluation of Word Sense Disambiguation (WSD) when first proposed by McCarthy & Navigli (2007) . However, a system capable of replacing words by appropriate meaning-preserving substitutes can be utilized in downstream tasks that require paraphrasing of input text. Examples of such use cases include text simplification, text shortening, and summarization. Furthermore, lexical substitution can be regarded as an alternative to WSD in downstream tasks requiring word disambiguation. For example, it was successfully applied in Semantic Textual Similarity (B\u00e4r et al., 2012) . A given list of substitution words can be regarded as a vector representation modeling the meaning of a word in context. As opposed to WSD systems, this is not reliant on a predefined sense inventory, and therefore does not have to deal with issues of coverage, or sense granularity. On the other hand, performing lexical substitution is more complex than WSD, as a system has to both generate and rank a list of substitution candidates per instance.",
"cite_spans": [
{
"start": 545,
"end": 570,
"text": "McCarthy & Navigli (2007)",
"ref_id": "BIBREF23"
},
{
"start": 1031,
"end": 1049,
"text": "(B\u00e4r et al., 2012)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Over the last decade, a number of shared tasks in lexical substitution has been organized and a wide range of methods have been proposed. Although many approaches are in fact languageindependent, most existing work is tailored to a single language and dataset. In this work, we investigate lexical substitution as a multilingual task, and report experimental results for English, German and Italian datasets. We consider a supervised approach to lexical substitution, which casts the task as a ranking problem (Szarvas et al., 2013b) . We adapt state-of-the-art unsupervised features (Biemann and Riedl, 2013; Melamud et al., 2015a) in a delexicalized ranking framework and perform transfer learning experiments by training a ranker model from a different language. Finally, we demonstrate the utility of aggregating data from different languages and train our model on this single multilingual dataset. We are able to improve the state of the art for the full task on all datasets.",
"cite_spans": [
{
"start": 510,
"end": 533,
"text": "(Szarvas et al., 2013b)",
"ref_id": "BIBREF42"
},
{
"start": 584,
"end": 609,
"text": "(Biemann and Riedl, 2013;",
"ref_id": "BIBREF5"
},
{
"start": 610,
"end": 632,
"text": "Melamud et al., 2015a)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The remainder of this paper is structured as follows. In Section 2 we elaborate on the lexical sub-stitution task and datasets. Section 3 shows related work of systems addressing each of these tasks. In Section 4 we describe our method for building a supervised system capable of transfer learning. Section 5 shows our experimental results and discussion. Finally in Section 6 we give a conclusion and outlook to future work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The lexical substitution task was first defined at SemEval 2007 (McCarthy and Navigli, 2007, \"SE07\") . A lexical sample of target word is selected from different word classes (nouns, verbs, and adjectives). Through annotation, a set of valid substitutes was collected for 10-20 contexts per target. Whereas in the original SE07 task, annotators were free to provide \"up to three, but all equally good\" substitutes, later tasks dropped this restriction. Substitutes were subsequently aggregated by annotator frequency, creating a ranking of substitutes. The use of SE07 has become a de-facto standard for system comparison, however equivalent datasets have been produced for other languages. Evalita 2009 posed a lexical substitution task for Italian (Toral, 2009, \"EL09\") . Participants were free to obtain a list of substitution candidates in any way, most commonly Italian WordNet 1 was used. A WeightedSense baseline provided by the organizers proved very strong, as all systems scored below it. This baseline is obtained by aggregating differently weighted semantic relations from multiple human-created lexical resources (Ruimy et al., 2002) . A German version of the lexical substitution task was organized at GermEval 2015 (Cholakov et al., 2014; Miller et al., 2015 , \"GE15\"). Likewise, WeightedSense was able to beat both of two participating systems in oot evaluations (Miller et al., 2015) . A variation for cross-lingual lexical substitution was proposed by Mihalcea et al. (2010) , in which substitute words are required in a different language than the source sentence. The sentence context as well as the target word were given in English, whereas the substitute words should be provided in Spanish (annotators were fluent in both languages). This variant is motivated by direct application in Machine Translation systems, or as an aid for human-based translation. There also ex-ists a larger crowd-sourced dataset of 1012 nouns (Biemann, 2013, \"TWSI\") , as well as an all-words dataset in which all words in each sentence are annotated with lexical expansions (Kremer et al., 2014) . Evaluation of lexical substitution adheres to metrics defined by SE07 (McCarthy and Navigli, 2007) , who provide two evaluation settings 2 ; best evaluating only a system's \"best guess\" of a single target substitute and oot, an unordered evaluation of up to ten substitutes. Thater et. al (2009) proposed to use Generalized Average Precision (GAP), to compare an output ranking rather than unordered sets of substitutes.",
"cite_spans": [
{
"start": 51,
"end": 77,
"text": "SemEval 2007 (McCarthy and",
"ref_id": null
},
{
"start": 78,
"end": 100,
"text": "Navigli, 2007, \"SE07\")",
"ref_id": null
},
{
"start": 750,
"end": 771,
"text": "(Toral, 2009, \"EL09\")",
"ref_id": null
},
{
"start": 1126,
"end": 1146,
"text": "(Ruimy et al., 2002)",
"ref_id": "BIBREF38"
},
{
"start": 1230,
"end": 1253,
"text": "(Cholakov et al., 2014;",
"ref_id": "BIBREF11"
},
{
"start": 1254,
"end": 1273,
"text": "Miller et al., 2015",
"ref_id": "BIBREF30"
},
{
"start": 1379,
"end": 1400,
"text": "(Miller et al., 2015)",
"ref_id": "BIBREF30"
},
{
"start": 1470,
"end": 1492,
"text": "Mihalcea et al. (2010)",
"ref_id": "BIBREF27"
},
{
"start": 1944,
"end": 1967,
"text": "(Biemann, 2013, \"TWSI\")",
"ref_id": null
},
{
"start": 2076,
"end": 2097,
"text": "(Kremer et al., 2014)",
"ref_id": "BIBREF21"
},
{
"start": 2170,
"end": 2198,
"text": "(McCarthy and Navigli, 2007)",
"ref_id": "BIBREF23"
},
{
"start": 2375,
"end": 2395,
"text": "Thater et. al (2009)",
"ref_id": "BIBREF43"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Lexical substitution datasets and evaluation",
"sec_num": "2"
},
{
"text": "The proposed lexical substitution datasets (SE07, EL09, GE15) differ in their degree of ambiguity of target items. If a dataset contains mostly target words that are unambiguous, substitution lists of different instances of the same target are similar, despite occurring in different context. We can quantify this degree of variation by measuring the overlap of gold substitutes of each target across all contexts. For this, we adapt the pairwise agreement (PA) metric defined by McCarthy & Navigli (2009) . Instead of inter-annotator agreement we measure agreement across different context instances. Let T be a set of lexical target words, and D dataset of instances (t i , S i ) \u2208 D, in which target t i \u2208 T is annotated with a set of substitutes S i . Then we regard for each target word t the substitute sets S t \u2282 D for t. We define a substitute agreement as SA (t) as the mean pairwise dice coefficient between all s 1 , s 2 \u2208 S t where s 1 = s 2 . For each dataset D we list the substitute variance SV = 1 \u2212 1 |T | \u2211 t\u2208T SA (t). Table 1 shows this metric for the three datasets, as well as for subsets of the dataset according to target part of speech. It can be seen that the variance in gold substitutes differs substantially between datasets, but not much between target word type within a dataset. EL09 has the highest degree of variance, suggesting that targets tend to be more ambiguous, whereas GE15 has the lowest degree of variance, suggesting less ambiguity.",
"cite_spans": [
{
"start": 480,
"end": 505,
"text": "McCarthy & Navigli (2009)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [
{
"start": 1037,
"end": 1044,
"text": "Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Dataset comparison",
"sec_num": null
},
{
"text": "Lexical substitution has been addressed extensively in recent years. Early systems, having only very few training instances available, use un- (Fellbaum, 1998) and cast lexical substitution into a ranking task. Experiments may also be performed by pooling the set of candidates from the gold data, evaluating a pure ranking variant. Early approaches use a contextualized word instance representation and rank candidates according to their similarity to this representation. Effective representations are syntactic vector space models (Erk and Pad\u00f3, 2008; Thater et al., 2011) , which use distributional sparse vector representations based on the syntactic context of words. Performance improvement could be shown for different models, including the use of graph centrality algorithms on directional word similarity graphs (Sinha and Mihalcea, 2011) , and clustering approaches on word instance representations (Erk and Pad\u00f3, 2010) . Multiple systems have built upon the distributional approach. Extensions include the use of LDA topic models (\u00d3 S\u00e9aghdha and Korhonen, 2014), and probabilistic graphical models (Moon and Erk, 2013) . The current state of the art combines a distributional model with the use of n-gram language models (Melamud et al., 2015a) . They define the context vector of each word in a background corpus as a substitute vector, which is a vector of suitable filler words for the current n-gram context. They then obtain a contextualized paraphrase vector by computing a weighted average of substitute vectors in the background corpus, based on their similarity to the current target instance. In contrast to traditional sparse vector representations obtained through distributional methods, a recent trend is the use of low-dimensional dense vector representations. The use of such vector representations or word embeddings has been popularized by the continuous bag-of-words (CBOW) and Skip-gram model (Mikolov et al., 2013a) . Melamud et al. (2015b) show a simple and knowledge-lean model for lexical substitution based solely on syntactic word embeddings. As we leverage this model as a feature in our approach, we will elaborate on this in Section 4. Another approach for applying word embeddings to lexical substitution is their direct extension with multiple word senses, which can be weighted according to target context (Neelakantan et al., 2014) . Biemann (2013) first showed that the lexical substitution task can be solved very well when sufficient amount of training data is collected per target. An approach based on crowdsourcing human judgments achieved the best performance on the S07 dataset to day. However, judgments had to be collected for each lexical item, and as a consequence the approach can not scale to an open vocabulary. As an alternative to per-word supervised systems trained on target instances per lexeme, allwords systems aim to generalize over all lexical items. Szarvas et al. (2013a) proposed such a system by using delexicalization: features are generalized in such a way that they are independent of lexical items, and thus generalize beyond the training set and across targets. Originally, a maximum entropy classifier was trained on target-substitute instances and used for pointwise ranking of substitution candidates. In a follow-up work it was shown that learning-to-rank methods could drastically improve this approach, achieving state-ofthe-art performance with a LambdaMART ranker (Szarvas et al., 2013b) . In this work we will build upon this model and further generalize not only across lexical items but across different languages.",
"cite_spans": [
{
"start": 143,
"end": 159,
"text": "(Fellbaum, 1998)",
"ref_id": null
},
{
"start": 534,
"end": 554,
"text": "(Erk and Pad\u00f3, 2008;",
"ref_id": "BIBREF13"
},
{
"start": 555,
"end": 575,
"text": "Thater et al., 2011)",
"ref_id": "BIBREF44"
},
{
"start": 822,
"end": 848,
"text": "(Sinha and Mihalcea, 2011)",
"ref_id": "BIBREF40"
},
{
"start": 910,
"end": 930,
"text": "(Erk and Pad\u00f3, 2010)",
"ref_id": "BIBREF14"
},
{
"start": 1110,
"end": 1130,
"text": "(Moon and Erk, 2013)",
"ref_id": "BIBREF31"
},
{
"start": 1233,
"end": 1256,
"text": "(Melamud et al., 2015a)",
"ref_id": "BIBREF25"
},
{
"start": 1925,
"end": 1948,
"text": "(Mikolov et al., 2013a)",
"ref_id": "BIBREF28"
},
{
"start": 1951,
"end": 1973,
"text": "Melamud et al. (2015b)",
"ref_id": "BIBREF26"
},
{
"start": 2350,
"end": 2376,
"text": "(Neelakantan et al., 2014)",
"ref_id": "BIBREF32"
},
{
"start": 2379,
"end": 2393,
"text": "Biemann (2013)",
"ref_id": "BIBREF7"
},
{
"start": 2920,
"end": 2942,
"text": "Szarvas et al. (2013a)",
"ref_id": "BIBREF41"
},
{
"start": 3450,
"end": 3473,
"text": "(Szarvas et al., 2013b)",
"ref_id": "BIBREF42"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "3"
},
{
"text": "For both EL09 and GE15, existing approaches have been adapted. For the Italian dataset, a distributional method was combined with LSA (De Cao and Basili, 2009) . The best performing system applied a WSD system and language models (Basile and Semeraro, 2009) . For the German dataset, Hintz and Biemann (2015) adapted the supervised approach by (Szarvas et al., 2013a) , achieving best performance for nouns and adjectives. Jackov (2015) used a deep semantic analysis framework employing an internal dependency relation knowledge base, which achieved the best performance for verbs.",
"cite_spans": [
{
"start": 134,
"end": 159,
"text": "(De Cao and Basili, 2009)",
"ref_id": "BIBREF12"
},
{
"start": 230,
"end": 257,
"text": "(Basile and Semeraro, 2009)",
"ref_id": null
},
{
"start": 284,
"end": 308,
"text": "Hintz and Biemann (2015)",
"ref_id": "BIBREF19"
},
{
"start": 344,
"end": 367,
"text": "(Szarvas et al., 2013a)",
"ref_id": "BIBREF41"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "3"
},
{
"text": "tutes s \u2208 C t , where C t is a static per-target candidate list. Our method is agnostic to the creation of this static resource, which can be obtained either by an unsupervised similarity-based approach, or from a lexical resource. In particular, candidates obtained at this stage do not disambiguate possible multiple senses of t, and are filtered and ordered in the ranking stage by a supervised model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "3"
},
{
"text": "In modeling a supervised system, we have experimented with two learning setups. The first is applying a standard classification / regression learner. Here, lexical substitution is cast into a pointwise ranking task by training on targetsubstitute pairs generated from the gold standard. For each sentence context c, target word t and substitute s, we regard the tuple (c,t, s) as a training instance. We obtain these training instances for each lexsub instance (c,t) by considering all substitutes s \u2208 G t \u222aC t where G t are all candidates for target t pooled from the gold data and C t are obtained from lexical resources. We then experiment with two labeling alternatives for a binary classification and a regression setup, respectively. For binary classification we label each instance (c,t, s) as positive if s has been suggested as a substitute for t by at least one annotator, and as negative otherwise. For regression, we normalize the annotation counts for each substitute to obtain a score in (0, 1] if a substitute s occurs in the gold data, 0 otherwise. The ranking of substitutes per target is obtained by considering the posterior likelihood of the positive label as yielded by a classifier model. We have tried multiple classifiers but have found no significant improvement over a maximum entropy baseline 3 . Our second setup is a learningto-rank framework, adapted from (Szarvas et al., 2013b) . Here, we are not restricted to a pointwise ranking model, but consider pairwise and listwise models 4 .",
"cite_spans": [
{
"start": 1386,
"end": 1409,
"text": "(Szarvas et al., 2013b)",
"ref_id": "BIBREF42"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "3"
},
{
"text": "We base our feature model on existing research. In addition to basic syntactic and frequency-based features, we obtained sophisticated features from trigram and syntactic thesauri, motivated by the findings of Biemann and Riedl (2013) We confirm earlier research (Sinha and Mihalcea, 2009) on the high quality of selecting candidates from lexical resources. We thus base our candidate selection on prevalently used resources: WordNet (Fellbaum, 1998) for English, GermaNet (Hamp and Feldweg, 1997) for German and MultiWord-Net (Pianta et al., 2002) for Italian. For all resources, we consider all possible senses for a given target word and obtain all synonyms, hypernyms and hyponyms and their transitive hull. Thus, for the hypernymy and hyponymy relation, we follow the respective edges in the graph collecting all nodes (synsets) along the path. For each synset, we extract all lemmas as substitution candidates.",
"cite_spans": [
{
"start": 210,
"end": 234,
"text": "Biemann and Riedl (2013)",
"ref_id": "BIBREF5"
},
{
"start": 263,
"end": 289,
"text": "(Sinha and Mihalcea, 2009)",
"ref_id": "BIBREF39"
},
{
"start": 434,
"end": 450,
"text": "(Fellbaum, 1998)",
"ref_id": null
},
{
"start": 473,
"end": 497,
"text": "(Hamp and Feldweg, 1997)",
"ref_id": "BIBREF17"
},
{
"start": 527,
"end": 548,
"text": "(Pianta et al., 2002)",
"ref_id": "BIBREF36"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "3"
},
{
"text": "Although restricting candidates incurs a relatively low upper bound on system recall, we still obtain best results using this rather conservative filter. Table 2 shows the upper bound for system recall for each of the datasets, evaluated with and without removing all multiword expressions from both candidate lists and gold data. A higher coverage of WordNet is a plausible explanation for the much higher recall on the English data.",
"cite_spans": [],
"ref_spans": [
{
"start": 154,
"end": 161,
"text": "Table 2",
"ref_id": "TABREF3"
}
],
"eq_spans": [],
"section": "Related Work",
"sec_num": "3"
},
{
"text": "Learning-to-rank methods train a supervised model for ranking a list of items by relevance. A basic pointwise approach applies regression techniques to obtain a relevance scores for each item in isolation. More advanced models are based on pairwise preference information for instance pairs, and listwise approaches, which are optimized on a global metric of a given ranking output. An extensive overview of learning-to-rank models can be found in (Burges, 2010). For lexical substitution, LambdaMART (Wu et al., 2010) has been found to be particularly effective. LambdaMART is a listwise method based on gradient boosting of regression trees. Its two main hyperparameters are the number of leaves in each regression tree and the number of iterations and trees. We have not performed extensive tuning of these hyperparameters and used default settings, an ensemble of 1000 trees with 10 leaves.",
"cite_spans": [
{
"start": 501,
"end": 518,
"text": "(Wu et al., 2010)",
"ref_id": "BIBREF46"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Supervised ranking",
"sec_num": "4.2"
},
{
"text": "The idea of delexicalization has been proposed, for instance, by Bergsma et al. (2007) . They propose to use statistical measures based solely on the frequency of different expansions of the same target term. Their feature set has motivated a large subset of the feature model, which we adapt in this work. The idea of generalizing features for lexical substitution in such a way that they work across lexical items has been shown by Moon and Erk (2013) , and made explicit by Szarvas et al. (2013a) . Instances are characterized using non-lexical features from heterogeneous evidence. The intuition of this feature model is to exploit redundant signals of substitutability from different sources and methods.",
"cite_spans": [
{
"start": 65,
"end": 86,
"text": "Bergsma et al. (2007)",
"ref_id": "BIBREF4"
},
{
"start": 434,
"end": 453,
"text": "Moon and Erk (2013)",
"ref_id": "BIBREF31"
},
{
"start": 477,
"end": 499,
"text": "Szarvas et al. (2013a)",
"ref_id": "BIBREF41"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Delexicalized features",
"sec_num": "4.3"
},
{
"text": "In cases where background corpora are required, the following data is used throughout all features: For English, a newspaper corpus compiled from 105 million sentences from the Leipzig Corpora Collection (Richter et al., 2006) and the Gigaword corpus (Parker et al., 2011) was used. For German a 70M sentence newswire corpus (Biemann et al., 2007) was used. For Italian, a subset of 40M sentences of itWac, a large webcrawl, was used (Baroni et al., 2009) .",
"cite_spans": [
{
"start": 204,
"end": 226,
"text": "(Richter et al., 2006)",
"ref_id": "BIBREF37"
},
{
"start": 251,
"end": 272,
"text": "(Parker et al., 2011)",
"ref_id": "BIBREF34"
},
{
"start": 325,
"end": 347,
"text": "(Biemann et al., 2007)",
"ref_id": "BIBREF6"
},
{
"start": 434,
"end": 455,
"text": "(Baroni et al., 2009)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Delexicalized features",
"sec_num": "4.3"
},
{
"text": "We apply a partof-speech tagger trained on universal POS tags (Petrov et al., 2012 ), which we simplify into the classes noun, verb, adjective and adverb. Using these simplified tags we construct an n-gram sliding window, with n \u2208 [1..5], of POS around the target. We could also reduce window sizes drastically to n = 1,2 without sacrificing performance.",
"cite_spans": [
{
"start": 62,
"end": 82,
"text": "(Petrov et al., 2012",
"ref_id": "BIBREF35"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Shallow syntactic features",
"sec_num": null
},
{
"text": "We use language models for each of the languages to obtain frequency ratio features. An n-gram sliding window around a target t is used to generate a set of features freq(c l ,s,c r ) freq(c l ,t,c r ) , where c l and c r are the left and right context words around t. Here, we normalize the frequency of the substitute with the frequency of the n-gram with original target t. As a variant, we further normalize frequencies by the set of all substitutes, to obtain frequencies features freq(c l ,s,c r ) \u2211 s \u2208C t freq(c l ,s ,c r ) where C t is the set of candidate substitutes for t. In our experiments we used sliding windows of size [1..5].",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Frequency features",
"sec_num": null
},
{
"text": "We obtain 5-gram counts from web1t (Brants and Franz, 2009) .",
"cite_spans": [
{
"start": 35,
"end": 59,
"text": "(Brants and Franz, 2009)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Frequency features",
"sec_num": null
},
{
"text": "Conjunction ratio features Based on the ngram resources above, we further define a conjunctive phrase ratio feature, which measures how often the construct (c l ,t, conjunction, s, c r ) occurs in a background corpus; i.e. how often t and s cooccur with a conjunction word (\"and\", \"or\", \",\"), within the context of the sentence. As there is a different set of conjunction words for each language, we first aggregate the mean over all conjunction words:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Frequency features",
"sec_num": null
},
{
"text": "conj l,r (t, s) = 1 |CONJ| \u2211 con\u2208CONJ freq (c l ,t, con, s, c r )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Frequency features",
"sec_num": null
},
{
"text": "where l and r is the size of the left and right context window, and CONJ is a set of conjunction words per-language 5 . For left and right context size l = r = 0 this feature also captures a contextindependent conjunction co-occurrence between only t and s. Again, we normalize this feature over the set of all candidates:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Frequency features",
"sec_num": null
},
{
"text": "conj l,r (t, s) \u2211 s \u2208C t conj l,r (t, s)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Frequency features",
"sec_num": null
},
{
"text": "Distributional features We construct a distributional thesaurus (DT) for each of the languages by following Biemann and Riedl (2013) and obtain first-order word-to-context measures, as well as second-order word-to-word similarity measures. As context features we have experimented with both syntactic dependencies as well as left and right neighboring words, and have found them to perform equivalently. As a salience measure we use Lexicographer's Mutual Information (Bordag, 2008) and prune the data, keeping only the 1000 most salient features per word. Word similarity is obtained from an overlap count in the pruned context features. We model features for the contextualized distributional similarity between t and s as",
"cite_spans": [
{
"start": 108,
"end": 132,
"text": "Biemann and Riedl (2013)",
"ref_id": "BIBREF5"
},
{
"start": 468,
"end": 482,
"text": "(Bordag, 2008)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Frequency features",
"sec_num": null
},
{
"text": "\u2022 percentage of shared context features for the top-k context features of t and s, globally and restricted to sentence context (k =5, 20, 50, 100, 200)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Frequency features",
"sec_num": null
},
{
"text": "\u2022 percentage of shared words for the top-k similar words of t and s (k =200)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Frequency features",
"sec_num": null
},
{
"text": "\u2022 sum of salience score of context features of s overlapping with the sentence context",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Frequency features",
"sec_num": null
},
{
"text": "\u2022 binary occurrence of s in top-k similar words of t (k =100, 200)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Frequency features",
"sec_num": null
},
{
"text": "With the exception of the last feature, these measures are scaled to [0, 1] over the set of all substitute candidates.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Frequency features",
"sec_num": null
},
{
"text": "We adapt the unsupervised approach by (Melamud et al., 2015a) as a set of features. We follow (Levy and Goldberg, 2014) to construct dependency-based word embeddings; we obtain syntactic contexts by running a syntactic dependency parser 6 , and computing word embeddings using dependency edges as context features 7 . The resulting dense vector representations for words and context live within the same vector space. We compute the semantic similarity between a target and a substitute word from the cosine similarity in the word embedding space, as well as the first-order target-to-context similarity. For a given target word t and substitute s, let C t be the syntactic context of t and c \u2208 C t a single context -i.e. a dependency edge attached to t; let v t , v s be the vector representations of t and s in the word embedding space, and v c the vector representation of c in the context embedding space. Then",
"cite_spans": [
{
"start": 38,
"end": 61,
"text": "(Melamud et al., 2015a)",
"ref_id": "BIBREF25"
},
{
"start": 94,
"end": 119,
"text": "(Levy and Goldberg, 2014)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic word embeddings",
"sec_num": null
},
{
"text": "Sim 1 = cos (v s , v c ) and Sim 2 = cos (v s , v t )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic word embeddings",
"sec_num": null
},
{
"text": "are the first-order and second-order substitutability measures considered by Melamud et al. (2015a) . In contrast to their approach, we do not just consider an unsupervised combination of these two measures, but instead use both Sim 1 and Sim 2 as single features. We also use their combinations of a balanced / unbalanced, arithmetic / geometrical mean, to obtain six numeric features in total. Importantly, these features are independent of the underlying embedding vectors and can therefore generalize across arbitrary embeddings between languages.",
"cite_spans": [
{
"start": 77,
"end": 99,
"text": "Melamud et al. (2015a)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic word embeddings",
"sec_num": null
},
{
"text": "Semantic resource features To generalize across multiple languages we minimize the complexity of features obtained from semantic resources -which may differ notably in size and structure. From the resources listed in Section 4.1 we extract binary features for the semantic relations synonymy, hypernymy and hyponymy, occurring between t and s. We have also experimented with graded variants for transitive relations, such as encoding n-th level hypernymy, but have not observed any gain from this feature variation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Syntactic word embeddings",
"sec_num": null
},
{
"text": "Transfer learning is made feasible by a fully lexeme-independent and language-independent feature space. Language-specific knowledge resides only within the respective resources for each language, and gets abstracted in feature extraction. Figure 1 illustrates this process at the example of two entirely unrelated sentences in different languages (English and German). A further mediator for transfer learning is a model based on boosted decision trees. As opposed to linear models, which could not be reasonably learned across languages, a LambdaMART ranker is able to learn feature interaction across languages. To give an example of what the resulting model can pick up on, we can regard conditionally strong features. Consider the n-gram pair frequency ratio feature of window size (l, r) = (1, 0), which compares the frequency ratio of the target and substitute including a single left context word. Depending on the POS window, this feature can be highly informative in some cases, where it is less informative in others. For adjective-noun pairs, in which the noun is the substitution target, the model can learn that this frequency ratio is strongly positively correlated; in this case, the substitute frequently occurs with the same adjective than the original target. For other POS windows, for example determiner-noun pairs, the same frequency ratio may be less indicative, as most nouns frequently occur with a determiner. This property works across languages, as long as as attributive adjectives are prepositioned. In our subset of languages, this is the case for English and German, but not for Italian, which uses postpositive adjectives. Nevertheless, we are able to learn such universal feature interactions. Figure 1 : Visualization of feature extraction and delexicalization. Two unrelated sentences in English and German (translation: \"the strain has to be limited\") are shown. Language-specific knowledge is obtained from resources for each language respectively. The resulting feature space is delexicalized and language independent.",
"cite_spans": [],
"ref_spans": [
{
"start": 240,
"end": 248,
"text": "Figure 1",
"ref_id": null
},
{
"start": 1728,
"end": 1736,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Transfer learning",
"sec_num": "4.4"
},
{
"text": "throughout previous work and comparability is not always guaranteed. We follow the convention of reporting the full lexical substitution task (both generating and ranking candidates) with the metrics P-best and P-oot and report the ranking-only task (candidates pooled from the gold standard) with the GAP score. We further observe that previous work commonly discards multiword expressions from both the candidate lists as well as the gold data 8 . We follow this convention, but note that our system is in fact capable of successfully ranking multiword expansions out of the box. System performance slightly decreases when including MWE, as there is virtually no overlap between those provided by the system and those in the gold standard. For ranking we experiment with different pointwise classifiers as provided by Mallet (MaxEnt classification and regression) as well learning-torank models provided by RankLib (RankBoost, RankNet, LambdaMART). In line with findings in (Szarvas et al., 2013b) , we observe that learningto-rank approaches work better than a pointwise classification / regression setup throughout all languages and feature subsets. Among different rankers, we confirm LambdaMART to yield the best performance, and will only report numbers using this model. As optimization metric we have explored both NDCG@10 and MAP. The NDCG metric can incorporate different scoring weights Open evaluation (best-P / oot-P) based on annotator overlap, however MAP directly correlates with evaluation score. We have found optimizing on MAP to yield slightly better results, even if this disregards the relative score weights between gold substitutes. For the rankingonly task, we also extended the pooled training data with additional negative examples (i.e. adding all candidates as for the full task) but observed a minor decrease in system performance.",
"cite_spans": [
{
"start": 976,
"end": 999,
"text": "(Szarvas et al., 2013b)",
"ref_id": "BIBREF42"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Transfer learning",
"sec_num": "4.4"
},
{
"text": "We report transfer learning results across all three datasets. Table 3 shows a transfer-learning matrix for the full lexical substitution task, whereas Table 4 shows results for the ranking-only task. For evaluation, we consistently use the complete datasets, which are roughly equal in size for all languages (~2000 instances). For the identity entries in this matrix, as well as training on the complete dataset (\"all\") we follow previous supervised work and perform 10-fold cross-validation. Splits are based on the target lexeme, so that no two instances for the same target word are in different sets. Tables 3 and 4 suggest the feasibility of transfer learning. Although models trained on the original language (identity entries of the matrix) perform best, training on a different language still yields reasonable results. Training only on a single other language, not surprisingly, yields worse results for each dataset, however combining the data from the two remaining languages (\"others\") can mitigate this issue to some degree. Importantly, adding the data from two additional languages consistently improves system performance throughout all datasets for the open candidate task (Table 3) . It is interesting to note that in case of SE07, training on only other languages performs surprisingly well for the best-P score, beating even a model trained on English. A possible explanation for this is that the SE07 dataset appears to be somewhere in the middle between EL09 and GE15 in terms of substitute variance. For the rankingonly task, transfer learning seems to work a little less effectively. In case of German, adding foreign language data in fact hurts GAP performance. This potentially originates from a much smaller set of training instances and inconsistency of the amount and overlap of pooled candidates across different tasks (as described in Table 1 ). We also observe that a learning-to-rank model is essential for performing transfer learning. In case of LambdaMART, an ensemble of decision trees is constructed, which is well suited to exploit redundant signals across multiple features. Linear models resulted in worse performance for transfer learning, as the resulting weights seem to be language-specific.",
"cite_spans": [],
"ref_spans": [
{
"start": 63,
"end": 70,
"text": "Table 3",
"ref_id": "TABREF5"
},
{
"start": 152,
"end": 159,
"text": "Table 4",
"ref_id": "TABREF6"
},
{
"start": 607,
"end": 621,
"text": "Tables 3 and 4",
"ref_id": "TABREF5"
},
{
"start": 1192,
"end": 1201,
"text": "(Table 3)",
"ref_id": "TABREF5"
},
{
"start": 1868,
"end": 1875,
"text": "Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Transfer learning",
"sec_num": "4.4"
},
{
"text": "Feature ablation experiments are performed for various feature groups in the full and ranking-only task ( Table 5 ). The ablation groups correspond to the feature categories defined in Section 4.3. The frequency group includes plain frequency features as well as conjunction ratio features. We consider only our universal model trained on all language data (with 10-fold CV for each dataset). In case of English, the full system performs best and all feature groups improve overall performance. For other languages these results are mixed. In case of the German data, embedding features and semantic relation features seem to work well on their own, so that results for other ablation groups are slightly better. For ranking-only, embedding features seem to be largely subsumed by the combination of the other groups. Ablation of embeddings differs vastly between the full and rankingonly task; they seem to more more crucial for the full task. For all languages, semantic relations are the best feature in the full task, acting as a strong filter for candidates; in ranking-only they are more dispensable.",
"cite_spans": [],
"ref_spans": [
{
"start": 106,
"end": 113,
"text": "Table 5",
"ref_id": "TABREF8"
}
],
"eq_spans": [],
"section": "Transfer learning",
"sec_num": "4.4"
},
{
"text": "In summary, we observe that delexicalized transfer learning for lexical substitution is possible. Existing supervised approaches can be extended to generalize across multiple languages without much effort. Training a supervised system on different language data emphasizes that the learned model is sufficiently generic to be language independent. Our feature space constructed from heterogeneous evidence consists of many features that perform relatively weakly on their own. The resulting ranking model captures redundancy between these signals. Finally, Table 6 shows our results in comparison to previous work. Note that we omit some participating systems from the original SE07 task. The reason we did not list IRST2 (Giuliano et al., 2007) is that for out-of-ten results, the system outputs the same substitute multiple times and the evaluation scheme gives credit for each copy of the substitute. Our (and other) systems do not tamper with the metric in this way, and only yield a set of substitutes. UNT (Hassan et al., 2007) uses a much richer set of knowledge bases, not all of them easily available, to achieve slightly better oot scores. From our experiments, we list both a model trained per language, as well as a universal model trained on all data. The latter beats nearly all other approaches on the full lexical substitution task, despite not being optimized for a single language. Although omission of MWEs is common practice for SE07, it is unclear if this was done for EL09 and GE15. However, re-inclusion of MWE does not drastically alter results 10 . In the ranking-only variant, we are not able to beat the learning-to-rank approach by Szarvas et. al (2013b) , we note however that they have performed extensive hyperparameter optimization of their ranker, which we have omitted. We are also not able to achieve GAP scores reported by Melamud at al. (2015b). Although we used their exact embeddings, we could not reproduce their results 11 .",
"cite_spans": [
{
"start": 722,
"end": 745,
"text": "(Giuliano et al., 2007)",
"ref_id": "BIBREF16"
},
{
"start": 1012,
"end": 1033,
"text": "(Hassan et al., 2007)",
"ref_id": "BIBREF18"
},
{
"start": 1660,
"end": 1682,
"text": "Szarvas et. al (2013b)",
"ref_id": "BIBREF42"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Transfer learning",
"sec_num": "4.4"
},
{
"text": "We are the first to model lexical substitution as a language-independent task by considering not just a single-language dataset, but by merging data from distinct tasks in English, German and Italian. We have shown that a supervised, delexicalized approach can successfully learn a single model across languages -and thus perform transfer learning for lexical substitution. We observe that a listwise ranker model such as Lamb-daMART facilitates this transfer learning. We have further shown that incorporating more data helps training a more robust model and can consistently improve system performance by adding foreign language training data. We extended an existing supervised learning-to-rank approach for lexical substitution (Szarvas et al., 2013b) with stateof-the-art embedding features (Melamud et al., 2015b) . In our experiments, a single model trained on all data performed best on each language. In all 10 For comparison, our scores including MWE for the \"all data\" model are as follows (best-P, oot-P, GAP). EL09: 15.12, 33.92, 45.8; GE15: 12.20, 41.15, 50.0 11 Our evaluation of (Melamud et al., 2015b) , balAdd yields a GAP score of 48.8, which is likely related to different evaluation settings.",
"cite_spans": [
{
"start": 732,
"end": 755,
"text": "(Szarvas et al., 2013b)",
"ref_id": "BIBREF42"
},
{
"start": 796,
"end": 819,
"text": "(Melamud et al., 2015b)",
"ref_id": "BIBREF26"
},
{
"start": 917,
"end": 919,
"text": "10",
"ref_id": null
},
{
"start": 1023,
"end": 1035,
"text": "EL09: 15.12,",
"ref_id": null
},
{
"start": 1036,
"end": 1042,
"text": "33.92,",
"ref_id": null
},
{
"start": 1043,
"end": 1048,
"text": "45.8;",
"ref_id": null
},
{
"start": 1049,
"end": 1061,
"text": "GE15: 12.20,",
"ref_id": null
},
{
"start": 1062,
"end": 1068,
"text": "41.15,",
"ref_id": null
},
{
"start": 1069,
"end": 1073,
"text": "50.0",
"ref_id": null
},
{
"start": 1095,
"end": 1118,
"text": "(Melamud et al., 2015b)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "6"
},
{
"text": "12 baseline by task organizer Table 6 : Experimental results of our method compared to related work for all three lexical substitution tasks three datasets we were able to improve the current state of the art for the full lexical substitution task. The resulting model can be regarded as languageindependent; given an unannotated background corpus for computing language-specific resources and a source of substitution candidates, the system can be used almost out of the box. For obtaining substitution candidates, we still rely on lexical resources such as WordNet, which have to be available for each language. As future work we aim to make our approach completely knowledgefree by eliminating this dependency. We can consider substitution candidates based on their distributional similarity. First experiments confirm that this already yields a much better coverage, i.e. upper bound on recall, while introducing more noise. The remaining key challenge is to better characterize possible substitutes from bad substitutes in ranked lists of distributionally similar words, which frequently contain antonyms and cohyponyms. We will explore unsupervised acquisition of relational similarity (Mikolov et al., 2013b) for this task.",
"cite_spans": [
{
"start": 1192,
"end": 1215,
"text": "(Mikolov et al., 2013b)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [
{
"start": 30,
"end": 37,
"text": "Table 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "6"
},
{
"text": "Italian WordNet has later been migrated into MultiWord-Net (MWN), which is used in this work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The original SE07 task had a third evaluation setting MWE, in which systems had to correctly identify which target words were part of a multiword expression.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Method descriptionWe subdivide lexical substitution into two subtasks; candidate selection and ranking. For a given target t, we consider a list of possible substi-",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "For classification setup we use Mallet: http:// mallet.cs.umass.edu/ 4 For learning-to-rank we use RankLib: http:// mallet.cs.umass.edu/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Conjunction words used are and, or, (comma), for English; und, oder, (comma) for German and e, ed, o, od, (comma) for Italian.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We trained models for Mate (https://code. google.com/p/mate-tools/) based on universal dependencies (http://universaldependencies. org/)7 We used word2vecf (https://bitbucket.org/ yoavgo/word2vecf) for computing syntactic word embeddings",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Results and discussionEvaluation of lexical substitution requires special care, as different evaluation settings are used",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The omission of MWE by multiple authors has been confirmed by the authors of(Melamud et al., 2015a).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "State of the art baseline, according to previous reported results, c.f.Table 6",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "This work has been supported by the German Research Foundation as part of the Research Training Group \"Adaptive Preparation of Information from Heterogeneous Sources\" (AIPHES) under grant No. GRK 1994/1 and the SEMSCH project, grant No. BI 1544.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "UKP: Computing semantic textual similarity by combining multiple content similarity measures",
"authors": [
{
"first": "Daniel",
"middle": [],
"last": "B\u00e4r",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Biemann",
"suffix": ""
},
{
"first": "Iryna",
"middle": [],
"last": "Gurevych",
"suffix": ""
},
{
"first": "Torsten",
"middle": [],
"last": "Zesch",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the First Joint Conference on Lexical and Computational Semantics",
"volume": "1",
"issue": "",
"pages": "435--440",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Daniel B\u00e4r, Chris Biemann, Iryna Gurevych, and Torsten Zesch. 2012. UKP: Computing seman- tic textual similarity by combining multiple con- tent similarity measures. In Proceedings of the First Joint Conference on Lexical and Computa- tional Semantics -Volume 1: Proceedings of the Main Conference and the Shared Task, and Volume 2: Proceedings of the Sixth International Workshop on Semantic Evaluation, pages 435-440, Montreal, Canada.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "The WaCky wide web: a collection of very large linguistically processed web-crawled corpora. Language resources and evaluation",
"authors": [
{
"first": "Marco",
"middle": [],
"last": "Baroni",
"suffix": ""
},
{
"first": "Silvia",
"middle": [],
"last": "Bernardini",
"suffix": ""
},
{
"first": "Adriano",
"middle": [],
"last": "Ferraresi",
"suffix": ""
},
{
"first": "Eros",
"middle": [],
"last": "Zanchetta",
"suffix": ""
}
],
"year": 2009,
"venue": "",
"volume": "43",
"issue": "",
"pages": "209--226",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marco Baroni, Silvia Bernardini, Adriano Ferraresi, and Eros Zanchetta. 2009. The WaCky wide web: a collection of very large linguistically pro- cessed web-crawled corpora. Language resources and evaluation, 43(3):209-226.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "lexical substitution task",
"authors": [
{
"first": "",
"middle": [],
"last": "Uniba @ Evalita",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of EVALITA workshop, 11th Congress of Italian Association for Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "UNIBA @ EVALITA 2009 lexical substitution task. In Proceedings of EVALITA workshop, 11th Congress of Italian Association for Artificial Intelli- gence, Reggio Emilia, Italy.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Learning noun phrase query segmentation",
"authors": [
{
"first": "Shane",
"middle": [],
"last": "Bergsma",
"suffix": ""
},
{
"first": "Qin Iris",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL)",
"volume": "7",
"issue": "",
"pages": "819--826",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shane Bergsma and Qin Iris Wang. 2007. Learning noun phrase query segmentation. In Proceedings of the 2007 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL), vol- ume 7, pages 819-826, Prague, Czech Republic.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Text: Now in 2D! A framework for lexical expansion with contextual similarity",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Biemann",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Riedl",
"suffix": ""
}
],
"year": 2013,
"venue": "Journal of Language Modelling",
"volume": "1",
"issue": "1",
"pages": "55--95",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chris Biemann and Martin Riedl. 2013. Text: Now in 2D! A framework for lexical expansion with con- textual similarity. Journal of Language Modelling, 1(1):55-95.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "The Leipzig corpora collection: monolingual corpora of standard size",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Biemann",
"suffix": ""
},
{
"first": "Gerhard",
"middle": [],
"last": "Heyer",
"suffix": ""
},
{
"first": "Uwe",
"middle": [],
"last": "Quasthoff",
"suffix": ""
},
{
"first": "Matthias",
"middle": [],
"last": "Richter",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of Corpus Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chris Biemann, Gerhard Heyer, Uwe Quasthoff, and Matthias Richter. 2007. The Leipzig corpora collec- tion: monolingual corpora of standard size. In Pro- ceedings of Corpus Linguistics, Birmingham, UK.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Creating a system for lexical substitutions from scratch using crowdsourcing. Language Resources and Evaluation",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Biemann",
"suffix": ""
}
],
"year": 2013,
"venue": "",
"volume": "47",
"issue": "",
"pages": "97--122",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chris Biemann. 2013. Creating a system for lexi- cal substitutions from scratch using crowdsourcing. Language Resources and Evaluation, 47(1):97-122.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "A Comparison of Co-occurrence and Similarity Measures As Simulations of Context",
"authors": [
{
"first": "Stefan",
"middle": [],
"last": "Bordag",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the 9th International Conference on Computational Linguistics and Intelligent Text Processing",
"volume": "",
"issue": "",
"pages": "52--63",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stefan Bordag. 2008. A Comparison of Co-occurrence and Similarity Measures As Simulations of Context. In Proceedings of the 9th International Conference on Computational Linguistics and Intelligent Text Processing, CICLing 2008, pages 52-63, Haifa, Is- rael.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Web 1T 5-gram, 10 European languages version 1. Linguistic Data Consortium",
"authors": [
{
"first": "Thorsten",
"middle": [],
"last": "Brants",
"suffix": ""
},
{
"first": "Alex",
"middle": [],
"last": "Franz",
"suffix": ""
}
],
"year": 2009,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thorsten Brants and Alex Franz. 2009. Web 1T 5- gram, 10 European languages version 1. Linguistic Data Consortium.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "From RankNet to LambdaRank to LambdaMART: An overview",
"authors": [
{
"first": "J",
"middle": [
"C"
],
"last": "Christopher",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Burges",
"suffix": ""
}
],
"year": 2010,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Christopher J.C. Burges. 2010. From RankNet to LambdaRank to LambdaMART: An overview. Technical Report MSR-TR-2010-82, Microsoft Re- search.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Lexical substitution dataset for German",
"authors": [
{
"first": "Kostadin",
"middle": [],
"last": "Cholakov",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Biemann",
"suffix": ""
},
{
"first": "Judith",
"middle": [],
"last": "Eckle-Kohler",
"suffix": ""
},
{
"first": "Iryna",
"middle": [],
"last": "Gurevych",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 9th International Conference on Language Resources and Evaluation",
"volume": "",
"issue": "",
"pages": "1406--1411",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kostadin Cholakov, Chris Biemann, Judith Eckle- Kohler, and Iryna Gurevych. 2014. Lexical substi- tution dataset for German. In Proceedings of the 9th International Conference on Language Resources and Evaluation, pages 1406-1411, Reykjavik, Ice- land.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Combining distributional and paradigmatic information in a lexical substitution task",
"authors": [
{
"first": "Diego",
"middle": [],
"last": "De",
"suffix": ""
},
{
"first": "Cao",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "Roberto",
"middle": [],
"last": "Basili",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of EVALITA workshop, 11th Congress of Italian Association for Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Diego De Cao and Roberto Basili. 2009. Combining distributional and paradigmatic information in a lex- ical substitution task. In Proceedings of EVALITA workshop, 11th Congress of Italian Association for Artificial Intelligence, Reggio Emilia, Italy.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "A structured vector space model for word meaning in context",
"authors": [
{
"first": "Katrin",
"middle": [],
"last": "Erk",
"suffix": ""
},
{
"first": "Sebastian",
"middle": [],
"last": "Pad\u00f3",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "897--906",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Katrin Erk and Sebastian Pad\u00f3. 2008. A structured vector space model for word meaning in context. In Proceedings of the Conference on Empirical Meth- ods in Natural Language Processing, pages 897- 906, Waikiki, HI, USA.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Exemplar-based models for word meaning in context",
"authors": [
{
"first": "Katrin",
"middle": [],
"last": "Erk",
"suffix": ""
},
{
"first": "Sebastian",
"middle": [],
"last": "Pad\u00f3",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the ACL 2010 conference short papers",
"volume": "",
"issue": "",
"pages": "92--97",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Katrin Erk and Sebastian Pad\u00f3. 2010. Exemplar-based models for word meaning in context. In Proceedings of the ACL 2010 conference short papers, pages 92- 97, Uppsala, Sweden.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "FBK-irst: Lexical substitution task exploiting domain and syntagmatic coherence",
"authors": [
{
"first": "Claudio",
"middle": [],
"last": "Giuliano",
"suffix": ""
},
{
"first": "Alfio",
"middle": [],
"last": "Gliozzo",
"suffix": ""
},
{
"first": "Carlo",
"middle": [],
"last": "Strapparava",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 4th International Workshop on Semantic Evaluations (SemEval-2007)",
"volume": "",
"issue": "",
"pages": "145--148",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Claudio Giuliano, Alfio Gliozzo, and Carlo Strappa- rava. 2007. FBK-irst: Lexical substitution task exploiting domain and syntagmatic coherence. In Proceedings of the 4th International Workshop on Semantic Evaluations (SemEval-2007), pages 145- 148, Prague, Czech Republic.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "GermaNeta lexical-semantic net for German",
"authors": [
{
"first": "Birgit",
"middle": [],
"last": "Hamp",
"suffix": ""
},
{
"first": "Helmut",
"middle": [],
"last": "Feldweg",
"suffix": ""
}
],
"year": 1997,
"venue": "Proceedings of ACL workshop Automatic Information Extraction and Building of Lexical Semantic Resources for NLP Applications",
"volume": "",
"issue": "",
"pages": "9--15",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Birgit Hamp and Helmut Feldweg. 1997. GermaNet - a lexical-semantic net for German. In In Proceed- ings of ACL workshop Automatic Information Ex- traction and Building of Lexical Semantic Resources for NLP Applications, pages 9-15, Madrid, Spain.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "UNT: Subfinder: Combining knowledge sources for automatic lexical substitution",
"authors": [
{
"first": "Samer",
"middle": [],
"last": "Hassan",
"suffix": ""
},
{
"first": "Andras",
"middle": [],
"last": "Csomai",
"suffix": ""
},
{
"first": "Carmen",
"middle": [],
"last": "Banea",
"suffix": ""
},
{
"first": "Ravi",
"middle": [],
"last": "Sinha",
"suffix": ""
},
{
"first": "Rada",
"middle": [],
"last": "Mihalcea",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 4th International Workshop on Semantic Evaluations (SemEval-2007)",
"volume": "",
"issue": "",
"pages": "410--413",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Samer Hassan, Andras Csomai, Carmen Banea, Ravi Sinha, and Rada Mihalcea. 2007. UNT: Sub- finder: Combining knowledge sources for auto- matic lexical substitution. In Proceedings of the 4th International Workshop on Semantic Evaluations (SemEval-2007), pages 410-413, Prague, Czech Re- public.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Delexicalized supervised German lexical substitution",
"authors": [
{
"first": "Gerold",
"middle": [],
"last": "Hintz",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Biemann",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of GermEval 2015: LexSub",
"volume": "",
"issue": "",
"pages": "11--16",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gerold Hintz and Chris Biemann. 2015. Delexical- ized supervised German lexical substitution. In Pro- ceedings of GermEval 2015: LexSub, pages 11-16, Essen, Germany.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Lexical substitution using deep syntactic and semantic analysis",
"authors": [
{
"first": "Luchezar",
"middle": [],
"last": "Jackov",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of GermEval 2015: LexSub",
"volume": "",
"issue": "",
"pages": "17--20",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Luchezar Jackov. 2015. Lexical substitution using deep syntactic and semantic analysis. In Proceed- ings of GermEval 2015: LexSub, pages 17-20, Es- sen, Germany.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "What substitutes tell us -analysis of an \"all-words\" lexical substitution corpus",
"authors": [
{
"first": "Gerhard",
"middle": [],
"last": "Kremer",
"suffix": ""
},
{
"first": "Katrin",
"middle": [],
"last": "Erk",
"suffix": ""
},
{
"first": "Sebastian",
"middle": [],
"last": "Pad\u00f3",
"suffix": ""
},
{
"first": "Stefan",
"middle": [],
"last": "Thater",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 14th Conference of the European Chapter of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "540--549",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gerhard Kremer, Katrin Erk, Sebastian Pad\u00f3, and Ste- fan Thater. 2014. What substitutes tell us -analy- sis of an \"all-words\" lexical substitution corpus. In Proceedings of the 14th Conference of the European Chapter of the Association for Computational Lin- guistics, pages 540-549, Gothenburg, Sweden.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Dependencybased word embeddings",
"authors": [
{
"first": "Omer",
"middle": [],
"last": "Levy",
"suffix": ""
},
{
"first": "Yoav",
"middle": [],
"last": "Goldberg",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics",
"volume": "2",
"issue": "",
"pages": "302--308",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Omer Levy and Yoav Goldberg. 2014. Dependency- based word embeddings. In Proceedings of the 52nd Annual Meeting of the Association for Computa- tional Linguistics, volume 2, pages 302-308, Bal- timore, MD, USA.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Semeval-2007 task 10: English lexical substitution task",
"authors": [
{
"first": "Diana",
"middle": [],
"last": "Mccarthy",
"suffix": ""
},
{
"first": "Roberto",
"middle": [],
"last": "Navigli",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 4th International Workshop on Semantic Evaluations",
"volume": "",
"issue": "",
"pages": "48--53",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Diana McCarthy and Roberto Navigli. 2007. Semeval- 2007 task 10: English lexical substitution task. In Proceedings of the 4th International Workshop on Semantic Evaluations, pages 48-53, Prague, Czech Republic.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "The English lexical substitution task. Language resources and evaluation",
"authors": [
{
"first": "Diana",
"middle": [],
"last": "Mccarthy",
"suffix": ""
},
{
"first": "Roberto",
"middle": [],
"last": "Navigli",
"suffix": ""
}
],
"year": 2009,
"venue": "",
"volume": "43",
"issue": "",
"pages": "139--159",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Diana McCarthy and Roberto Navigli. 2009. The En- glish lexical substitution task. Language resources and evaluation, 43(2):139-159.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Modeling word meaning in context with substitute vectors",
"authors": [
{
"first": "Oren",
"middle": [],
"last": "Melamud",
"suffix": ""
},
{
"first": "Ido",
"middle": [],
"last": "Dagan",
"suffix": ""
},
{
"first": "Jacob",
"middle": [],
"last": "Goldberger",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of the 2015 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "472--482",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Oren Melamud, Ido Dagan, and Jacob Goldberger. 2015a. Modeling word meaning in context with sub- stitute vectors. In Proceedings of the 2015 Confer- ence of the North American Chapter of the Associ- ation for Computational Linguistics: Human Lan- guage Technologies, pages 472-482, Denver, CO, USA.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "A simple word embedding model for lexical substitution. VSM Workshop",
"authors": [
{
"first": "Oren",
"middle": [],
"last": "Melamud",
"suffix": ""
},
{
"first": "Omer",
"middle": [],
"last": "Levy",
"suffix": ""
},
{
"first": "Ido",
"middle": [],
"last": "Dagan",
"suffix": ""
}
],
"year": 2015,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Oren Melamud, Omer Levy, and Ido Dagan. 2015b. A simple word embedding model for lexical substitu- tion. VSM Workshop. Denver, CO, USA.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Semeval-2010 task 2: Cross-lingual lexical substitution",
"authors": [
{
"first": "Rada",
"middle": [],
"last": "Mihalcea",
"suffix": ""
},
{
"first": "Ravi",
"middle": [],
"last": "Sinha",
"suffix": ""
},
{
"first": "Diana",
"middle": [],
"last": "Mccarthy",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the 5th International Workshop on Semantic Evaluation",
"volume": "",
"issue": "",
"pages": "9--14",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rada Mihalcea, Ravi Sinha, and Diana McCarthy. 2010. Semeval-2010 task 2: Cross-lingual lexical substitution. In Proceedings of the 5th International Workshop on Semantic Evaluation, pages 9-14, Up- psala, Sweden.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Distributed representations of words and phrases and their compositionality",
"authors": [
{
"first": "Tomas",
"middle": [],
"last": "Mikolov",
"suffix": ""
},
{
"first": "Ilya",
"middle": [],
"last": "Sutskever",
"suffix": ""
},
{
"first": "Kai",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Greg",
"middle": [
"S"
],
"last": "Corrado",
"suffix": ""
},
{
"first": "Jeff",
"middle": [],
"last": "Dean",
"suffix": ""
}
],
"year": 2013,
"venue": "Advances in neural information processing systems",
"volume": "",
"issue": "",
"pages": "3111--3119",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tomas Mikolov, Ilya Sutskever, Kai Chen, Greg S Cor- rado, and Jeff Dean. 2013a. Distributed represen- tations of words and phrases and their composition- ality. In Advances in neural information processing systems, pages 3111-3119, Lake Tahoe, NV, USA.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Linguistic regularities in continuous space word representations",
"authors": [
{
"first": "Tomas",
"middle": [],
"last": "Mikolov",
"suffix": ""
},
{
"first": "Yih",
"middle": [],
"last": "Wen-Tau",
"suffix": ""
},
{
"first": "Geoffrey",
"middle": [],
"last": "Zweig",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "746--751",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tomas Mikolov, Wen-tau Yih, and Geoffrey Zweig. 2013b. Linguistic regularities in continuous space word representations. In Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 746-751, Atlanta, GA, USA.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "GermEval 2015: LexSub -A shared task for German-language lexical substitution",
"authors": [
{
"first": "Tristan",
"middle": [],
"last": "Miller",
"suffix": ""
},
{
"first": "Darina",
"middle": [],
"last": "Benikova",
"suffix": ""
},
{
"first": "Sallam",
"middle": [],
"last": "Abualhaija",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of GermEval 2015: LexSub",
"volume": "",
"issue": "",
"pages": "1--9",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tristan Miller, Darina Benikova, and Sallam Abual- haija. 2015. GermEval 2015: LexSub -A shared task for German-language lexical substitution. In Proceedings of GermEval 2015: LexSub, pages 1- 9, Essen, Germany.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "An inferencebased model of word meaning in context as a paraphrase distribution",
"authors": [
{
"first": "Taesun",
"middle": [],
"last": "Moon",
"suffix": ""
},
{
"first": "Katrin",
"middle": [],
"last": "Erk",
"suffix": ""
}
],
"year": 2013,
"venue": "ACM Transactions on Intelligent Systems and Technology",
"volume": "4",
"issue": "3",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Taesun Moon and Katrin Erk. 2013. An inference- based model of word meaning in context as a para- phrase distribution. ACM Transactions on Intelli- gent Systems and Technology (TIST), 4(3):42.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Efficient nonparametric estimation of multiple embeddings per word in vector space",
"authors": [
{
"first": "Arvind",
"middle": [],
"last": "Neelakantan",
"suffix": ""
},
{
"first": "Jeevan",
"middle": [],
"last": "Shankar",
"suffix": ""
},
{
"first": "Alexandre",
"middle": [],
"last": "Passos",
"suffix": ""
},
{
"first": "Andrew",
"middle": [],
"last": "Mccallum",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1059--1069",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Arvind Neelakantan, Jeevan Shankar, Alexandre Pas- sos, and Andrew McCallum. 2014. Efficient non- parametric estimation of multiple embeddings per word in vector space. In Proceedings of the Con- ference on Empirical Methods in Natural Language Processing, pages 1059-1069, Doha, Qatar.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Probabilistic distributional semantics with latent variable models",
"authors": [
{
"first": "\u00d3",
"middle": [],
"last": "Diarmuid",
"suffix": ""
},
{
"first": "Anna",
"middle": [],
"last": "S\u00e9aghdha",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Korhonen",
"suffix": ""
}
],
"year": 2014,
"venue": "Computational Linguistics",
"volume": "40",
"issue": "3",
"pages": "587--631",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Diarmuid \u00d3 S\u00e9aghdha and Anna Korhonen. 2014. Probabilistic distributional semantics with latent variable models. Computational Linguistics, 40(3):587-631.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "English Gigaword Fifth Edition",
"authors": [
{
"first": "Robert",
"middle": [],
"last": "Parker",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Graff",
"suffix": ""
},
{
"first": "Junbo",
"middle": [],
"last": "Kong",
"suffix": ""
},
{
"first": "Ke",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Kazuaki",
"middle": [],
"last": "Maeda",
"suffix": ""
}
],
"year": 2011,
"venue": "Linguistic Data Consortium",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Robert Parker, David Graff, Junbo Kong, Ke Chen, and Kazuaki Maeda. 2011. English Gigaword Fifth Edi- tion. Technical report, Linguistic Data Consortium, Philadelphia, PA, USA.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "A universal part-of-speech tagset",
"authors": [
{
"first": "Slav",
"middle": [],
"last": "Petrov",
"suffix": ""
},
{
"first": "Dipanjan",
"middle": [],
"last": "Das",
"suffix": ""
},
{
"first": "Ryan",
"middle": [],
"last": "Mcdonald",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the Eight International Conference on Language Resources and Evaluation",
"volume": "",
"issue": "",
"pages": "2089--2096",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Slav Petrov, Dipanjan Das, and Ryan McDonald. 2012. A universal part-of-speech tagset. In Proceedings of the Eight International Conference on Language Re- sources and Evaluation, pages 2089-2096, Istanbul, Turkey.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "MultiWordNet: developing an aligned multilingual database",
"authors": [
{
"first": "Emanuele",
"middle": [],
"last": "Pianta",
"suffix": ""
},
{
"first": "Luisa",
"middle": [],
"last": "Bentivogli",
"suffix": ""
},
{
"first": "Christian",
"middle": [],
"last": "Girardi",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of the 1st International WordNet Conference",
"volume": "",
"issue": "",
"pages": "293--302",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Emanuele Pianta, Luisa Bentivogli, and Christian Gi- rardi. 2002. MultiWordNet: developing an aligned multilingual database. In Proceedings of the 1st International WordNet Conference, pages 293-302, Mysore, India.",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"title": "Exploiting the Leipzig Corpora Collection",
"authors": [
{
"first": "Matthias",
"middle": [],
"last": "Richter",
"suffix": ""
},
{
"first": "Uwe",
"middle": [],
"last": "Quasthoff",
"suffix": ""
},
{
"first": "Erla",
"middle": [],
"last": "Hallsteinsd\u00f3ttir",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Biemann",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the Information Society Language Technologies Conference",
"volume": "",
"issue": "",
"pages": "68--73",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Matthias Richter, Uwe Quasthoff, Erla Hallsteinsd\u00f3ttir, and Chris Biemann. 2006. Exploiting the Leipzig Corpora Collection. In Proceedings of the Infor- mation Society Language Technologies Conference 2006, pages 68-73. Ljubljana, Slovenia.",
"links": null
},
"BIBREF38": {
"ref_id": "b38",
"title": "CLIPS, a multi-level Italian computational lexicon: a glimpse to data",
"authors": [
{
"first": "Nilda",
"middle": [],
"last": "Ruimy",
"suffix": ""
},
{
"first": "Monica",
"middle": [],
"last": "Monachini",
"suffix": ""
},
{
"first": "Raffaella",
"middle": [],
"last": "Distante",
"suffix": ""
},
{
"first": "Elisabetta",
"middle": [],
"last": "Guazzini",
"suffix": ""
},
{
"first": "Stefano",
"middle": [],
"last": "Molino",
"suffix": ""
},
{
"first": "Marisa",
"middle": [],
"last": "Ulivieri",
"suffix": ""
},
{
"first": "Nicoletta",
"middle": [],
"last": "Calzolari",
"suffix": ""
},
{
"first": "Antonio",
"middle": [],
"last": "Zampolli",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of the 3rd International Conference on Language Resources and Evaluation",
"volume": "",
"issue": "",
"pages": "792--799",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nilda Ruimy, Monica Monachini, Raffaella Dis- tante, Elisabetta Guazzini, Stefano Molino, Marisa Ulivieri, Nicoletta Calzolari, and Antonio Zampolli. 2002. CLIPS, a multi-level Italian computational lexicon: a glimpse to data. In Proceedings of the 3rd International Conference on Language Resources and Evaluation, pages 792-799, Las Palmas, Spain.",
"links": null
},
"BIBREF39": {
"ref_id": "b39",
"title": "Combining lexical resources for contextual synonym expansion",
"authors": [
{
"first": "Ravi",
"middle": [],
"last": "Sinha",
"suffix": ""
},
{
"first": "Rada",
"middle": [],
"last": "Mihalcea",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the Conference in Recent Advances in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "404--410",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ravi Sinha and Rada Mihalcea. 2009. Combining lex- ical resources for contextual synonym expansion. In Proceedings of the Conference in Recent Advances in Natural Language Processing, pages 404-410, Borovets, Bulgaria.",
"links": null
},
"BIBREF40": {
"ref_id": "b40",
"title": "Using centrality algorithms on directed graphs for synonym expansion",
"authors": [
{
"first": "Som",
"middle": [],
"last": "Ravi",
"suffix": ""
},
{
"first": "Rada Flavia",
"middle": [],
"last": "Sinha",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Mihalcea",
"suffix": ""
}
],
"year": 2011,
"venue": "FLAIRS Conference",
"volume": "",
"issue": "",
"pages": "311--316",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ravi Som Sinha and Rada Flavia Mihalcea. 2011. Using centrality algorithms on directed graphs for synonym expansion. In FLAIRS Conference, pages 311-316, Palm Beach, FL, USA.",
"links": null
},
"BIBREF41": {
"ref_id": "b41",
"title": "Supervised all-words lexical substitution using delexicalized features",
"authors": [
{
"first": "Gy\u00f6rgy",
"middle": [],
"last": "Szarvas",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Biemann",
"suffix": ""
},
{
"first": "Iryna",
"middle": [],
"last": "Gurevych",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "1131--1141",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gy\u00f6rgy Szarvas, Chris Biemann, Iryna Gurevych, et al. 2013a. Supervised all-words lexical substitution us- ing delexicalized features. In Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Hu- man Language Technologies, pages 1131-1141, At- lanta, GA, USA.",
"links": null
},
"BIBREF42": {
"ref_id": "b42",
"title": "Learning to rank lexical substitutions",
"authors": [
{
"first": "Gy\u00f6rgy",
"middle": [],
"last": "Szarvas",
"suffix": ""
},
{
"first": "R\u00f3bert",
"middle": [],
"last": "Busa-Fekete",
"suffix": ""
},
{
"first": "Eyke",
"middle": [],
"last": "H\u00fcllermeier",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1926--1932",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gy\u00f6rgy Szarvas, R\u00f3bert Busa-Fekete, and Eyke H\u00fcller- meier. 2013b. Learning to rank lexical substitutions. In Proceedings of the 2013 Conference on Empiri- cal Methods in Natural Language Processing, pages 1926-1932, Seattle, WA, USA.",
"links": null
},
"BIBREF43": {
"ref_id": "b43",
"title": "Ranking paraphrases in context",
"authors": [
{
"first": "Stefan",
"middle": [],
"last": "Thater",
"suffix": ""
},
{
"first": "Georgiana",
"middle": [],
"last": "Dinu",
"suffix": ""
},
{
"first": "Manfred",
"middle": [],
"last": "Pinkal",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the 2009 Workshop on Applied Textual Inference",
"volume": "",
"issue": "",
"pages": "44--47",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stefan Thater, Georgiana Dinu, and Manfred Pinkal. 2009. Ranking paraphrases in context. In Proceed- ings of the 2009 Workshop on Applied Textual Infer- ence, pages 44-47, Singapore, Republic of Singa- pore.",
"links": null
},
"BIBREF44": {
"ref_id": "b44",
"title": "Word meaning in context: A simple and effective vector model",
"authors": [
{
"first": "Stefan",
"middle": [],
"last": "Thater",
"suffix": ""
},
{
"first": "Hagen",
"middle": [],
"last": "F\u00fcrstenau",
"suffix": ""
},
{
"first": "Manfred",
"middle": [],
"last": "Pinkal",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1134--1143",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stefan Thater, Hagen F\u00fcrstenau, and Manfred Pinkal. 2011. Word meaning in context: A simple and ef- fective vector model. In Proceedings of the Con- ference on Empirical Methods in Natural Language Processing, pages 1134-1143, Edinburgh, UK.",
"links": null
},
"BIBREF45": {
"ref_id": "b45",
"title": "The lexical substitution task at EVALITA",
"authors": [
{
"first": "Antonio",
"middle": [],
"last": "Toral",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of EVALITA Workshop, 11th Congress of Italian Association for Artificial Intelligence",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Antonio Toral. 2009. The lexical substitution task at EVALITA 2009. In Proceedings of EVALITA Work- shop, 11th Congress of Italian Association for Arti- ficial Intelligence, Reggio Emilia, Italy.",
"links": null
},
"BIBREF46": {
"ref_id": "b46",
"title": "Adapting boosting for information retrieval measures",
"authors": [
{
"first": "Qiang",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "J",
"middle": [
"C"
],
"last": "Christopher",
"suffix": ""
},
{
"first": "Krysta",
"middle": [
"M"
],
"last": "Burges",
"suffix": ""
},
{
"first": "Jianfeng",
"middle": [],
"last": "Svore",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Gao",
"suffix": ""
}
],
"year": 2010,
"venue": "Information Retrieval",
"volume": "13",
"issue": "3",
"pages": "254--270",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Qiang Wu, Christopher JC Burges, Krysta M Svore, and Jianfeng Gao. 2010. Adapting boosting for in- formation retrieval measures. Information Retrieval, 13(3):254-270.",
"links": null
}
},
"ref_entries": {
"TABREF1": {
"content": "<table><tr><td>: Degree of variation in gold answers</td></tr><tr><td>supervised approaches for determining appropri-</td></tr><tr><td>ate substitutes. For the English SE07 task, sys-</td></tr><tr><td>tems mostly consider substitution candidates from</td></tr><tr><td>WordNet</td></tr></table>",
"type_str": "table",
"num": null,
"text": "",
"html": null
},
"TABREF2": {
"content": "<table><tr><td>dataset</td><td colspan=\"2\">maximum recall w/ MWE w/o MWE</td></tr><tr><td>SemEval-2007</td><td>0.459</td><td>0.404</td></tr><tr><td>Evalita-2009</td><td>0.369</td><td>0.337</td></tr><tr><td>GermEval-2015</td><td>0.192</td><td>0.178</td></tr><tr><td>all</td><td>0.242</td><td>0.223</td></tr></table>",
"type_str": "table",
"num": null,
"text": ", as well as syntactic embedding features motivated byMelamud et al. (2015b).",
"html": null
},
"TABREF3": {
"content": "<table><tr><td>: Upper bound for substitute recall based</td></tr><tr><td>on lexical resources WordNet, MultiWordNet, Ger-</td></tr><tr><td>maNet</td></tr><tr><td>4.1 Candidate selection</td></tr></table>",
"type_str": "table",
"num": null,
"text": "",
"html": null
},
"TABREF5": {
"content": "<table><tr><td colspan=\"4\">: Transfer learning results for the open can-</td></tr><tr><td colspan=\"4\">didate task (candidates from lexical resources)</td></tr><tr><td/><td colspan=\"3\">Ranking evaluation (GAP)</td></tr><tr><td colspan=\"4\">Training English German Italian</td></tr><tr><td>English</td><td>51.0</td><td>26.9</td><td>44.5</td></tr><tr><td>German</td><td>44.3</td><td>56.2</td><td>42.9</td></tr><tr><td>Italian</td><td>36.7</td><td>22.2</td><td>48.0</td></tr><tr><td>others</td><td>43.7</td><td>26.7</td><td>43.9</td></tr><tr><td>all</td><td>51.9</td><td>51.3</td><td>50.0</td></tr></table>",
"type_str": "table",
"num": null,
"text": "",
"html": null
},
"TABREF6": {
"content": "<table/>",
"type_str": "table",
"num": null,
"text": "Transfer learning results on the rankingonly task (candidates pooled from gold)",
"html": null
},
"TABREF8": {
"content": "<table/>",
"type_str": "table",
"num": null,
"text": "Feature ablation results for the full and ranking-only task (universal model trained on all data)",
"html": null
}
}
}
} |