File size: 135,648 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 | {
"paper_id": "P19-1012",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:27:41.272884Z"
},
"title": "The (Non-)Utility of Structural Features in BiLSTM-based Dependency Parsers",
"authors": [
{
"first": "Agnieszka",
"middle": [],
"last": "Falenska",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Stuttgart",
"location": {}
},
"email": ""
},
{
"first": "Jonas",
"middle": [],
"last": "Kuhn",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Stuttgart",
"location": {}
},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Classical non-neural dependency parsers put considerable effort on the design of feature functions. Especially, they benefit from information coming from structural features, such as features drawn from neighboring tokens in the dependency tree. In contrast, their BiLSTM-based successors achieve state-ofthe-art performance without explicit information about the structural context. In this paper we aim to answer the question: How much structural context are the BiLSTM representations able to capture implicitly? We show that features drawn from partial subtrees become redundant when the BiLSTMs are used. We provide a deep insight into information flow in transition-and graph-based neural architectures to demonstrate where the implicit information comes from when the parsers make their decisions. Finally, with model ablations we demonstrate that the structural context is not only present in the models, but it significantly influences their performance.",
"pdf_parse": {
"paper_id": "P19-1012",
"_pdf_hash": "",
"abstract": [
{
"text": "Classical non-neural dependency parsers put considerable effort on the design of feature functions. Especially, they benefit from information coming from structural features, such as features drawn from neighboring tokens in the dependency tree. In contrast, their BiLSTM-based successors achieve state-ofthe-art performance without explicit information about the structural context. In this paper we aim to answer the question: How much structural context are the BiLSTM representations able to capture implicitly? We show that features drawn from partial subtrees become redundant when the BiLSTMs are used. We provide a deep insight into information flow in transition-and graph-based neural architectures to demonstrate where the implicit information comes from when the parsers make their decisions. Finally, with model ablations we demonstrate that the structural context is not only present in the models, but it significantly influences their performance.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "When designing a conventional non-neural parser substantial effort is required to design a powerful feature extraction function. Such a function (McDonald et al., 2005; Zhang and Nivre, 2011, among others) is constructed so that it captures as much structural context as possible. The context allows the parser to make well-informed decisions. 1 It is encoded in features built from partial subtrees and explicitly used by the models.",
"cite_spans": [
{
"start": 145,
"end": 168,
"text": "(McDonald et al., 2005;",
"ref_id": "BIBREF18"
},
{
"start": 169,
"end": 205,
"text": "Zhang and Nivre, 2011, among others)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Recently, Kiperwasser and Goldberg (2016, K&G) showed that the conventional feature extraction functions can be replaced by modeling the left-and right-context of each word with BiLSTMs (Hochreiter and Schmidhuber, 1997; Graves and Schmidhuber, 2005) . Although the proposed models do not use any conventional structural features they achieve state-of-the-art performance. The authors suggested that it is because the BiLSTM encoding is able to estimate the missing information from the given features and did not explore this issue further.",
"cite_spans": [
{
"start": 10,
"end": 46,
"text": "Kiperwasser and Goldberg (2016, K&G)",
"ref_id": null
},
{
"start": 186,
"end": 220,
"text": "(Hochreiter and Schmidhuber, 1997;",
"ref_id": "BIBREF12"
},
{
"start": 221,
"end": 250,
"text": "Graves and Schmidhuber, 2005)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Since the introduction of the K&G architecture BiLSTM-based parsers have become standard in the field. 2 Yet, it is an open question how much conventional structural context the BiLSTMs representations actually are able to capture implicitly. Small architectures that ignore the structural context are attractive since they come with lower time complexity. But to build such architectures it is important to investigate to what extent the explicit structural information is redundant. For example, K&G also proposed an extended feature set derived from structural context, which has subsequently been re-implemented and used by others without questioning its utility.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Inspired by recent work (Gaddy et al., 2018 ) on constituency parsing we aim at understanding what type of information is captured by the internal representations of BiLSTM-based dependency parsers and how it translates into their impressive accuracy. As our starting point we take the K&G architecture and extend it with a secondorder decoder. 3 We perform systematic analyses on nine languages using two different architectures (transition-based and graph-based) across two dimensions: with and without BiLSTM representations, and with and without features drawn from structural context. We demonstrate that structural features are useful for neural dependency parsers but they become redundant when BiLSTMs are used (Section 4). It is because the BiLSTM representations trained together with dependency parsers capture a significant amount of complex syntactic relations (Section 5.1). We then carry out an extensive investigation of information flow in the parsing architectures and find that the implicit structural context is not only present in the BiLSTM-based parsing models, but also more diverse than when encoded in explicit structural features (Section 5.2). Finally, we present results on ablated models to demonstrate the influence of structural information implicitly encoded in BiLSTM representations on the final parsing accuracy (Section 5.3).",
"cite_spans": [
{
"start": 24,
"end": 43,
"text": "(Gaddy et al., 2018",
"ref_id": "BIBREF9"
},
{
"start": 345,
"end": 346,
"text": "3",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Our graph-and transition-based parsers are based on the K&G architecture (see Figure 1 ). The architecture has subsequently been extended by, e.g., character-based embeddings (de Lhoneux et al., 2017) or attention (Dozat and Manning, 2016) . To keep the experimental setup clean and simple while focusing on the information flow in the architecture, we abstain from these extensions. We use the basic K&G architecture as our starting point with a few minor changes outlined below. For further details we refer the reader to Kiperwasser and Goldberg (2016).",
"cite_spans": [
{
"start": 175,
"end": 200,
"text": "(de Lhoneux et al., 2017)",
"ref_id": "BIBREF16"
},
{
"start": 214,
"end": 239,
"text": "(Dozat and Manning, 2016)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [
{
"start": 78,
"end": 86,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Parsing Model Architecture",
"sec_num": "2"
},
{
"text": "In both transition-and graph-based architectures input tokens are represented in the same way (see level [1] in Figure 1 ). For a given sentence with words [w 1 , . . . w n ] and part-of-speech (POS) tags [t 1 , . . . , t n ] each word representation x i is built from concatenating the embeddings of the word and its POS tag:",
"cite_spans": [
{
"start": 105,
"end": 108,
"text": "[1]",
"ref_id": null
}
],
"ref_spans": [
{
"start": 112,
"end": 120,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Word Representations",
"sec_num": "2.1"
},
{
"text": "x i = e(w i ) \u2022 e(t i )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Word Representations",
"sec_num": "2.1"
},
{
"text": "The embeddings are initialized randomly at training time and trained together with the model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Word Representations",
"sec_num": "2.1"
},
{
"text": "The representations x i encode words in isolation and do not contain information about their context. For that reason they are passed to the Bi-LSTM feature extractors (level [2] in Figure 1 ) and represented by a BiLSTM representation x i :",
"cite_spans": [
{
"start": 168,
"end": 178,
"text": "(level [2]",
"ref_id": null
}
],
"ref_spans": [
{
"start": 182,
"end": 190,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Word Representations",
"sec_num": "2.1"
},
{
"text": "x i = BiLSTM(x 1:n , i)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Word Representations",
"sec_num": "2.1"
},
{
"text": "Transition-based parsers gradually build a tree by applying a sequence of transitions. During training they learn a scoring function for transitions. While decoding they search for the best action given the current state and the parsing history. Figure 1a illustrates the architecture of the transition-based K&G parser. For every configuration c consisting of a stack, buffer, and a set of arcs introduced so far, the parser selects a few core items from the stack and buffer (red arrows in the figure) as features. Next, it concatenates their BiLSTM vectors and passes them to a multi-layer perceptron (MLP) which assigns scores to all possible transitions. The highest scoring transition is used to proceed to the next configuration.",
"cite_spans": [],
"ref_spans": [
{
"start": 246,
"end": 255,
"text": "Figure 1a",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Transition-Based Parser",
"sec_num": "2.2"
},
{
"text": "Our implementation (denoted TBPARS) uses the arc-standard decoding algorithm (Nivre, 2004) extended with a SWAP transition (ASWAP, Nivre (2009)) to handle non-projective trees. The system applies arc transitions between the two topmost items of the stack (denoted s 0 and s 1 ). We use the lazy SWAP oracle by for training. Labels are predicted together with the transitions. We experiment with two models with different feature sets: TBMIN: is the simple architecture which does not use structural features. Since Shi et al. (2017) showed that the feature set { s 0 , s 1 , b 0 } is minimal for the arc-standard system (i.e., it suffers almost no loss in performance in comparison to larger feature sets but significantly out-performs a feature set built from only two vectors) we apply the same feature set to ASWAP. Later we analyze if the set could be further reduced.",
"cite_spans": [
{
"start": 77,
"end": 90,
"text": "(Nivre, 2004)",
"ref_id": "BIBREF23"
},
{
"start": 515,
"end": 532,
"text": "Shi et al. (2017)",
"ref_id": "BIBREF30"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Transition-Based Parser",
"sec_num": "2.2"
},
{
"text": "TBEXT: is the extended architecture. We use the original extended feature set from K&G:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Transition-Based Parser",
"sec_num": "2.2"
},
{
"text": "{ s 0 , s 1 , s 2 , b 0 , s 0L , s 0R , s 1L , s 1R , s 2L , s 2R , b 0L },",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Transition-Based Parser",
"sec_num": "2.2"
},
{
"text": "where . L and . R denote left-and right-most child.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Transition-Based Parser",
"sec_num": "2.2"
},
{
"text": "The K&G graph-based parser follows the structured prediction paradigm: while training it learns a scoring function which scores the correct tree higher than all the other possible ones. While decoding it searches for the highest scoring tree for a given sentence. The parser employs an arcfactored approach (McDonald et al., 2005) , i.e., it decomposes the score of a tree to the sum of the scores of its arcs. Figure 1b shows the K&G graph-based architecture. At parsing time, every pair of words x i , x j yields a BiLSTM representation { x i , x j } (red arrows in the figure) which is passed to MLP to compute the score for an arc x i \u2192 x j . To find the highest scoring tree we apply Eisner (1996) 's algorithm. We denote this architecture GBMIN. We note in passing that, although this decoding algorithm is restricted to projective trees, it has the advantage that it can be extended to incorporate non-local features while still maintaining exact search in polynomial time. 4 The above-mentioned simple architecture uses a feature set of two vectors { h , d }. We extend it and add information about structural context. Specifically, we incorporate information about siblings s (blue arrows in the figure). The model follows the second-order model from Mc-Donald and Pereira (2006) and decomposes the score of the tree into the sum of adjacent edge pair scores. We use the implementation of the secondorder decoder from Zhang and Zhao (2015) . We denote this architecture GBSIBL.",
"cite_spans": [
{
"start": 307,
"end": 330,
"text": "(McDonald et al., 2005)",
"ref_id": "BIBREF18"
},
{
"start": 689,
"end": 702,
"text": "Eisner (1996)",
"ref_id": "BIBREF8"
},
{
"start": 981,
"end": 982,
"text": "4",
"ref_id": null
},
{
"start": 1260,
"end": 1288,
"text": "Mc-Donald and Pereira (2006)",
"ref_id": null
},
{
"start": 1427,
"end": 1448,
"text": "Zhang and Zhao (2015)",
"ref_id": "BIBREF37"
}
],
"ref_spans": [
{
"start": 411,
"end": 420,
"text": "Figure 1b",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Graph-Based Parser",
"sec_num": "2.3"
},
{
"text": "Data sets and preprocessing. We perform experiments on a selection of nine treebanks from Universal Dependencies (Nivre et al., 2016) (v2.0): Ancient Greek PROIEL (grc), Arabic (ar), Chinese (zh), English (en), Finnish (fi), Hebrew (he), Korean (ko), Russian (ru) and Swedish (sv). This selection was proposed by Smith et al. (2018) as a sample of languages varying in language family, morphological complexity, and frequencies of non-projectivity (we refer to Smith et al. 2018for treebank statistics). To these 9, we add the English Penn Treebank (en-ptb) converted to Stanford Dependencies. 5 We use sections 2-21 for training, 24 as development set and 23 as test set.",
"cite_spans": [
{
"start": 113,
"end": 133,
"text": "(Nivre et al., 2016)",
"ref_id": "BIBREF26"
},
{
"start": 313,
"end": 332,
"text": "Smith et al. (2018)",
"ref_id": "BIBREF32"
},
{
"start": 594,
"end": 595,
"text": "5",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "3"
},
{
"text": "We use automatically predicted universal POS tags in all the experiments. The tags are assigned using a CRF tagger (Mueller et al., 2013) . We annotate the training sets via 5-fold jackknifing.",
"cite_spans": [
{
"start": 115,
"end": 137,
"text": "(Mueller et al., 2013)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "3"
},
{
"text": "Evaluation. We evaluate the experiments using Labeled Attachment Score (LAS). 6 We train models for 30 epochs and select the best model based on development LAS. We follow recommendations from Reimers and Gurevych (2018) and report averages and standard deviations from six models trained with different random seeds. We test for significance using the Wilcoxon rank-sum test with p-value < 0.05.",
"cite_spans": [
{
"start": 78,
"end": 79,
"text": "6",
"ref_id": null
},
{
"start": 193,
"end": 220,
"text": "Reimers and Gurevych (2018)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "3"
},
{
"text": "Analysis is carried out on the development sets in order not to compromise the test sets. We present the results on the concatenation of all the development sets (one model per language). While the absolute numbers vary across languages, the general trends are consistent with the concatenation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "3"
},
{
"text": "Implementation details. All the described parsers were implemented with the DyNet library (Neubig et al., 2017) . 7 We use the same hyperparameters as Kiperwasser and Goldberg (2016) and summarize them in Table 2 Corresponding standard deviations are provided in Table 3 in Appendix A.",
"cite_spans": [
{
"start": 90,
"end": 111,
"text": "(Neubig et al., 2017)",
"ref_id": null
},
{
"start": 114,
"end": 115,
"text": "7",
"ref_id": null
},
{
"start": 151,
"end": 182,
"text": "Kiperwasser and Goldberg (2016)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [
{
"start": 205,
"end": 212,
"text": "Table 2",
"ref_id": null
},
{
"start": 263,
"end": 270,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experimental Setup",
"sec_num": "3"
},
{
"text": "We start by evaluating the performance of our four models. The purpose is to verify that the simple architectures will compensate for the lack of additional structural features and achieve comparable accuracy to the extended ones. Table 1 shows the accuracy of all the parsers. Comparing the simple and extended architectures we see that dropping the structural features does not hurt the performance, neither for transitionbased nor graph-based parsers. Figure 2 displays the accuracy relative to dependency length in terms of recall. 8 It shows that the differences between models are not restricted to arcs of particular lengths.",
"cite_spans": [],
"ref_spans": [
{
"start": 231,
"end": 238,
"text": "Table 1",
"ref_id": null
},
{
"start": 455,
"end": 463,
"text": "Figure 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Simple vs. Extended Architectures",
"sec_num": "4.1"
},
{
"text": "In the case of graph-based models (GBMIN vs. GBSIBL) adding the second-order features to a BiLSTM-based parser improves the average performance slightly. However, the difference between those two models is significant only for two out of ten treebanks. For the transition-based parser (TBMIN vs. TBEXT) a different effect can be noticed -additional features cause a significant loss in accuracy for seven out of ten treebanks. One possible explanation might be that TBEXT suffers more from error propagation than TBMIN. The parser is greedy and after making the first mistake it starts drawing features from configurations which were not observed during training. Since the extended architecture uses more features than the simple one the impact of the error propagation might be stronger. This effect can be noticed in Figure 2 . The curves for TBMIN and TBEXT are almost parallel for the short arcs but the performance of TBEXT deteriorates for the longer ones, which are more prone to error propagation (Mc-Donald and Nivre, 2007 Nivre, 2007) . ",
"cite_spans": [
{
"start": 1006,
"end": 1032,
"text": "(Mc-Donald and Nivre, 2007",
"ref_id": null
},
{
"start": 1033,
"end": 1045,
"text": "Nivre, 2007)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [
{
"start": 820,
"end": 828,
"text": "Figure 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Simple vs. Extended Architectures",
"sec_num": "4.1"
},
{
"text": "We now investigate whether BiLSTMs are the reason for models being able to compensate for lack of features drawn from partial subtrees.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Influence of BiLSTMs",
"sec_num": "4.2"
},
{
"text": "Transition-based parser. We train TBPARS in two settings: with and without BiLSTMs (when no BiLSTMs are used we pass vectors x i directly to the MLP layer following Chen and Manning (2014)) and with different feature sets. We start with a feature set {s 0 } and consecutively add more until we reach the full feature model of TBEXT. Figure 3a displays the accuracy of all the trained models. First of all, we notice that the models without BiLSTMs (light bars) benefit from structural features. The biggest gains in the average performance are visible after adding vectors s 0L (5.15 LAS) and s 1R (1.12 LAS) . After adding s 1R the average improvements become modest.",
"cite_spans": [],
"ref_spans": [
{
"start": 333,
"end": 342,
"text": "Figure 3a",
"ref_id": "FIGREF3"
}
],
"eq_spans": [],
"section": "Influence of BiLSTMs",
"sec_num": "4.2"
},
{
"text": "Adding the BiLSTM representations changes the picture (dark bars). First of all, as in the case of arc-standard system (Shi et al., 2017) , the feature set { s 0 , s 1 , b 0 } is minimal for ASWAP: none of the other structural features are able to improve the performance of the parser but dropping b 0 causes a big drop of almost 6 LAS on average. Secondly, the parsers which use BiLSTMs always have a big advantage over the parsers which do not, regardless of the feature model used.",
"cite_spans": [
{
"start": 119,
"end": 137,
"text": "(Shi et al., 2017)",
"ref_id": "BIBREF30"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Influence of BiLSTMs",
"sec_num": "4.2"
},
{
"text": "s 0 s 1 b 0 s 2 s 0L s 0R s 1L s 1R s 2L s 2R b 0L 0 20 40 60 80 LAS TbPars +BiLSTM (a) Transition-based parser h,d(,s) dist h \u00b11 , d \u00b11 h \u00b12 , d",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Influence of BiLSTMs",
"sec_num": "4.2"
},
{
"text": "Graph-based parser. We train two models: GBMIN and GBSIBL with and without BiLSTMs. To ensure a fairer comparison with the models without BiLSTMs we expand the basic feature sets ({ h , d } and { h , d , s }) with additional surface features known from classic graph-based parsers, such as distance between head and dependent (dist), words at distance of 1 from heads and dependents (h \u00b11 , d \u00b11 ) and at distance \u00b12. We follow Wang and Chang (2016) and encode distance as randomly initialized embeddings. Figure 3b displays the accuracy of all the trained models with incremental extensions to their feature sets. First of all, we see that surface fea-",
"cite_spans": [
{
"start": 428,
"end": 449,
"text": "Wang and Chang (2016)",
"ref_id": "BIBREF34"
}
],
"ref_spans": [
{
"start": 506,
"end": 515,
"text": "Figure 3b",
"ref_id": "FIGREF3"
}
],
"eq_spans": [],
"section": "Influence of BiLSTMs",
"sec_num": "4.2"
},
{
"text": "tures (dist, h \u00b11 , d \u00b11 , h \u00b12 , d \u00b12 )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Influence of BiLSTMs",
"sec_num": "4.2"
},
{
"text": "are beneficial for the models without BiLSTM representations (light bars). The improvements are visible for both parsers, with the smallest gains after adding h \u00b12 , d \u00b12 vectors: on average 0.35 LAS for GBSIBL and 0.83 LAS for GBMIN.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Influence of BiLSTMs",
"sec_num": "4.2"
},
{
"text": "As expected, adding BiLSTMs changes the picture. Since the representations capture surface context, they already contain a lot of information about words around heads and dependents and adding features h \u00b11 , d \u00b11 and h \u00b12 , d \u00b12 does not influence the performance. Interestingly, introducing dist is also redundant which suggests that either BiLSTMs are aware of the distance between tokens or they are not able to use this information in a meaningful way. Finally, even after adding all the surface features the models which do not employ BiLSTMs are considerably behind the ones which do.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Influence of BiLSTMs",
"sec_num": "4.2"
},
{
"text": "Comparing GBMIN (blue) with GBSIBL (red) we see that adding information about structural context through second-order features is beneficial when the BiLSTM are not used (light bars): the second-order GBSIBL has an advantage over GBMIN of 0.81 LAS even when both of the models use all the additional surface information (last group of bars on the plot). But this advantage drops down to insignificant 0.07 LAS when the BiLSTMs are incorporated.",
"cite_spans": [
{
"start": 35,
"end": 40,
"text": "(red)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Influence of BiLSTMs",
"sec_num": "4.2"
},
{
"text": "We conclude that, for both transition-and graph-based parsers, BiLSTMs not only compensate for absence of structural features but they also encode more information than provided by the manually designed feature sets.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Influence of BiLSTMs",
"sec_num": "4.2"
},
{
"text": "Now that we have established that structural features are indeed redundant for models which employ BiLSTMs we examine the ways in which the simple parsing models (TBMIN and GBMIN) implicitly encode information about partial subtrees.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Implicit Structural Context",
"sec_num": "5"
},
{
"text": "We start by looking at the BiLSTM representations. We know that the representations are capable of capturing syntactic relations when they are trained on a syntactically related task, e.g, number prediction task (Linzen et al., 2016) . We evaluate how complicated those relations can be when the representations are trained together with a dependency parser.",
"cite_spans": [
{
"start": 212,
"end": 233,
"text": "(Linzen et al., 2016)",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Structure and BiLSTM Representations",
"sec_num": "5.1"
},
{
"text": "To do so, we follow Gaddy et al. (2018) and use derivatives to estimate how sensitive a particular part of the architecture is with respect to changes in input. Specifically, for every vector x we measure how it is influenced by every word represen- tation x i from the sentence. If the derivative of x with respect to x i is high then the word x i has a high influence on the vector. We compute the l 2norm of the gradient of x with respect to x i and normalize it by the sum of norms of all the words from the sentence calling this measure impact:",
"cite_spans": [
{
"start": 20,
"end": 39,
"text": "Gaddy et al. (2018)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Structure and BiLSTM Representations",
"sec_num": "5.1"
},
{
"text": "impact( x , i) = 100 \u00d7 || \u2202 x \u2202x i || j || \u2202 x \u2202x j ||",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structure and BiLSTM Representations",
"sec_num": "5.1"
},
{
"text": "For every sentence from the development set and every vector x i we calculate the impact of every representation x j from the sentence on the vector x i . We bucket those impact values according to the distance between the representation and the word. We then use the gold-standard trees to divide every bucket into five groups: correct heads of x i , children (i.e., dependents) of x i , grandparents (i.e., heads of heads), siblings, and other. Figure 4 shows the average impact of tokens at particular positions. Similarly as shown by Gaddy et al. (2018) even words 15 and more positions away have a non-zero effect on the BiLSTM vector. Interestingly, the impact of words which we know to be structurally close to x i is higher. For example, for the transition-based parser (Figure 4a) at positions \u00b15 an average impact is lower than 2.5%, children and siblings of x i have a slightly higher impact, and the heads and grandparents around 5%. For the graph-based parser (Figure 4b ) the picture is similar with two noticeable differences. The impact of heads is much stronger for words 10 and more positions apart. But it is smaller than in the case of transition-based parser when the heads are next to x i .",
"cite_spans": [
{
"start": 538,
"end": 557,
"text": "Gaddy et al. (2018)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [
{
"start": 447,
"end": 455,
"text": "Figure 4",
"ref_id": "FIGREF4"
},
{
"start": 778,
"end": 789,
"text": "(Figure 4a)",
"ref_id": "FIGREF4"
},
{
"start": 973,
"end": 983,
"text": "(Figure 4b",
"ref_id": "FIGREF4"
}
],
"eq_spans": [],
"section": "Structure and BiLSTM Representations",
"sec_num": "5.1"
},
{
"text": "We conclude that the BiLSTMs are indeed influenced by the distance, but when trained with a dependency parser they also capture a significant amount of non-trivial syntactic relations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structure and BiLSTM Representations",
"sec_num": "5.1"
},
{
"text": "Now that we know that the representations encode structural information we ask how this information influences the decisions of the parser.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structure and Information Flow",
"sec_num": "5.2"
},
{
"text": "First, we investigate how much structural information flows into the final layer of the network. When we look back at the architecture in Figure 1 we see that when the final MLP scores possible transitions or arcs it uses only feature vectors { s 0 , s 1 , b 0 } or { h , d }. But thanks to the BiLSTMs the vectors encode information about other words from the sentence. We examine from which words the signal is the strongest when the parser makes the final decision.",
"cite_spans": [],
"ref_spans": [
{
"start": 138,
"end": 144,
"text": "Figure",
"ref_id": null
}
],
"eq_spans": [],
"section": "Structure and Information Flow",
"sec_num": "5.2"
},
{
"text": "We extend the definition of impact to capture how a specific word representation x i influences the final MLP score sc (we calculate the derivative of sc with respect to x i ). We parse every development sentence. For every predicted transition/arc we calculate how much its score sc was affected by every word from the sentence. We group impacts of words depending on their positions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structure and Information Flow",
"sec_num": "5.2"
},
{
"text": "Transition-based parser. For the transitionbased parser we group tokens according to their positions in the configuration. For example, for the decision in Figure 1a impact(sc, 1) would be grouped as s 1 and impact(sc, j) as s 0R .",
"cite_spans": [],
"ref_spans": [
{
"start": 156,
"end": 165,
"text": "Figure 1a",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Structure and Information Flow",
"sec_num": "5.2"
},
{
"text": "In Figure 5a we plot the 15 positions with the highest impact and the number of configurations they appear in (gray bars). As expected, s 0 , s 1 , and . L marks left children that are not the leftmost, . R marks right children that are not the rightmost. b 0 have the highest influence on the decision of the parser. The next two positions are s 1R and s 0L . Interestingly, those are the same positions which used as features caused the biggest gains in performance for the models which did not use BiLSTMs (see Figure 3a) . They are much less frequent than b 1 but when they are present the model is strongly influenced by them. After b 1 we can notice positions which are not part of the manually designed extended feature set of TBEXT, such as s 0L (left children of s 0 that are not the leftmost).",
"cite_spans": [],
"ref_spans": [
{
"start": 3,
"end": 12,
"text": "Figure 5a",
"ref_id": "FIGREF7"
},
{
"start": 514,
"end": 524,
"text": "Figure 3a)",
"ref_id": "FIGREF3"
}
],
"eq_spans": [],
"section": "Structure and Information Flow",
"sec_num": "5.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "s 0 s 1 b 0 s 1R s 0L b 1 s 0R s 0L s 0R s 2R s 1R s 1L s 1L b 2 s 2 0",
"eq_num": "100k"
}
],
"section": "Structure and Information Flow",
"sec_num": "5.2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "h d c d \u00b11 s h \u00b11 d \u00b12 g h \u00b12 d \u00b13 0",
"eq_num": "50k"
}
],
"section": "Structure and Information Flow",
"sec_num": "5.2"
},
{
"text": "Graph-based parser. For the graph-based parser we group tokens according to their position in the full predicted tree. We then bucket the impacts into: heads (h), dependents (d), children (i.e., dependents of dependents) (c), siblings (s), and grandparents (i.e., heads of heads) (g). Words which do not fall into any of those categories are grouped according to their surface distance from heads and dependents. For example, h \u00b12 are tokens two positions away from the head which do not act as dependent, child, sibling, or grandparent. Figure 5b presents 10 positions with the highest impact and the number of arcs for which they are present (gray bars). As expected, heads and dependents have the highest impact on the scores of arcs, much higher than any of the other tokens. Interestingly, among the next three bins with the highest impact are children and siblings. Children are less frequent than structurally unrelated tokens at distance 1 (h \u00b11 , d \u00b11 ), and much less frequent than h \u00b12 or d \u00b12 but they influence the final scores more. The interesting case is siblings -they not only have a strong average impact but they are also very frequent, suggesting that they are very important for the parsing accuracy.",
"cite_spans": [],
"ref_spans": [
{
"start": 538,
"end": 547,
"text": "Figure 5b",
"ref_id": "FIGREF7"
}
],
"eq_spans": [],
"section": "Structure and Information Flow",
"sec_num": "5.2"
},
{
"text": "The results above show that the implicit structural context is not only present in the models, but also more diverse than when incorporated through conventional explicit structural features.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structure and Information Flow",
"sec_num": "5.2"
},
{
"text": "Finally, we investigate if the implicit structural context is important for the performance of the parsers. To do so, we take tokens at structural positions with the highest impact and train new ablated models in which the information about those tokens is dropped from the BiLSTM layer. For example, while training an ablated model without s 0L , for every configuration we re-calculate all the BiLSTM vectors as if s 0L was not in the sentence. When there is more than one token at a specific position, for example s 0L or c (i.e., children of the dependent), we pick a random one to drop. That way every ablated model looses information about at most one word.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structure and Performance",
"sec_num": "5.3"
},
{
"text": "We note that several factors can be responsible for drops in performance of the ablated models. For example, the proposed augmentation distorts distance between tokens which might have an adverse impact on the trained representations. Therefore, in the following comparative analysis we interpret the obtained drops as an approximation of how much particular tokens influence the performance of the models.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structure and Performance",
"sec_num": "5.3"
},
{
"text": "Transition-based parser. Figure 6a presents the drops in the parsing performance for the ab- lated models. 9 First of all, removing the vectors { s 0 , s 1 , b 0 } (marked in green on the plot) only from the BiLSTM layer (although they are still used as features) causes visible drops in performance. One explanation might be that when the vector s 0 is recalculated without knowledge of s 1 the model loses information about the distance between them. Secondly, we can notice that other drops depend on both the impact and frequency of positions. The biggest declines are visible after removing s 0L and s 1R -precisely the positions which we found to have the highest impact on the parsing decisions. Interestingly, the positions which were not a part of the TBEXT feature set, such as s 0L or s 1R , although not frequent are important for the performance.",
"cite_spans": [],
"ref_spans": [
{
"start": 25,
"end": 34,
"text": "Figure 6a",
"ref_id": "FIGREF8"
}
],
"eq_spans": [],
"section": "Structure and Performance",
"sec_num": "5.3"
},
{
"text": "s 0 s 1 b 0 s 1R s 0L b 1 s 0R s 0L s 0R s 2R s 1R s 1L s 1L b 2 s",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structure and Performance",
"sec_num": "5.3"
},
{
"text": "Graph-based parser. Corresponding results for the graph-based parser are presented in Figure 6b (we use gold-standard trees as the source of information about structural relations between tokens). The biggest drop can be observed for ablated models without siblings. Clearly, information coming from those tokens implicitly into MLP is very important for the final parsing accuracy. The next two biggest drops are caused by lack of children and grandparents. As we showed in Figure 5b children, although less frequent, have a stronger impact on the decision of the parser. But dropping grandparents also significantly harms the models.",
"cite_spans": [],
"ref_spans": [
{
"start": 86,
"end": 95,
"text": "Figure 6b",
"ref_id": "FIGREF8"
},
{
"start": 475,
"end": 484,
"text": "Figure 5b",
"ref_id": "FIGREF7"
}
],
"eq_spans": [],
"section": "Structure and Performance",
"sec_num": "5.3"
},
{
"text": "We conclude that information about partial subtrees is not only present when the parser makes 9 It is worth noting that not all of the models suffer from the ablation. For example, dropping vectors s2R causes almost no harm. This suggests that re-calculating the representations multiple times does not have a strong negative effect on training.",
"cite_spans": [
{
"start": 94,
"end": 95,
"text": "9",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Structure and Performance",
"sec_num": "5.3"
},
{
"text": "final decisions but also strongly influences those decisions. Additionally, the deteriorated accuracy of the ablated models shows that the implicit structural context can not be easily compensated for.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Structure and Performance",
"sec_num": "5.3"
},
{
"text": "Feature extraction. Kiperwasser and Goldberg (2016) and Cross and Huang (2016) first applied BiLSTMs to extract features for transition-based dependency parsers. The authors demonstrated that an architecture using only a few positional features (four for the arc-hybrid system and three for arc-standard) is sufficient to achieve state-ofthe-art performance. Shi et al. (2017) showed that this number can be further reduced to two features for arc-hybrid and arc-eager systems. Decreasing the size of the feature set not only allows for construction of lighter and faster neural networks (Wang and Chang, 2016; Vilares and G\u00f3mez-Rodr\u00edguez, 2018 ) but also enables the use of exact search algorithms for several projective (Shi et al., 2017) and non-projective (G\u00f3mez-Rodr\u00edguez et al., 2018) transition systems. A similar trend can be observed for graph-based dependency parsers. State-of-the-art models (Kiperwasser and Goldberg, 2016; Dozat and Manning, 2016) typically use only two features of heads and dependents, possibly also incorporating their distance (Wang and Chang, 2016) . Moreover, Wang and Chang (2016) show that arc-factored BiLSTM-based parsers can compete with conventional higher-order models in terms of accuracy.",
"cite_spans": [
{
"start": 20,
"end": 51,
"text": "Kiperwasser and Goldberg (2016)",
"ref_id": "BIBREF13"
},
{
"start": 56,
"end": 78,
"text": "Cross and Huang (2016)",
"ref_id": "BIBREF4"
},
{
"start": 359,
"end": 376,
"text": "Shi et al. (2017)",
"ref_id": "BIBREF30"
},
{
"start": 588,
"end": 610,
"text": "(Wang and Chang, 2016;",
"ref_id": "BIBREF34"
},
{
"start": 611,
"end": 644,
"text": "Vilares and G\u00f3mez-Rodr\u00edguez, 2018",
"ref_id": "BIBREF33"
},
{
"start": 722,
"end": 740,
"text": "(Shi et al., 2017)",
"ref_id": "BIBREF30"
},
{
"start": 1061,
"end": 1083,
"text": "(Wang and Chang, 2016)",
"ref_id": "BIBREF34"
},
{
"start": 1096,
"end": 1117,
"text": "Wang and Chang (2016)",
"ref_id": "BIBREF34"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "None of the above mentioned efforts address the question how dependency parsers are able to compensate for the lack of structural features. The very recent work by de Lhoneux et al. (2019) looked into this issue from a different perspec-tive than ours -composition. They showed that composing the structural context with recursive networks as in Dyer et al. (2015) is redundant for the K&G transition-based architecture. The authors analyze components of the BiLSTMs to show which of them (forward v. backward LSTM) is responsible for capturing subtree information.",
"cite_spans": [
{
"start": 164,
"end": 188,
"text": "de Lhoneux et al. (2019)",
"ref_id": "BIBREF15"
},
{
"start": 346,
"end": 364,
"text": "Dyer et al. (2015)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "RNNs and syntax. Recurrent neural networks, which BiLSTMs are a variant of, have been repeatedly analyzed to understand whether they can learn syntactic relations. Such analyses differ in terms of: (1) methodology they employ to probe what type of knowledge the representations learned and (2) tasks on which the representations are trained on. Shi et al. (2016) demonstrated that sequence-to-sequence machinetranslation systems capture source-language syntactic relations. Linzen et al. (2016) showed that when trained on the task of number agreement prediction the representations capture a nontrivial amount of grammatical structure (although recursive neural networks are better at this task than sequential LSTMs (Kuncoro et al., 2018) ). Blevins et al. (2018) found that RNN representations trained on a variety of NLP tasks (including dependency parsing) are able to induce syntactic features (e.g., constituency labels of parent or grandparent) even without explicit supervision. Finally, Conneau et al. (2018) designed a set of tasks probing linguistic knowledge of sentence embedding methods.",
"cite_spans": [
{
"start": 345,
"end": 362,
"text": "Shi et al. (2016)",
"ref_id": "BIBREF31"
},
{
"start": 474,
"end": 494,
"text": "Linzen et al. (2016)",
"ref_id": "BIBREF17"
},
{
"start": 718,
"end": 740,
"text": "(Kuncoro et al., 2018)",
"ref_id": "BIBREF14"
},
{
"start": 744,
"end": 765,
"text": "Blevins et al. (2018)",
"ref_id": "BIBREF0"
},
{
"start": 997,
"end": 1018,
"text": "Conneau et al. (2018)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "Our work contributes to this line of research in two ways: (1) from the angle of methodology, we show how to employ derivatives to pinpoint what syntactic relations the representations learn;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "(2) from the perspective of tasks, we demonstrate how BiLSTM-based dependency parsers take advantage of structural information encoded in the representations. In the case of constituency parsing Gaddy et al. (2018) offer such an analysis. The authors show that their BiLSTM-based models implicitly learn the same information which was conventionally provided to non-neural parsers, such as grammars and lexicons.",
"cite_spans": [
{
"start": 195,
"end": 214,
"text": "Gaddy et al. (2018)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "We examined how the application of BiLSTMs influences the modern transition-and graph-based parsing architectures. The BiLSTM-based parsers can compensate for the lack of traditional structural features. Specifically, the features drawn from partial subtrees become redundant because the parsing models encode them implicitly.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion and Conclusion",
"sec_num": "7"
},
{
"text": "The main advantage of BiLSTMs comes with their ability to capture not only surface but also syntactic relations. When the representations are trained together with a parser they encode structurally-advanced relations such as heads, children, or even siblings and grandparents. This structural information is then passed directly (through feature vectors) and indirectly (through BiLSTMs encoding) to MLP and is used for scoring transitions and arcs. Finally, the implicit structural information is important for the final parsing decisions: dropping it in ablated models causes their performance to deteriorate.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion and Conclusion",
"sec_num": "7"
},
{
"text": "The introduction of BiLSTMs into dependency parsers has an additional interesting consequence. The classical transition-and graph-based dependency parsers have their strengths and limitations due to the trade-off between the richness of feature functions and the inference algorithm (Mc-Donald and Nivre, 2007) . Our transition-and graph-based architectures use the same word representations. We showed that those representations trained together with the parsers capture syntactic relations in a similar way. Moreover, the transition-based parser does not incorporate structural features through the feature set. And the graph-based parser makes use of far away surface tokens but also structurally related words. Evidently, the employment of BiLSTM feature extractors blurs the difference between the two architectures. The one clear advantage of the graphbased parser is that it performs global inference (but exact search algorithms are already being applied to projective (Shi et al., 2017) and nonprojective (G\u00f3mez-Rodr\u00edguez et al., 2018) transition systems). Therefore, an interesting question is if integrating those two architectures can still be beneficial for the parsing accuracy as in Nivre and McDonald (2008) . We leave this question for future work.",
"cite_spans": [
{
"start": 283,
"end": 310,
"text": "(Mc-Donald and Nivre, 2007)",
"ref_id": null
},
{
"start": 977,
"end": 995,
"text": "(Shi et al., 2017)",
"ref_id": "BIBREF30"
},
{
"start": 1198,
"end": 1223,
"text": "Nivre and McDonald (2008)",
"ref_id": "BIBREF27"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Discussion and Conclusion",
"sec_num": "7"
},
{
"text": "SeeFigure 1for the concept of structural context, details of the architectures will be described in Section 2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "See results from the recent CoNLL 2018 shared task on dependency parsing(Zeman et al., 2018) for a comparison of various high-performing dependency parsers.3 To the best of our knowledge, this is the first BiLSTMbased second-order dependency parser. incorporate BiLSTM-based representations into the third-order 1-Endpoint-Crossing parser ofPitler (2014).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Replacing Eisner (1996)'s algorithm with the Chu-Liu-Edmonds's decoder(Chu and Liu, 1965; Edmonds, 1967) which can predict non-projective arcs causes significant improvements only for the Ancient Greek treebank (1.02 LAS on test set).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We use version 3.4.1 of the Stanford Parser from http://nlp.stanford.edu/software/ lex-parser.shtml6 The ratio of tokens with a correct head and label to the total number of tokens in the test data.7 The code can be found on the first author's website.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "This work was supported by the Deutsche Forschungsgemeinschaft (DFG) via the SFB 732, project D8. We would like to thank the anonymous reviewers for their comments. We also thank our colleagues Anders Bj\u00f6rkelund,\u00d6zlem \u00c7 etinoglu, and Xiang Yu for many conversations and comments on this work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Deep RNNs Encode Soft Hierarchical Syntax",
"authors": [
{
"first": "Terra",
"middle": [],
"last": "Blevins",
"suffix": ""
},
{
"first": "Omer",
"middle": [],
"last": "Levy",
"suffix": ""
},
{
"first": "Luke",
"middle": [],
"last": "Zettlemoyer",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "14--19",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Terra Blevins, Omer Levy, and Luke Zettlemoyer. 2018. Deep RNNs Encode Soft Hierarchical Syn- tax. In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Vol- ume 2: Short Papers), pages 14-19, Melbourne, Australia. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "A Fast and Accurate Dependency Parser using Neural Networks",
"authors": [
{
"first": "Danqi",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP)",
"volume": "",
"issue": "",
"pages": "740--750",
"other_ids": {
"DOI": [
"10.3115/v1/D14-1082"
]
},
"num": null,
"urls": [],
"raw_text": "Danqi Chen and Christopher Manning. 2014. A Fast and Accurate Dependency Parser using Neural Net- works. In Proceedings of the 2014 Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 740-750. Association for Compu- tational Linguistics.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "On shortest arborescence of a directed graph",
"authors": [
{
"first": "Yoeng-Jin",
"middle": [],
"last": "Chu",
"suffix": ""
},
{
"first": "Tseng-Hong",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 1965,
"venue": "Scientia Sinica",
"volume": "14",
"issue": "10",
"pages": "1396--1400",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yoeng-Jin Chu and Tseng-Hong Liu. 1965. On shortest arborescence of a directed graph. Scientia Sinica, 14(10):1396-1400.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "What you can cram into a single $&!#* vector: Probing sentence embeddings for linguistic properties",
"authors": [
{
"first": "Alexis",
"middle": [],
"last": "Conneau",
"suffix": ""
},
{
"first": "Germ\u00e1n",
"middle": [],
"last": "Kruszewski",
"suffix": ""
},
{
"first": "Guillaume",
"middle": [],
"last": "Lample",
"suffix": ""
},
{
"first": "Lo\u00efc",
"middle": [],
"last": "Barrault",
"suffix": ""
},
{
"first": "Marco",
"middle": [],
"last": "Baroni",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "2126--2136",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alexis Conneau, Germ\u00e1n Kruszewski, Guillaume Lample, Lo\u00efc Barrault, and Marco Baroni. 2018. What you can cram into a single $&!#* vector: Probing sentence embeddings for linguistic proper- ties. In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Vol- ume 1: Long Papers), pages 2126-2136, Melbourne, Australia. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Incremental Parsing with Minimal Features Using Bi-Directional LSTM",
"authors": [
{
"first": "James",
"middle": [],
"last": "Cross",
"suffix": ""
},
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "2",
"issue": "",
"pages": "32--37",
"other_ids": {
"DOI": [
"10.18653/v1/P16-2006"
]
},
"num": null,
"urls": [],
"raw_text": "James Cross and Liang Huang. 2016. Incremental Parsing with Minimal Features Using Bi-Directional LSTM. In Proceedings of the 54th Annual Meet- ing of the Association for Computational Linguistics (Volume 2: Short Papers), pages 32-37. Association for Computational Linguistics.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Deep Biaffine Attention for Neural Dependency Parsing",
"authors": [
{
"first": "Timothy",
"middle": [],
"last": "Dozat",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
}
],
"year": 2016,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Timothy Dozat and Christopher D. Manning. 2016. Deep Biaffine Attention for Neural Dependency Parsing. CoRR, abs/1611.01734.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Transition-Based Dependency Parsing with Stack Long Short-Term Memory",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Dyer",
"suffix": ""
},
{
"first": "Miguel",
"middle": [],
"last": "Ballesteros",
"suffix": ""
},
{
"first": "Wang",
"middle": [],
"last": "Ling",
"suffix": ""
},
{
"first": "Austin",
"middle": [],
"last": "Matthews",
"suffix": ""
},
{
"first": "Noah",
"middle": [
"A"
],
"last": "Smith",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of the 53rd Annual Meeting of the Association for Computational Linguistics and the 7th International Joint Conference on Natural Language Processing",
"volume": "1",
"issue": "",
"pages": "334--343",
"other_ids": {
"DOI": [
"10.3115/v1/P15-1033"
]
},
"num": null,
"urls": [],
"raw_text": "Chris Dyer, Miguel Ballesteros, Wang Ling, Austin Matthews, and Noah A. Smith. 2015. Transition- Based Dependency Parsing with Stack Long Short- Term Memory. In Proceedings of the 53rd Annual Meeting of the Association for Computational Lin- guistics and the 7th International Joint Conference on Natural Language Processing (Volume 1: Long Papers), pages 334-343. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Optimum branchings",
"authors": [],
"year": 1967,
"venue": "Journal of Research of the National Bureau of Standards B",
"volume": "71",
"issue": "4",
"pages": "233--240",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jack Edmonds. 1967. Optimum branchings. Journal of Research of the National Bureau of Standards B, 71(4):233-240.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Three New Probabilistic Models for Dependency Parsing: An Exploration",
"authors": [
{
"first": "Jason",
"middle": [
"M"
],
"last": "Eisner",
"suffix": ""
}
],
"year": 1996,
"venue": "The 16th International Conference on Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jason M. Eisner. 1996. Three New Probabilistic Mod- els for Dependency Parsing: An Exploration. In COLING 1996 Volume 1: The 16th International Conference on Computational Linguistics.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "What's Going On in Neural Constituency Parsers? An Analysis",
"authors": [
{
"first": "David",
"middle": [],
"last": "Gaddy",
"suffix": ""
},
{
"first": "Mitchell",
"middle": [],
"last": "Stern",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Klein",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "1",
"issue": "",
"pages": "999--1010",
"other_ids": {
"DOI": [
"10.18653/v1/N18-1091"
]
},
"num": null,
"urls": [],
"raw_text": "David Gaddy, Mitchell Stern, and Dan Klein. 2018. What's Going On in Neural Constituency Parsers? An Analysis. In Proceedings of the 2018 Confer- ence of the North American Chapter of the Associ- ation for Computational Linguistics: Human Lan- guage Technologies, Volume 1 (Long Papers), pages 999-1010. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Global Transition-based Non-projective Dependency Parsing",
"authors": [
{
"first": "Carlos",
"middle": [],
"last": "G\u00f3mez-Rodr\u00edguez",
"suffix": ""
},
{
"first": "Tianze",
"middle": [],
"last": "Shi",
"suffix": ""
},
{
"first": "Lillian",
"middle": [],
"last": "Lee",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "2664--2675",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Carlos G\u00f3mez-Rodr\u00edguez, Tianze Shi, and Lillian Lee. 2018. Global Transition-based Non-projective De- pendency Parsing. In Proceedings of the 56th An- nual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 2664- 2675, Melbourne, Australia. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Framewise Phoneme Classification with Bidirectional LSTM and Other Neural Network Architectures",
"authors": [
{
"first": "Alex",
"middle": [],
"last": "Graves",
"suffix": ""
},
{
"first": "J\u00fcrgen",
"middle": [],
"last": "Schmidhuber",
"suffix": ""
}
],
"year": 2005,
"venue": "Neural Networks",
"volume": "18",
"issue": "5",
"pages": "602--610",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Alex Graves and J\u00fcrgen Schmidhuber. 2005. Frame- wise Phoneme Classification with Bidirectional LSTM and Other Neural Network Architectures. Neural Networks, 18(5):602-610.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Long short-term memory",
"authors": [
{
"first": "Sepp",
"middle": [],
"last": "Hochreiter",
"suffix": ""
},
{
"first": "J\u00fcrgen",
"middle": [],
"last": "Schmidhuber",
"suffix": ""
}
],
"year": 1997,
"venue": "Neural computation",
"volume": "9",
"issue": "8",
"pages": "1735--1780",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sepp Hochreiter and J\u00fcrgen Schmidhuber. 1997. Long short-term memory. Neural computation, 9(8):1735-1780.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations. Transactions of the Association for Computational Linguistics",
"authors": [
{
"first": "Eliyahu",
"middle": [],
"last": "Kiperwasser",
"suffix": ""
},
{
"first": "Yoav",
"middle": [],
"last": "Goldberg",
"suffix": ""
}
],
"year": 2016,
"venue": "",
"volume": "4",
"issue": "",
"pages": "313--327",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Eliyahu Kiperwasser and Yoav Goldberg. 2016. Sim- ple and Accurate Dependency Parsing Using Bidi- rectional LSTM Feature Representations. Transac- tions of the Association for Computational Linguis- tics, 4:313-327.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "LSTMs Can Learn Syntax-Sensitive Dependencies Well, But Modeling Structure Makes Them Better",
"authors": [
{
"first": "Adhiguna",
"middle": [],
"last": "Kuncoro",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Dyer",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Hale",
"suffix": ""
},
{
"first": "Dani",
"middle": [],
"last": "Yogatama",
"suffix": ""
},
{
"first": "Stephen",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "Phil",
"middle": [],
"last": "Blunsom",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1426--1436",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Adhiguna Kuncoro, Chris Dyer, John Hale, Dani Yo- gatama, Stephen Clark, and Phil Blunsom. 2018. LSTMs Can Learn Syntax-Sensitive Dependencies Well, But Modeling Structure Makes Them Better. In Proceedings of the 56th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 1426-1436. Association for Computational Linguistics.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Recursive subtree composition in lstm-based dependency parsing",
"authors": [
{
"first": "Miguel",
"middle": [],
"last": "Miryam De Lhoneux",
"suffix": ""
},
{
"first": "Joakim",
"middle": [],
"last": "Ballesteros",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1902.09781"
]
},
"num": null,
"urls": [],
"raw_text": "Miryam de Lhoneux, Miguel Ballesteros, and Joakim Nivre. 2019. Recursive subtree composition in lstm-based dependency parsing. arXiv preprint arXiv:1902.09781.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "From raw text to universal dependencies -look, no tags!",
"authors": [
{
"first": "Yan",
"middle": [],
"last": "Miryam De Lhoneux",
"suffix": ""
},
{
"first": "Ali",
"middle": [],
"last": "Shao",
"suffix": ""
},
{
"first": "Eliyahu",
"middle": [],
"last": "Basirat",
"suffix": ""
},
{
"first": "Sara",
"middle": [],
"last": "Kiperwasser",
"suffix": ""
},
{
"first": "Yoav",
"middle": [],
"last": "Stymne",
"suffix": ""
},
{
"first": "Joakim",
"middle": [],
"last": "Goldberg",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the CoNLL 2017 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies",
"volume": "",
"issue": "",
"pages": "207--217",
"other_ids": {
"DOI": [
"10.18653/v1/K17-3022"
]
},
"num": null,
"urls": [],
"raw_text": "Miryam de Lhoneux, Yan Shao, Ali Basirat, Eliyahu Kiperwasser, Sara Stymne, Yoav Goldberg, and Joakim Nivre. 2017. From raw text to universal dependencies -look, no tags! In Proceedings of the CoNLL 2017 Shared Task: Multilingual Pars- ing from Raw Text to Universal Dependencies, pages 207-217. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Assessing the ability of lstms to learn syntaxsensitive dependencies",
"authors": [
{
"first": "Tal",
"middle": [],
"last": "Linzen",
"suffix": ""
},
{
"first": "Emmanuel",
"middle": [],
"last": "Dupoux",
"suffix": ""
},
{
"first": "Yoav",
"middle": [],
"last": "Goldberg",
"suffix": ""
}
],
"year": 2016,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "4",
"issue": "",
"pages": "521--535",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tal Linzen, Emmanuel Dupoux, and Yoav Goldberg. 2016. Assessing the ability of lstms to learn syntax- sensitive dependencies. Transactions of the Associ- ation for Computational Linguistics, 4:521-535.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Online Large-Margin Training of Dependency Parsers",
"authors": [
{
"first": "Ryan",
"middle": [],
"last": "Mcdonald",
"suffix": ""
},
{
"first": "Koby",
"middle": [],
"last": "Crammer",
"suffix": ""
},
{
"first": "Fernando",
"middle": [],
"last": "Pereira",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics (ACL'05)",
"volume": "",
"issue": "",
"pages": "91--98",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ryan McDonald, Koby Crammer, and Fernando Pereira. 2005. Online Large-Margin Training of De- pendency Parsers. In Proceedings of the 43rd An- nual Meeting of the Association for Computational Linguistics (ACL'05), pages 91-98. Association for Computational Linguistics.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Characterizing the Errors of Data-Driven Dependency Parsing Models",
"authors": [
{
"first": "Ryan",
"middle": [],
"last": "Mcdonald",
"suffix": ""
},
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"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": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ryan McDonald and Joakim Nivre. 2007. Character- izing the Errors of Data-Driven Dependency Pars- ing Models. In Proceedings of the 2007 Joint Con- ference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL).",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Online Learning of Approximate Dependency Parsing Algorithms",
"authors": [
{
"first": "Ryan",
"middle": [],
"last": "Mcdonald",
"suffix": ""
},
{
"first": "Fernando",
"middle": [],
"last": "Pereira",
"suffix": ""
}
],
"year": 2006,
"venue": "11th Conference of the European Chapter of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ryan McDonald and Fernando Pereira. 2006. On- line Learning of Approximate Dependency Parsing Algorithms. In 11th Conference of the European Chapter of the Association for Computational Lin- guistics.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Efficient higher-order crfs for morphological tagging",
"authors": [
{
"first": "Thomas",
"middle": [],
"last": "Mueller",
"suffix": ""
},
{
"first": "Helmut",
"middle": [],
"last": "Schmid",
"suffix": ""
},
{
"first": "Hinrich",
"middle": [],
"last": "Sch\u00fctze",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 2013 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "322--332",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Thomas Mueller, Helmut Schmid, and Hinrich Sch\u00fctze. 2013. Efficient higher-order crfs for mor- phological tagging. In Proceedings of the 2013 Con- ference on Empirical Methods in Natural Language Processing, pages 322-332. Association for Com- putational Linguistics.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Swabha Swayamdipta, and Pengcheng Yin. 2017. DyNet: The Dynamic Neural Network Toolkit. CoRR",
"authors": [
{
"first": "Graham",
"middle": [],
"last": "Neubig",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Dyer",
"suffix": ""
},
{
"first": "Yoav",
"middle": [],
"last": "Goldberg",
"suffix": ""
},
{
"first": "Austin",
"middle": [],
"last": "Matthews",
"suffix": ""
},
{
"first": "Waleed",
"middle": [],
"last": "Ammar",
"suffix": ""
},
{
"first": "Antonios",
"middle": [],
"last": "Anastasopoulos",
"suffix": ""
},
{
"first": "Miguel",
"middle": [],
"last": "Ballesteros",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Chiang",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Clothiaux",
"suffix": ""
},
{
"first": "Trevor",
"middle": [],
"last": "Cohn",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Duh",
"suffix": ""
},
{
"first": "Manaal",
"middle": [],
"last": "Faruqui",
"suffix": ""
},
{
"first": "Cynthia",
"middle": [],
"last": "Gan",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Garrette",
"suffix": ""
},
{
"first": "Yangfeng",
"middle": [],
"last": "Ji",
"suffix": ""
},
{
"first": "Lingpeng",
"middle": [],
"last": "Kong",
"suffix": ""
},
{
"first": "Adhiguna",
"middle": [],
"last": "Kuncoro",
"suffix": ""
},
{
"first": "Gaurav",
"middle": [],
"last": "Kumar",
"suffix": ""
},
{
"first": "Chaitanya",
"middle": [],
"last": "Malaviya",
"suffix": ""
},
{
"first": "Paul",
"middle": [],
"last": "Michel",
"suffix": ""
},
{
"first": "Yusuke",
"middle": [],
"last": "Oda",
"suffix": ""
},
{
"first": "Matthew",
"middle": [],
"last": "Richardson",
"suffix": ""
},
{
"first": "Naomi",
"middle": [],
"last": "Saphra",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Graham Neubig, Chris Dyer, Yoav Goldberg, Austin Matthews, Waleed Ammar, Antonios Anastasopou- los, Miguel Ballesteros, David Chiang, Daniel Clothiaux, Trevor Cohn, Kevin Duh, Manaal Faruqui, Cynthia Gan, Dan Garrette, Yangfeng Ji, Lingpeng Kong, Adhiguna Kuncoro, Gaurav Ku- mar, Chaitanya Malaviya, Paul Michel, Yusuke Oda, Matthew Richardson, Naomi Saphra, Swabha Swayamdipta, and Pengcheng Yin. 2017. DyNet: The Dynamic Neural Network Toolkit. CoRR, abs/1701.03980.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Incrementality in deterministic dependency parsing",
"authors": [
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the Workshop on Incremental Parsing: Bringing Engineering and Cognition Together",
"volume": "",
"issue": "",
"pages": "50--57",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joakim Nivre. 2004. Incrementality in deterministic dependency parsing. In Proceedings of the Work- shop on Incremental Parsing: Bringing Engineering and Cognition Together, pages 50-57, Barcelona, Spain.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Non-Projective Dependency Parsing in Expected Linear Time",
"authors": [
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP",
"volume": "",
"issue": "",
"pages": "351--359",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joakim Nivre. 2009. Non-Projective Dependency Pars- ing in Expected Linear Time. In Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP, pages 351-359. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "An Improved Oracle for Dependency Parsing with Online Reordering",
"authors": [
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
},
{
"first": "Marco",
"middle": [],
"last": "Kuhlmann",
"suffix": ""
},
{
"first": "Johan",
"middle": [],
"last": "Hall",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the 11th International Conference on Parsing Technologies (IWPT'09)",
"volume": "",
"issue": "",
"pages": "73--76",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joakim Nivre, Marco Kuhlmann, and Johan Hall. 2009. An Improved Oracle for Dependency Parsing with Online Reordering. In Proceedings of the 11th International Conference on Parsing Technologies (IWPT'09), pages 73-76. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Universal Dependencies v1: A Multilingual Treebank Collection",
"authors": [
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
},
{
"first": "Marie-Catherine",
"middle": [],
"last": "De Marneffe",
"suffix": ""
},
{
"first": "Filip",
"middle": [],
"last": "Ginter",
"suffix": ""
},
{
"first": "Yoav",
"middle": [],
"last": "Goldberg",
"suffix": ""
},
{
"first": "Jan",
"middle": [],
"last": "Hajic",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
},
{
"first": "Ryan",
"middle": [],
"last": "Mcdonald",
"suffix": ""
},
{
"first": "Slav",
"middle": [],
"last": "Petrov",
"suffix": ""
},
{
"first": "Sampo",
"middle": [],
"last": "Pyysalo",
"suffix": ""
},
{
"first": "Natalia",
"middle": [],
"last": "Silveira",
"suffix": ""
},
{
"first": "Reut",
"middle": [],
"last": "Tsarfaty",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Zeman",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC 2016)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joakim Nivre, Marie-Catherine de Marneffe, Filip Gin- ter, Yoav Goldberg, Jan Hajic, Christopher D. Man- ning, Ryan McDonald, Slav Petrov, Sampo Pyysalo, Natalia Silveira, Reut Tsarfaty, and Daniel Zeman. 2016. Universal Dependencies v1: A Multilingual Treebank Collection. In Proceedings of the Tenth In- ternational Conference on Language Resources and Evaluation (LREC 2016), Paris, France. European Language Resources Association (ELRA).",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Integrating Graph-Based and Transition-Based Dependency Parsers",
"authors": [
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
},
{
"first": "Ryan",
"middle": [],
"last": "Mcdonald",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of ACL-08: HLT",
"volume": "",
"issue": "",
"pages": "950--958",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joakim Nivre and Ryan McDonald. 2008. Integrat- ing Graph-Based and Transition-Based Dependency Parsers. In Proceedings of ACL-08: HLT, pages 950-958, Columbus, Ohio. Association for Compu- tational Linguistics.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "A Crossing-Sensitive Third-Order Factorization for Dependency Parsing",
"authors": [
{
"first": "Emily",
"middle": [],
"last": "Pitler",
"suffix": ""
}
],
"year": 2014,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "2",
"issue": "",
"pages": "41--54",
"other_ids": {
"DOI": [
"10.1162/tacl_a_00164"
]
},
"num": null,
"urls": [],
"raw_text": "Emily Pitler. 2014. A Crossing-Sensitive Third-Order Factorization for Dependency Parsing. Transactions of the Association for Computational Linguistics, 2:41-54.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Why comparing single performance scores does not allow to draw conclusions about machine learning approaches",
"authors": [
{
"first": "Nils",
"middle": [],
"last": "Reimers",
"suffix": ""
},
{
"first": "Iryna",
"middle": [],
"last": "Gurevych",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1803.09578"
]
},
"num": null,
"urls": [],
"raw_text": "Nils Reimers and Iryna Gurevych. 2018. Why com- paring single performance scores does not allow to draw conclusions about machine learning ap- proaches. arXiv preprint arXiv:1803.09578.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Fast(er) Exact Decoding and Global Training for Transition-Based Dependency Parsing via a Minimal Feature Set",
"authors": [
{
"first": "Tianze",
"middle": [],
"last": "Shi",
"suffix": ""
},
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Lillian",
"middle": [],
"last": "Lee",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the 2017 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "12--23",
"other_ids": {
"DOI": [
"10.18653/v1/D17-1002"
]
},
"num": null,
"urls": [],
"raw_text": "Tianze Shi, Liang Huang, and Lillian Lee. 2017. Fast(er) Exact Decoding and Global Training for Transition-Based Dependency Parsing via a Mini- mal Feature Set. In Proceedings of the 2017 Con- ference on Empirical Methods in Natural Language Processing, pages 12-23. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Does String-Based Neural MT Learn Source Syntax?",
"authors": [
{
"first": "Xing",
"middle": [],
"last": "Shi",
"suffix": ""
},
{
"first": "Inkit",
"middle": [],
"last": "Padhi",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1526--1534",
"other_ids": {
"DOI": [
"10.18653/v1/D16-1159"
]
},
"num": null,
"urls": [],
"raw_text": "Xing Shi, Inkit Padhi, and Kevin Knight. 2016. Does String-Based Neural MT Learn Source Syntax? In Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, pages 1526-1534. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "An Investigation of the Interactions Between Pre-Trained Word Embeddings, Character Models and POS Tags in Dependency Parsing",
"authors": [
{
"first": "Aaron",
"middle": [],
"last": "Smith",
"suffix": ""
},
{
"first": "Sara",
"middle": [],
"last": "Miryam De Lhoneux",
"suffix": ""
},
{
"first": "Joakim",
"middle": [],
"last": "Stymne",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "2711--2720",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Aaron Smith, Miryam de Lhoneux, Sara Stymne, and Joakim Nivre. 2018. An Investigation of the In- teractions Between Pre-Trained Word Embeddings, Character Models and POS Tags in Dependency Parsing. In Proceedings of the 2018 Conference on Empirical Methods in Natural Language Pro- cessing, pages 2711-2720. Association for Compu- tational Linguistics.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Transition-based Parsing with Lighter Feed-Forward Networks",
"authors": [
{
"first": "David",
"middle": [],
"last": "Vilares",
"suffix": ""
},
{
"first": "Carlos",
"middle": [],
"last": "G\u00f3mez-Rodr\u00edguez",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the Second Workshop on Universal Dependencies (UDW 2018)",
"volume": "",
"issue": "",
"pages": "162--172",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Vilares and Carlos G\u00f3mez-Rodr\u00edguez. 2018. Transition-based Parsing with Lighter Feed-Forward Networks. In Proceedings of the Second Workshop on Universal Dependencies (UDW 2018), pages 162-172. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Graph-based Dependency Parsing with Bidirectional LSTM",
"authors": [
{
"first": "Wenhui",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Baobao",
"middle": [],
"last": "Chang",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 54th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "2306--2315",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wenhui Wang and Baobao Chang. 2016. Graph-based Dependency Parsing with Bidirectional LSTM. In Proceedings of the 54th Annual Meeting of the As- sociation for Computational Linguistics (Volume 1: Long Papers), pages 2306-2315, Berlin, Germany. Association for Computational Linguistics.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies",
"authors": [
{
"first": "Daniel",
"middle": [],
"last": "Zeman",
"suffix": ""
},
{
"first": "Jan",
"middle": [],
"last": "Haji\u010d",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Popel",
"suffix": ""
},
{
"first": "Martin",
"middle": [],
"last": "Potthast",
"suffix": ""
},
{
"first": "Milan",
"middle": [],
"last": "Straka",
"suffix": ""
},
{
"first": "Filip",
"middle": [],
"last": "Ginter",
"suffix": ""
},
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
},
{
"first": "Slav",
"middle": [],
"last": "Petrov",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the CoNLL 2018 Shared Task: Multilingual Parsing from Raw Text to Universal Dependencies",
"volume": "",
"issue": "",
"pages": "1--21",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Daniel Zeman, Jan Haji\u010d, Martin Popel, Martin Pot- thast, Milan Straka, Filip Ginter, Joakim Nivre, and Slav Petrov. 2018. CoNLL 2018 Shared Task: Mul- tilingual Parsing from Raw Text to Universal Depen- dencies. In Proceedings of the CoNLL 2018 Shared Task: Multilingual Parsing from Raw Text to Univer- sal Dependencies, pages 1-21, Brussels, Belgium. Association for Computational Linguistics.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "Transition-based Dependency Parsing with Rich Non-local Features",
"authors": [
{
"first": "Yue",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "188--193",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yue Zhang and Joakim Nivre. 2011. Transition-based Dependency Parsing with Rich Non-local Features. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies, pages 188-193. Associa- tion for Computational Linguistics.",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"title": "High-order Graph-based Neural Dependency Parsing",
"authors": [
{
"first": "Zhisong",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Hai",
"middle": [],
"last": "Zhao",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of the 29th Pacific Asia Conference on Language, Information and Computation",
"volume": "",
"issue": "",
"pages": "114--123",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zhisong Zhang and Hai Zhao. 2015. High-order Graph-based Neural Dependency Parsing. In Pro- ceedings of the 29th Pacific Asia Conference on Lan- guage, Information and Computation, pages 114- 123.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"text": "Schematic illustration of the K&G architecture of BiLSTM-based neural dependency parsers. Red arrows mark the basic feature sets and blue show how to extend them with features drawn from structural context.",
"num": null,
"type_str": "figure"
},
"FIGREF1": {
"uris": null,
"text": "Dependency recall relative to arc length on development sets. The corresponding plot for precision shows similar trends (seeFigure 7in Appendix A).",
"num": null,
"type_str": "figure"
},
"FIGREF3": {
"uris": null,
"text": "Parsing accuracy (average LAS over ten treebanks) with incremental extensions to the feature set.",
"num": null,
"type_str": "figure"
},
"FIGREF4": {
"uris": null,
"text": "The average impact of tokens on BiLSTM vectors trained with dependency parser with respect to the surface distance and the structural (gold-standard) relation between them.",
"num": null,
"type_str": "figure"
},
"FIGREF5": {
"uris": null,
"text": "Transition-based parser (TBMIN); positions depend on the configuration;",
"num": null,
"type_str": "figure"
},
"FIGREF6": {
"uris": null,
"text": "Graph-based parser (GBMIN); positions are: heads (h), dependents (d), children of d (c), siblings (s), grandparents (g), h,d \u00b1i tokens at distance \u00b1i from h or d which are none of h, d, c, s, or g.",
"num": null,
"type_str": "figure"
},
"FIGREF7": {
"uris": null,
"text": "Positions with the highest impact on the MLP scores (blue crosses) and their frequency (gray bars).",
"num": null,
"type_str": "figure"
},
"FIGREF8": {
"uris": null,
"text": "Transition-based parser (TBMIN)h d c d \u00b11 s h \u00b11 d \u00b12 g h \u00b12 dThe performance drops when tokens at particular positions are removed from the BiLSTM encoding. The red line marks average LAS of uninterrupted model. Feature sets of both models are highlighted in green.",
"num": null,
"type_str": "figure"
},
"TABREF0": {
"num": null,
"text": "Transition-based parser; scoring transitions for the configuration \u03a3, B, A = x1 . . . xi, xn, {xi \u2192 x2, xi \u2192 xj, . . .}",
"content": "<table><tr><td>[3] MLP</td><td/><td colspan=\"5\">scores: LAlbl RAlbl SHIFT</td><td/><td/><td/><td/><td>arc score</td><td/><td/><td/></tr><tr><td>[2] BiLSTM</td><td>x1</td><td>x2</td><td>...</td><td>xi</td><td>...</td><td>xj</td><td>xn</td><td>x1</td><td>x2</td><td>...</td><td>xi</td><td>...</td><td>xj</td><td>xn</td></tr><tr><td>[1] word repr.</td><td>x1</td><td>x2</td><td>...</td><td>xi</td><td>...</td><td>xj</td><td>xn</td><td>x1</td><td>x2</td><td>...</td><td>xi</td><td>...</td><td>xj</td><td>xn</td></tr><tr><td colspan=\"9\">s1 (a) head (h) s0L s0 s0R b0 structural context</td><td colspan=\"5\">sibling (s) dependent (d) (b) Graph-based parser;</td><td/></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td colspan=\"5\">scoring an arc x1 \u2192 xj</td><td/></tr></table>",
"type_str": "table",
"html": null
},
"TABREF1": {
"num": null,
"text": "in Appendix A. 81.85 \u2020 72.51 \u2020 71.92 \u2020 79.41 \u2020 64.39 74.35 \u2020 80.11 \u2020 73.28 \u2020",
"content": "<table><tr><td/><td>avg.</td><td>en-ptb</td><td>ar</td><td>en</td><td>fi</td><td>grc</td><td>he</td><td>ko</td><td>ru</td><td>sv</td><td>zh</td></tr><tr><td colspan=\"5\">TBMIN 76.22 TBEXT 76.43 90.25 75.56 90.25 75.77 80.50</td><td>71.47</td><td>70.32</td><td>78.62</td><td colspan=\"2\">63.88 73.82</td><td>78.80</td><td>72.17</td></tr><tr><td>GBMIN</td><td colspan=\"2\">77.74 91.40</td><td colspan=\"2\">77.25 82.53</td><td>74.37</td><td>73.48</td><td>80.83</td><td colspan=\"2\">65.47 76.43</td><td>81.22</td><td>74.47</td></tr><tr><td colspan=\"3\">GBSIBL 77.89 91.59</td><td colspan=\"2\">77.21 82.65</td><td>74.44</td><td>73.20</td><td>81.03</td><td colspan=\"3\">65.61 76.79 \u2020 81.42</td><td>74.95</td></tr></table>",
"type_str": "table",
"html": null
},
"TABREF2": {
"num": null,
"text": "Dependency recall is defined as the percentage of correct predictions among gold standard arcs of length l (McDonald and",
"content": "<table><tr><td>).</td></tr></table>",
"type_str": "table",
"html": null
}
}
}
} |