File size: 130,481 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 | {
"paper_id": "P16-1015",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:00:34.180465Z"
},
"title": "Generalized Transition-based Dependency Parsing via Control Parameters",
"authors": [
{
"first": "Bernd",
"middle": [],
"last": "Bohnet",
"suffix": "",
"affiliation": {},
"email": "bohnetbd@google.com"
},
{
"first": "Ryan",
"middle": [],
"last": "Mcdonald",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Emily",
"middle": [],
"last": "Pitler",
"suffix": "",
"affiliation": {},
"email": "epitler@google.com"
},
{
"first": "Ji",
"middle": [],
"last": "Ma",
"suffix": "",
"affiliation": {},
"email": "maji@google.com"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "In this paper, we present a generalized transition-based parsing framework where parsers are instantiated in terms of a set of control parameters that constrain transitions between parser states. This generalization provides a unified framework to describe and compare various transitionbased parsing approaches from both a theoretical and empirical perspective. This includes well-known transition systems, but also previously unstudied systems.",
"pdf_parse": {
"paper_id": "P16-1015",
"_pdf_hash": "",
"abstract": [
{
"text": "In this paper, we present a generalized transition-based parsing framework where parsers are instantiated in terms of a set of control parameters that constrain transitions between parser states. This generalization provides a unified framework to describe and compare various transitionbased parsing approaches from both a theoretical and empirical perspective. This includes well-known transition systems, but also previously unstudied systems.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Transition-based dependency parsing is perhaps the most successful parsing framework in use today (Nivre, 2008) . This is due to the fact that it can process sentences in linear time (Nivre, 2003) ; is highly accurate (Zhang and Nivre, 2011; Bohnet and Nivre, 2012; ; and has elegant mechanisms for parsing non-projective sentences (Nivre, 2009) . As a result, there have been numerous studies into different transition systems, each with varying properties and complexities (Nivre, 2003; Attardi, 2006; Nivre, 2008; Nivre, 2009; G\u00f3mez-Rodr\u00edguez and Nivre, 2010; Choi and Palmer, 2011; Pitler and McDonald, 2015) .",
"cite_spans": [
{
"start": 98,
"end": 111,
"text": "(Nivre, 2008)",
"ref_id": "BIBREF24"
},
{
"start": 183,
"end": 196,
"text": "(Nivre, 2003)",
"ref_id": "BIBREF23"
},
{
"start": 218,
"end": 241,
"text": "(Zhang and Nivre, 2011;",
"ref_id": "BIBREF34"
},
{
"start": 242,
"end": 265,
"text": "Bohnet and Nivre, 2012;",
"ref_id": "BIBREF5"
},
{
"start": 332,
"end": 345,
"text": "(Nivre, 2009)",
"ref_id": "BIBREF25"
},
{
"start": 475,
"end": 488,
"text": "(Nivre, 2003;",
"ref_id": "BIBREF23"
},
{
"start": 489,
"end": 503,
"text": "Attardi, 2006;",
"ref_id": "BIBREF2"
},
{
"start": 504,
"end": 516,
"text": "Nivre, 2008;",
"ref_id": "BIBREF24"
},
{
"start": 517,
"end": 529,
"text": "Nivre, 2009;",
"ref_id": "BIBREF25"
},
{
"start": 530,
"end": 562,
"text": "G\u00f3mez-Rodr\u00edguez and Nivre, 2010;",
"ref_id": "BIBREF13"
},
{
"start": 563,
"end": 585,
"text": "Choi and Palmer, 2011;",
"ref_id": "BIBREF7"
},
{
"start": 586,
"end": 612,
"text": "Pitler and McDonald, 2015)",
"ref_id": "BIBREF26"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "While connections between these transition systems have been noted, there has been little work on developing frameworks that generalize the phenomena parsed by these diverse systems. Such a framework would be beneficial for many reasons: It would provide a language from which we can theoretically compare known transition systems; it can give rise to new systems that could have favorable empirical properties; and an implementation of the generalization allows for comprehensive empirical studies.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this work we provide such a generalized transition-based parsing framework. Our framework can be cast as transition-based parsing as it contains both parser states as well as transitions between these states that construct dependency trees. As in traditional transition-based parsing, the state maintains two data structures: a set of unprocessed tokens (normally called the buffer); and a set of operative tokens (often called the stack).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Key to our generalization is the notion of active tokens, which is the set of tokens in which new arcs can be created and/or removed from consideration. A parser instantiation is defined by a set of control parameters, which dictate: the types of transitions that are permitted and their properties; the capacity of the active token set; and the maximum arc distance. We show that a number of different transition systems can be described via this framework. Critically the two most common systems are covered -arc-eager and arc-standard (Nivre, 2008) . But also Attardi's non-projective (Attardi, 2006 ), Kuhlmann's hybrid system (Kuhlmann et al., 2011) , the directed acyclic graph (DAG) parser of Sagae and Tsujii (2008) , and likely others. More interestingly, the easy-first framework of Goldberg and Elhadad (2010) can be described as an arc-standard system with an unbounded active token capacity.",
"cite_spans": [
{
"start": 538,
"end": 551,
"text": "(Nivre, 2008)",
"ref_id": "BIBREF24"
},
{
"start": 588,
"end": 602,
"text": "(Attardi, 2006",
"ref_id": "BIBREF2"
},
{
"start": 631,
"end": 654,
"text": "(Kuhlmann et al., 2011)",
"ref_id": "BIBREF19"
},
{
"start": 700,
"end": 723,
"text": "Sagae and Tsujii (2008)",
"ref_id": "BIBREF28"
},
{
"start": 793,
"end": 820,
"text": "Goldberg and Elhadad (2010)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We present a number of experiments with an implementation of our generalized framework. One major advantage of our generalization (and its implementation) is that it allows for easy exploration of novel systems not previously studied. In Section 5 we discuss some possibilities and provide experiments for these in Section 6.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Transition-based dependency parsing can be characterized as any parsing system that maintains a state as well as a finite set of operations that move the system from one state to another (Nivre, 2008) . In terms of modern statistical models that dominate the discourse today, the starting point is likely the work of Kudo and Matsumoto (2000) and Yamada and Matsumoto (2003) , who adopted the idea of cascaded chunking from Abney (1991) in a greedy dependency parsing framework.",
"cite_spans": [
{
"start": 187,
"end": 200,
"text": "(Nivre, 2008)",
"ref_id": "BIBREF24"
},
{
"start": 317,
"end": 342,
"text": "Kudo and Matsumoto (2000)",
"ref_id": "BIBREF18"
},
{
"start": 347,
"end": 374,
"text": "Yamada and Matsumoto (2003)",
"ref_id": "BIBREF31"
},
{
"start": 424,
"end": 436,
"text": "Abney (1991)",
"ref_id": "BIBREF0"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "From this early work, transition-based parsing quickly grew in scope with the formalization of the arc-eager versus arc-standard paradigms (Nivre, 2003; Nivre, 2008) , the latter largely being based on well-known shift-reduce principles in the phrase-structure literature (Ratnaparkhi, 1999) . The speed and empirical accuracy of these systems -as evident in the widely used MaltParser software (Nivre et al., 2006a ) -led to the study of a number of different transition systems.",
"cite_spans": [
{
"start": 139,
"end": 152,
"text": "(Nivre, 2003;",
"ref_id": "BIBREF23"
},
{
"start": 153,
"end": 165,
"text": "Nivre, 2008)",
"ref_id": "BIBREF24"
},
{
"start": 272,
"end": 291,
"text": "(Ratnaparkhi, 1999)",
"ref_id": "BIBREF27"
},
{
"start": 395,
"end": 415,
"text": "(Nivre et al., 2006a",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "Many of these new transition systems attempted to handle phenomena not covered by arc-eager or arc-standard transition systems, which inherently could only produce projective dependency trees. The work of Attardi (2006) , Nivre (2009) , G\u00f3mez-Rodr\u00edguez and Nivre (2010) , Choi and Palmer (2011) , and Pitler and McDonald (2015) derived transition systems that could parse nonprojective trees. Each of these systems traded-off complexity for empirical coverage. Additionally, Sagae and Tsujii (2008) developed transition systems that could parse DAGs by augmentating the arc-standard and the arc-eager system. Bohnet and Nivre (2012) derived a system that could produce both labeled dependency trees as well as part-ofspeech tags in a joint transition system. Taking this idea further Hatori et al. (2012) defined a transition system that performed joint segmentation, tagging and parsing.",
"cite_spans": [
{
"start": 205,
"end": 219,
"text": "Attardi (2006)",
"ref_id": "BIBREF2"
},
{
"start": 222,
"end": 234,
"text": "Nivre (2009)",
"ref_id": "BIBREF25"
},
{
"start": 237,
"end": 269,
"text": "G\u00f3mez-Rodr\u00edguez and Nivre (2010)",
"ref_id": "BIBREF13"
},
{
"start": 272,
"end": 294,
"text": "Choi and Palmer (2011)",
"ref_id": "BIBREF7"
},
{
"start": 301,
"end": 327,
"text": "Pitler and McDonald (2015)",
"ref_id": "BIBREF26"
},
{
"start": 475,
"end": 498,
"text": "Sagae and Tsujii (2008)",
"ref_id": "BIBREF28"
},
{
"start": 784,
"end": 804,
"text": "Hatori et al. (2012)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "In terms of empirical accuracy, from the early success of Nivre and colleagues (Nivre et al., 2006b; Hall et al., 2007; Nivre, 2008) , there has been an succession of improvements in training and decoding, including structured training with beam search (Zhang and Clark, 2008; Zhang and Nivre, 2011) , incorporating graph-based rescoring features (Bohnet and Kuhn, 2012) , the aformentioned work on joint parsing and tagging (Bohnet and Nivre, 2012) , and more recently the adoption of neural networks and feature embeddings (Chen and Manning, 2014; Dyer et al., 2015; .",
"cite_spans": [
{
"start": 79,
"end": 100,
"text": "(Nivre et al., 2006b;",
"ref_id": "BIBREF22"
},
{
"start": 101,
"end": 119,
"text": "Hall et al., 2007;",
"ref_id": "BIBREF15"
},
{
"start": 120,
"end": 132,
"text": "Nivre, 2008)",
"ref_id": "BIBREF24"
},
{
"start": 253,
"end": 276,
"text": "(Zhang and Clark, 2008;",
"ref_id": "BIBREF32"
},
{
"start": 277,
"end": 299,
"text": "Zhang and Nivre, 2011)",
"ref_id": "BIBREF34"
},
{
"start": 347,
"end": 370,
"text": "(Bohnet and Kuhn, 2012)",
"ref_id": "BIBREF4"
},
{
"start": 425,
"end": 449,
"text": "(Bohnet and Nivre, 2012)",
"ref_id": "BIBREF5"
},
{
"start": 525,
"end": 549,
"text": "(Chen and Manning, 2014;",
"ref_id": "BIBREF6"
},
{
"start": 550,
"end": 568,
"text": "Dyer et al., 2015;",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "In terms of abstract generalizations of transi-tion systems, the most relevant work is that of G\u00f3mez-Rodr\u00edguez and Nivre (2013) -which we abbreviate GR&N13. In that work, a generalized framework is defined by first defining a set of base transitions, and then showing that many transitionbased systems can be constructed via composition of these base transitions. Like our framework, this covers common systems such as arc-eager and arcstandard, as well as easy-first parsing. In particular, arc construction in easy-first parsing can be seen as an action composed of a number of shifts, an arc action, and a number of un-shift actions. The primary conceptual difference between that work and the present study is the distinction between complex actions versus control parameters. In terms of theoretical coverage, the frameworks are not equivalent. For instance, our generalization covers the system of Attardi (2006) , whereas GR&N13 cover transition systems where multiple arcs can be created in tandem. In Section 7 we compare the two generalizations.",
"cite_spans": [
{
"start": 904,
"end": 918,
"text": "Attardi (2006)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "A transition system must define a parser state as well as a set of transitions that move the system from one state to the next. Correct sequences of transitions create valid parse trees. A parser state is typically a tuple of data structures and variables that represent the dependency tree constructed thus far and, implicitly, possible valid transitions to the next state.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generalized Transition-based Parsing",
"sec_num": "3"
},
{
"text": "In order to generalize across the parser states of transition-based parsing systems, we preserve their common parts and make the specific parts configurable. In order to generalize across the transitions, we divide the transitions into their basic operations. Each specific transition is then defined by composition of these basic operations. By defining the properties of the data structures and the composition of the basic operations, different transition systems can be defined and configured within one single unified system. As a consequence, we obtain a generalized parser that is capable of executing a wide range of different transition systems by setting a number of control parameters without changing the specific implementation of the generalized parser.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generalized Transition-based Parsing",
"sec_num": "3"
},
{
"text": "In the following, we use a directed unlabeled dependency tree T = V, A for a sentence x = This is an example with two arcs (a) Arc-standard: is and example are eligible for arcs. This is an example with two arcs (b) Arc-eager: example and with are eligible for arcs. This is an example with two arcs (c) Easy-first: All unreduced tokens are active (bolded). Figure 1 : A partially processed dependency tree after having just added the arc (example, an) in the arc-standard, arc-eager, and easy-first systems. Tokens in the operative token set O are shaded orange, while tokens in the unordered buffer U are in an unshaded box. The bolded tokens are in ACTIVE(O) and eligible for arcs (Section 3.4).",
"cite_spans": [],
"ref_spans": [
{
"start": 358,
"end": 366,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Basic Notation",
"sec_num": "3.1"
},
{
"text": "w 1 , ..., w n , where V x = {1, ..., n} and V r x = V x \u222a {r}, A x \u2282 V r x \u00d7 V x .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Notation",
"sec_num": "3.1"
},
{
"text": "r is a placeholder for the root node and set either to 0 (root to the left of the sentence) or n + 1 (root to the right). The definition is mostly equivalent to that of K\u00fcbler et al. (2009) but deviates in the potential handling of the root on the right (Ballesteros and Nivre, 2013) .",
"cite_spans": [
{
"start": 169,
"end": 189,
"text": "K\u00fcbler et al. (2009)",
"ref_id": "BIBREF17"
},
{
"start": 254,
"end": 283,
"text": "(Ballesteros and Nivre, 2013)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Notation",
"sec_num": "3.1"
},
{
"text": "The set of nodes V x index the words of a sentence x and V r",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Notation",
"sec_num": "3.1"
},
{
"text": "x includes in addition the artificial root node r. Let A be the arc set, i.e., (i, j) \u2208 A iff there is a dependency from i to j. We use as alternative notation (i \u2192 j). This is the arc set the algorithm will create.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Notation",
"sec_num": "3.1"
},
{
"text": "For ease of exposition, we will only address unlabeled parsing. However, for our experiments we do implement a labeled parsing variant using the standard convention of composing arc transitions with corresponding arc labels.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Notation",
"sec_num": "3.1"
},
{
"text": "Let U be an unordered set of buffered unprocessed tokens. This set is identical to the buffer from transition-based parsing. Following standard notation, we will use i|U to indicate that i is the leftmost element of the set.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generalized Parser State",
"sec_num": "3.2"
},
{
"text": "Let O be an ordered set of operative tokens. Specifically, O is the set of tokens that 1) have been moved out of U , and 2) are not themselves reduced. The set O is similar in nature to the traditional stack of transition-based parsing, but is not restricted to stack operations. As in transition-Transitions \"Adds an arc from j to i, both \u2208 ACTIVE(O).\"",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generalized Parser State",
"sec_num": "3.2"
},
{
"text": "\u2190 i,j (O, U, A) \u21d2 (O, U, A \u222a (j \u2192 i)) \"Adds an arc from i to j, both \u2208 ACTIVE(O).\" \u2192 i,j (O, U, A) \u21d2 (O, U, A \u222a (i \u2192 j)) \"Removes token i \u2208 ACTIVE(O) from O.\" \u2212 i (O...i..., U, A) \u21d2 (O, U, A)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generalized Parser State",
"sec_num": "3.2"
},
{
"text": "\"Moves the top token from U to the top of O.\"",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generalized Parser State",
"sec_num": "3.2"
},
{
"text": "+ (O, i|U, A) \u21d2 (O|i, U, A)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generalized Parser State",
"sec_num": "3.2"
},
{
"text": "Figure 2: Base generalized transitions over parser states.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generalized Parser State",
"sec_num": "3.2"
},
{
"text": "based parsing we will use the notation O|i to indicate that i is the rightmost element of the set; O[n] is the n-th rightmost element of the set. Figure 1 shows the set of tokens in O within shaded boxes and U within unshaded boxes.",
"cite_spans": [],
"ref_spans": [
{
"start": 146,
"end": 154,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Generalized Parser State",
"sec_num": "3.2"
},
{
"text": "The above discussion describes what a generalized transition-based parser state looks like; it does not describe any transitions between these states, which is the core of transition-based parsing. In this section we present a set of basic transitions, which themselves can be composed to make more complex transitions (similar to G\u00f3mez-Rodr\u00edguez and Nivre (2013)). Let T = {\u2190 i,j , \u2192 i,j , \u2212 i , +} be the set of basic transitions (Figure 2 ), which have analogues to standard transition-based parsing. These transitions come with the standard preconditions, i.e., a root cannot be a modifier; each token can modify at most one word 1 ; a token can only be reduced if it has a head; and a shift can only happen if the unoperative buffer is non-empty. We will often refer to these as LEFT-ARC (\u2190 i,j ), RIGHT-ARC (\u2192 i,j ), REDUCE (\u2212 i ), and SHIFT (+). We additionally refer to LEFT-ARC and RIGHT-ARC together as arccreation actions.",
"cite_spans": [],
"ref_spans": [
{
"start": 432,
"end": 441,
"text": "(Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Generalized Transitions",
"sec_num": "3.3"
},
{
"text": "Instantiations of a transition system are defined via control parameters. We defined two sets of such parameters. The first, we call global parameters, dictates system wide behaviour. The second, we call transition parameters, dictates a specific behaviour for each transition.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Control Parameters",
"sec_num": "3.4"
},
{
"text": "We have two parameters for the broader behaviour of the system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Global Control Parameters",
"sec_num": null
},
{
"text": "The active set of tokens ACTIVE(O) that can be operated on by the transitions is the set {O[min(|O|, K)], ..., O[1]}. K additionally determines the size of O at the start of parsing. E.g., if K = 2, then we populate O with the first two tokens. This is equivalent to making SHIFT deterministic while |O| < K. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Active token capacity K.",
"sec_num": "1."
},
{
"text": "Let M(T ) be a multiset of transitions, such that if t \u2208 M(T ), then t \u2208 T . Note that M(T ) is a multiset, and thus can have multiple transitions of the same type. For each t \u2208 M(T ), our generalization requires the following control parameters to be set (default in bold):",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Transition Control Paramters",
"sec_num": null
},
{
"text": "1. Bottom-up: B \u2208 {[t]rue, [f ]alse}.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Transition Control Paramters",
"sec_num": null
},
{
"text": "Whether creating an arc also reduces it. Specifically we will have two parameters, B L and B R , which specify whether LEFT/RIGHT-ARC actions are bottom up. We use the notation and say B = true to mean B L = B R = true. For example B L = true indicates that \u2190 i,j is immediately followed by a reduce \u2212 i .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Transition Control Paramters",
"sec_num": null
},
{
"text": "2. Arc-Shift:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Transition Control Paramters",
"sec_num": null
},
{
"text": "S \u2208 {[t]rue, [f ]alse}.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Transition Control Paramters",
"sec_num": null
},
{
"text": "Whether creating an arc also results in SHIFT. Specifically we will have two parameters, S L and S R , which specify whether LEFT/RIGHT-ARC actions are joined with a SHIFT. We use the notation and say S = true to mean S L = S R = true. For example S L = true indicates that \u2190 i,j is immediately followed by +.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Transition Control Paramters",
"sec_num": null
},
{
"text": "P \u2208 {[l]ef t, [r]ight, na}.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Periphery:",
"sec_num": "3."
},
{
"text": "If a transition must operate on the left or right periphery of the active token set ACTIVE(O). For arc-creation transitions, this means that at least one of the head or modifier is on the specified periphery. If the value is na, that means that the action is not constrained to be on the periphery. Note, that when K \u2264 2, all arc-creation actions by default are on the periphery.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Periphery:",
"sec_num": "3."
},
{
"text": "Each of these control parameters has a default value, which will be assumed if unspecified. Note that the relevance of these parameters is transition dependent. E.g., a SHIFT requires no such control parameters and a REDUCE needs neither B nor S.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Periphery:",
"sec_num": "3."
},
{
"text": "These control parameters allow limited compositionality of the basic transitions in Figure 2 . Unlike G\u00f3mez-Rodr\u00edguez and Nivre (2013) , each transition includes at most one SHIFT, at most one REDUCE, and at most one LEFT-ARC or RIGHT-ARC. I.e., the most compositional transition is a LEFT/RIGHT-ARC with a REDUCE and/or a SHIFT. Even with this restriction, all of the transition systems covered by G\u00f3mez-Rodr\u00edguez and Nivre (2013) can still be expressed in our generalization.",
"cite_spans": [
{
"start": 102,
"end": 134,
"text": "G\u00f3mez-Rodr\u00edguez and Nivre (2013)",
"ref_id": "BIBREF14"
},
{
"start": 399,
"end": 431,
"text": "G\u00f3mez-Rodr\u00edguez and Nivre (2013)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [
{
"start": 84,
"end": 92,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Periphery:",
"sec_num": "3."
},
{
"text": "To summarize, a generalized transition is defined as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generalized Transition System",
"sec_num": "3.5"
},
{
"text": "1. A parser state: \u0393 = O, U, A .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Generalized Transition System",
"sec_num": "3.5"
},
{
"text": "T = {\u2190 i,j , \u2192 i,j , \u2212 i , +}.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A set of basic transitions:",
"sec_num": "2."
},
{
"text": "And each transition system instantiation must further define:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A set of basic transitions:",
"sec_num": "2."
},
{
"text": "1. Values for global control parameters: K and D.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A set of basic transitions:",
"sec_num": "2."
},
{
"text": "2. A multiset of valid transitions M(T ), where \u2200t \u2208 M(T ), then t \u2208 T .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A set of basic transitions:",
"sec_num": "2."
},
{
"text": "3. For each t \u2208 M(T ) values for B, S, and P .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A set of basic transitions:",
"sec_num": "2."
},
{
"text": "The instantiation of the transition system consists of setting the capacity K and distance D as well as the transition control parameters. In order to make the comparison clearer, we will define typical transition systems using the notation of Kuhlmann et al. (2011) . Here, a parser state is a triple (\u03c3, \u03b2, A) , where \u03c3|i is a stack with top element i, j|\u03b2 is a buffer whose next element is j, and A the set of created arcs. To make notation cleaner, we will drop indexes whenever the context makes it clear. E.g., if the active token capacity is 2 (K = 2), then necessarily for \u2190 i,j , i = 2 and j = 1 and we can write \u2190. When K > 2 or D > 1, a base arc-creation action can be instantiated into multiple transitions that only differ by the indexes. E.g., when K = 3 and D = 2, \u2190 with P = na can have three instantiations: \u2190 3,2 , \u2190 2,1 and \u2190 3,1 . To keep exposition compact, in such circumstances we use to denote the set of indexpairs allowed by the given K, D and P values.",
"cite_spans": [
{
"start": 244,
"end": 266,
"text": "Kuhlmann et al. (2011)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [
{
"start": 302,
"end": 311,
"text": "(\u03c3, \u03b2, A)",
"ref_id": null
}
],
"eq_spans": [],
"section": "Transition System Instantiations",
"sec_num": "4"
},
{
"text": "Arc-standard parsing is a form of shift-reduce parsing where arc-creations actions happen between the top two elements on the stack:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Arc-standard",
"sec_num": "4.1"
},
{
"text": "LEFT-ARC:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Arc-standard",
"sec_num": "4.1"
},
{
"text": "(\u03c3|i|j, \u03b2, A) \u21d2 (\u03c3|j, \u03b2, A \u222a (j \u2192 i)) RIGHT-ARC: (\u03c3|i|j, \u03b2, A) \u21d2 (\u03c3|i, \u03b2, A \u222a (i \u2192 j))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Arc-standard",
"sec_num": "4.1"
},
{
"text": "SHIFT:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Arc-standard",
"sec_num": "4.1"
},
{
"text": "(\u03c3, i|\u03b2, A) \u21d2 (\u03c3|i, \u03b2, A) This is easily handled in our generalization by having only two active tokens. \u2190 and \u2192 actions with default parameter values are used to simulate LEFT-ARC and RIGHT-ARC respectively, and + is used to shift tokens from U to O.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Arc-standard",
"sec_num": "4.1"
},
{
"text": "base parameter values",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "LEFT-ARC \u2190 {default} RIGHT-ARC \u2192 {default} SHIFT + capacity K 2 arc distance D 1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "Note that when K = 2, arc-creations are by definition always on the periphery.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "Arc-eager transition systems have been described in various ways. Kuhlmann et al. (2011) defines it as operations between tokens at the top of the stack and front of the buffer.",
"cite_spans": [
{
"start": 66,
"end": 88,
"text": "Kuhlmann et al. (2011)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Arc-eager",
"sec_num": "4.2"
},
{
"text": "LEFT-ARC:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Arc-eager",
"sec_num": "4.2"
},
{
"text": "(\u03c3|i, j|\u03b2, A) \u21d2 (\u03c3, j|\u03b2, A \u222a (j \u2192 i)) RIGHT-ARC: (\u03c3|i, j|\u03b2, A) \u21d2 (\u03c3|i|j, \u03b2, A \u222a (i \u2192 j)) REDUCE: (\u03c3|i, \u03b2, A) \u21d2 (\u03c3, \u03b2, A) SHIFT: (\u03c3, i|\u03b2, A) \u21d2 (\u03c3|i, \u03b2, A)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Arc-eager",
"sec_num": "4.2"
},
{
"text": "In our generalization, we can simulate this by having two active tokens on the operative set, representing the top of the stack and front of the buffer. SHIFT and LEFT-ARC are handled in the same way as in the arc-standard system. The RIGHT-ARC action is simulated by \u2192 with modified parameters to account for the fact that the action keeps the modifier in O and also shifts a token from U to O. The REDUCE action is handled by \u2212 with the periphery set to left so as to remove the second rightmost token from O.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Arc-eager",
"sec_num": "4.2"
},
{
"text": "base parameter values",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "LEFT-ARC \u2190 {default} RIGHT-ARC \u2192 {B = f, S = t} REDUCE \u2212 {P = l} SHIFT + K 2 D 1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "Note that the artificial root must be on the right of the sentence to permit the reduce to operate at the left periphery of the active token set.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "For easy-first parsing (Goldberg and Elhadad, 2010) , the number of active tokens is infinite or, more precisely, equals to the number of tokens in the input sentence, and arc-creation actions can happen between any two adjacent tokens.",
"cite_spans": [
{
"start": 23,
"end": 51,
"text": "(Goldberg and Elhadad, 2010)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Easy-first",
"sec_num": "4.3"
},
{
"text": "M(T ) base parameter values LEFT-ARC \u2190 {default} RIGHT-ARC \u2192 {default} K \u221e D 1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Easy-first",
"sec_num": "4.3"
},
{
"text": "Note here denotes the set of indexes {(i, j)|i \u2264 |O|, j \u2265 1, i = j + 1}. Thus, at each time step there are 2 * |O| actions that need to be considered. Additionally, reduce is always composed with arccreation and since K = \u221e, then there is never a SHIFT operation as O is immediately populated with all tokens on the start of parsing.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Easy-first",
"sec_num": "4.3"
},
{
"text": "Kuhlmann et al. present a 'hybrid' transition system where the RIGHT-ARC action is arc-standard in nature, but LEFT-ARC actions is arc-eager in nature, which is equivalent to the system of Yamada and Matsumoto (2003) . We can get the same effect as their system by allowing three active tokens, representing the top two tokens of the stack and the front of the buffer. Transitions can be handled similarly as the arc-standard system where only the periphery parameter need to be changed accordingly. This change also requires the root to be on the right of the sentence.",
"cite_spans": [
{
"start": 189,
"end": 216,
"text": "Yamada and Matsumoto (2003)",
"ref_id": "BIBREF31"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Kuhlmann et al. (2011)",
"sec_num": "4.4"
},
{
"text": "LEFT-ARC Sagae and Tsujii (2008) Sagae and Tsuji present a model for projective DAG parsing by modifying the LEFT-ARC and RIGHT-ARC transitions of the arc-eager system.",
"cite_spans": [
{
"start": 9,
"end": 32,
"text": "Sagae and Tsujii (2008)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "M(T ) base parameter values",
"sec_num": null
},
{
"text": "\u2190 {P = r} RIGHT-ARC \u2192 {P = l} SHIFT + K 3 D 1 4.5",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T ) base parameter values",
"sec_num": null
},
{
"text": "In their system, the LEFT-ARC transition does not remove the dependent, and RIGHT-ARC transition does not shift any token from the input to the stack.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T ) base parameter values",
"sec_num": null
},
{
"text": "LEFT-ARC:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T ) base parameter values",
"sec_num": null
},
{
"text": "(\u03c3|i, j|\u03b2, A) \u21d2 (\u03c3|i, j|\u03b2, A \u222a (j \u2192 i)) RIGHT-ARC: (\u03c3|i, j|\u03b2, A) \u21d2 (\u03c3|i, j|\u03b2, A \u222a (i \u2192 j)) REDUCE: (\u03c3|i, \u03b2, A) \u21d2 (\u03c3, \u03b2, A)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T ) base parameter values",
"sec_num": null
},
{
"text": "SHIFT:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T ) base parameter values",
"sec_num": null
},
{
"text": "(\u03c3, i|\u03b2, A) \u21d2 (\u03c3|i, \u03b2, A) This can be easily simulated by modifying arceager system mentioned in Sec. 4.2 such that both the LEFT-ARC and RIGHT-ARC transition keep the stack/buffer untouched.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T ) base parameter values",
"sec_num": null
},
{
"text": "base parameter values",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "LEFT-ARC",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "\u2190 {B = f } RIGHT-ARC \u2192 {B = f } REDUCE \u2212 {P = l} SHIFT + K 2 D 1 4.6 Attardi (2006)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "Now we show how our framework can extend to non-projective systems. This is primarily controlled by the arc-distance parameter D.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "The base of the Attardi non-projective transition system is the arc-standard system. Attardi modifies RIGHT/LEFT-ARC actions that operate over larger contexts in the stack. For simplicity of exposition below we model the variant of the Attardi system described in Cohen et al. (2011) .",
"cite_spans": [
{
"start": 264,
"end": 283,
"text": "Cohen et al. (2011)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "RIGHT-ARCN:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "(\u03c3|i 1+N | . . . |i 2 |i 1 , \u03b2, A) \u21d2 (\u03c3|i N | . . . |i 2 |i 1 , \u03b2, A \u222a (i 1 \u2192 i 1+N ))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "LEFT-ARCN:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "(\u03c3|i 1+N | . . . |i 2 |i 1 , \u03b2, A) \u21d2 (\u03c3|i 1+N | . . . |i 2 , \u03b2, A \u222a (i 1+N \u2192 i 1 )) SHIFT: (\u03c3, i|\u03b2, A) \u21d2 (\u03c3|i, \u03b2, A)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "Conceptually the Attardi system can be generalized to any value of N 2 , and Attardi specifically allows N=1,2,3. Actions that create arcs between non-adjacent tokens permit limited nonprojectivity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "Thus, for Attardi, we set the number of active tokens to N +1, to simulate the top N +1 tokens of the stack, and set the max distance D to N to 2 Attardi (2006) also introduces Extract/Insert actions to a temporary buffer that he argues generalizes to all values of N. We don't account for that specific generalization here.",
"cite_spans": [
{
"start": 146,
"end": 160,
"text": "Attardi (2006)",
"ref_id": "BIBREF2"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "indicate that tokens up to N positions below the top of the stack can add arcs with the top of the stack.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "base parameter values LEFT-ARC",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "\u2190 {P = r} RIGHT-ARC \u2192 {P = r} K N + 1 D N (3 for Attardi (2006))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "The critical parameter for each arc action is that P = r. This means that the right peripheral active token always must participate in the action, as does the right-most token of the stack for the original Attardi. Here denotes {(i, j)|j = 1, i \u2212 j \u2264 D}.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "M(T )",
"sec_num": null
},
{
"text": "Any valid setting of the control parameters could theoretically define a new transition system, however not all such combinations will be empirically reasonable. We outline two potential novel transition systems suggested by our framework, which we will experiment with in Section 6. This is a key advantage of our framework (and implementation) -it provides an easy experimental solution to explore novel transition systems.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Novel Transition Systems",
"sec_num": "5"
},
{
"text": "Easy-first and arc-standard are similar since they are both bottom-up and both create arcs between adjacent nodes. The main difference lies in the capacity K, which is 2 for arc-standard and \u221e for easy-first. In addition, the shift action is needed by the arc-standard system. Each system has some advantages: arc-standard is faster, and somewhat easier to train, while easy-first can be more accurate (under identical learning settings). Seen this way, it is natural to ask: what happens if the active token range K is set to k, with 2 < k < \u221e?",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Bounded Capacity Easy-first",
"sec_num": "5.1"
},
{
"text": "We explore various values in the region between arc-standard and easy-first in Section 6.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Bounded Capacity Easy-first",
"sec_num": "5.1"
},
{
"text": "M(T ) base parameter values LEFT-ARC \u2190 {default} RIGHT-ARC \u2192 {default} SHIFT + K k D 1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Bounded Capacity Easy-first",
"sec_num": "5.1"
},
{
"text": "A simple observation is that by allowing D > 1 makes any transition system naturally non-projective.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Non-projective Easy-first",
"sec_num": "5.2"
},
{
"text": "One example would be a nonprojective variant of easy-first parsing:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Non-projective Easy-first",
"sec_num": "5.2"
},
{
"text": "M(T )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Non-projective Easy-first",
"sec_num": "5.2"
},
{
"text": "base parameter values",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Non-projective Easy-first",
"sec_num": "5.2"
},
{
"text": "LEFT-ARC \u2190 {def ault} RIGHT-ARC \u2192 {def ault} K \u221e D",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Non-projective Easy-first",
"sec_num": "5.2"
},
{
"text": "any value of N Here N denotes the maximum arc-creation distance.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Non-projective Easy-first",
"sec_num": "5.2"
},
{
"text": "We also note that one could potentially vary both K and D simultaneously, giving a nonprojective limited capacity easy-first system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Non-projective Easy-first",
"sec_num": "5.2"
},
{
"text": "Our implementation uses a linear model y i \u2208y w\u2022 f(x, y 1 , . . . , y i ) to assign a score to a sequence y = y 1 , y 2 , . . . y m of parser transitions, given sentence x. Model parameters are trained using the structured perceptron with \"early update\" (Collins and Roark, 2004) and features follow that of Zhang and Nivre (2011) .",
"cite_spans": [
{
"start": 254,
"end": 279,
"text": "(Collins and Roark, 2004)",
"ref_id": "BIBREF9"
},
{
"start": 308,
"end": 330,
"text": "Zhang and Nivre (2011)",
"ref_id": "BIBREF34"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Implementation and Experiments",
"sec_num": "6"
},
{
"text": "For the arc-standard and arc-eager transition systems, we use the static oracle to derive a single gold sequence for a given sentence and its gold tree. For systems where there is no such static oracle, for example the easy-first system, we use the method proposed by Ma et al. (2013) to select a gold sequence such that, for each update, the condition w \u2022 f(x,\u0177 k ) < w \u2022 f(x, y k ) always holds, which is required for perceptron convergence. Here\u0177 k denotes the length k prefix of a correct sequence and y k denotes the highest scoring sequence in the beam.",
"cite_spans": [
{
"start": 268,
"end": 284,
"text": "Ma et al. (2013)",
"ref_id": "BIBREF20"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Implementation and Experiments",
"sec_num": "6"
},
{
"text": "We carry out the experiments on the Wall Street Journal using the standard splits for the training set (section 2-21), development set (section 22) and test set (section 23). We converted the constituency trees to Stanford dependencies version 3.3.0 (de Marneffe et al., 2006) . We used a CRFbased Part-of-Speech tagger to generate 5-fold jack-knifed Part-of-Speech tag annotation of the training set and used predicted tags on the development and test set. The tagger reaches accuracy scores similar to the Stanford tagger (Toutanova et al., 2003) with 97.44% on the test set. The unlabeled and labeled accuracy scores exclude punctuation marks.",
"cite_spans": [
{
"start": 254,
"end": 276,
"text": "Marneffe et al., 2006)",
"ref_id": "BIBREF10"
},
{
"start": 524,
"end": 548,
"text": "(Toutanova et al., 2003)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Implementation and Experiments",
"sec_num": "6"
},
{
"text": "Obviously, there are many interesting instantiations for the generalized transition system. In particular, it would be interesting to investigate parsing performance of systems with different active token size and arc-distance. Before we investigate these system in the next subsections, we present the performance on standard systems.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Implementation and Experiments",
"sec_num": "6"
},
{
"text": "The results for arc-standard, arc-eager and easyfirst (bottom of Table 1) show how standard systems perform within our framework. Easy-first's labeled attachment score (LAS) is 0.46 higher than the LAS of arc-eager when using the same feature set. These results are competitive with the stateof-the-art linear parsers, but below recent work on neural network parsers. A future line of work is to adopt such training into our generalization. Table 1 shows that easy-first is more accurate than arc-standard. However, it is also more computationally expensive. By varying the number of active tokens, we can investigate whether there is a sweet spot in the accuracy vs. speed trade-off. Figure 3 shows labeled/unlabeled accuracy scores on the development set for active token sizes ranging from 2 to 32, all with beam size 1. Different from the original easy-first system where all tokens are initialized as active tokens, in the bounded capacity system, a token can be active only after it has been shifted from U to O. We observe that the accuracy score increases remarkably by over a point when active token capacity gets increased from 2 to 3, and peaks at a active token capacity of 4. Generally, more active tokens allows the parser to delay \"difficult\" decisions to later steps and choose the \"easy\" ones at early steps. Such behavior has the effect of limiting the extent of error propagation. The result also suggests that a modification as simple as adding one more active token to the arc-standard system can yield significant improvement.",
"cite_spans": [],
"ref_spans": [
{
"start": 65,
"end": 73,
"text": "Table 1)",
"ref_id": "TABREF1"
},
{
"start": 441,
"end": 448,
"text": "Table 1",
"ref_id": "TABREF1"
},
{
"start": 685,
"end": 693,
"text": "Figure 3",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Common Systems",
"sec_num": "6.1"
},
{
"text": "With a larger active token capacity, we see a slight drop of accuracy. This is likely related to the parser having to predict when to perform a shift transition. In comparison, the vanilla easyfirst parser does not need to model this.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Common Systems",
"sec_num": "6.1"
},
{
"text": "For the experiments with non-projective easy-first, we use the Dutch and Danish CoNLL 2006 corpora. To assess the performance, we applied the evaluation rules of the 2006 shared task. In order to make the non-projective systems perform well, we added to all feature templates the arc-distance D. In these experiments, we included in the training an artificial root node on the right since Dutch as well a few sentences of the Danish corpus have more than one root node.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Non-projective Easy-first",
"sec_num": "6.3"
},
{
"text": "In the experiments, we use the easy-first setting with infinite set of active tokens K and increase stepwise the arc-distance D. For training, we filter out the sentences which contain non-projective arcs not parseable with the selected setting. Table 2 provides an overview of the performance with increasing arc-distance. At the bottom of the table, we added accuracy scores for the bounded capacity non-projective easy-first parser since we think these settings provide attractive trade-offs between accuracy and complexity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Non-projective Easy-first",
"sec_num": "6.3"
},
{
"text": "The original easy-first performs O(n) feature extractions and has a runtime of O(n log(n)) assuming a heap is used to extract the argmax at each step and feature extraction is done over local contexts only (Goldberg and Elhadad, 2010 Table 2 : Experiments with non-projective easyfirst and bounded capacity easy-first with D the arc-distance, K the active token capacity (\u221e = all tokens of a sentence), UAS and LAS are the unlabeled and labeled accuracy scores, CUR is the recall of crossing edges and NPS shows the percentage of sentences covered in the training set where 100% means all non-projective (and projective) sentences in the training can be parsed and are included in training. O(n 2 ) feature extractions are required. Table 2 explored more practical settings: when K = \u221e, D \u2264 7, the number of feature extractions is back to O(n) with a runtime of O(n log(n)), matching the original easy-first complexity. When both K and D are small constants as in the lower portion of Table 2 , the runtime is O(n).",
"cite_spans": [
{
"start": 206,
"end": 233,
"text": "(Goldberg and Elhadad, 2010",
"ref_id": "BIBREF12"
}
],
"ref_spans": [
{
"start": 234,
"end": 241,
"text": "Table 2",
"ref_id": null
},
{
"start": 733,
"end": 740,
"text": "Table 2",
"ref_id": null
},
{
"start": 985,
"end": 992,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Non-projective Easy-first",
"sec_num": "6.3"
},
{
"text": "The work most similar to ours is that of G\u00f3mez-Rodr\u00edguez and Nivre (2013) (GR&N13). They define a divisible transition system with the principle to divide the transitions into elementary transitions and then to compose from these elementary transitions complex transitions. GR&N13 identified the following five elementary transitions:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison with GR&N13",
"sec_num": "7"
},
{
"text": "SHIFT: (\u03c3, i|\u03b2, A) \u21d2 (\u03c3|i, \u03b2, A) UNSHIFT: (\u03c3|i, \u03b2, A) \u21d2 (\u03c3, i|\u03b2, A) REDUCE: (\u03c3|i, \u03b2, A) \u21d2 (\u03c3, \u03b2, A) LEFT-ARC: (\u03c3|i, j|\u03b2, A) \u21d2 (\u03c3|i, j|\u03b2, A \u222a (j \u2192 i)) RIGHT-ARC: (\u03c3|i, j|\u03b2, A) \u21d2 (\u03c3|i, j|\u03b2, A \u222a (i \u2192 j))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison with GR&N13",
"sec_num": "7"
},
{
"text": "The notion of function composition is used to combine the elementary transitions to the complex ones. For instance, arc-standard would have three actions: SHIFT; RIGHT-ARC \u2295REDUCE; LEFT-ARC \u2295REDUCE.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison with GR&N13",
"sec_num": "7"
},
{
"text": "The first difference we can note is the GR&N13 cannot instantiate transition systems that produce non-projective trees. This is surely a superficial difference, as GR&N13 could easily add transitions with larger arc-distance or even SWAP actions (Nivre, 2009) .",
"cite_spans": [
{
"start": 246,
"end": 259,
"text": "(Nivre, 2009)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison with GR&N13",
"sec_num": "7"
},
{
"text": "However, a less superficial difference is that our generalization uses control parameters to construct instantiations of transition systems, instead of solely via transition composition like GR&N13. Through this, our generalization results in a minimal departure from 'standard' representations of these systems. While this may seem like a notational difference, this is particularly a benefit with respect to implementation, as previous techniques for classification and feature extraction can largely be reused.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison with GR&N13",
"sec_num": "7"
},
{
"text": "For example, in GR&N13, the definition of the easy-first transition system (Goldberg and Elhadad, 2010 ) is complex, e.g., a RIGHT-ARC at position i requires a compositional transition of i SHIFT actions, a RIGHT-ARC, a SHIFT, a REDUCE, then i UNSHIFT actions. Note, that this means in any implementation of this generalization, the output space for a classifier will be very large. Furthermore, the feature space would ultimately need to take the entire sentence into consideration, considering that all compositional actions are centered on the same state.",
"cite_spans": [
{
"start": 75,
"end": 102,
"text": "(Goldberg and Elhadad, 2010",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison with GR&N13",
"sec_num": "7"
},
{
"text": "In our transition system, on the other hand, easy-first operates almost as it does in its native form, where n LEFT-ARC and n RIGHT-ARC actions are ranked relative to each other. There are only two actions, each instantiated for every location in the state. Thus the output space and feature extraction are quite natural.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison with GR&N13",
"sec_num": "7"
},
{
"text": "This leads to straight-forward implementations allowing for easy experimentation and discovery. Unlike GR&N13, we present empirical results for both known transition systems as well as some novel systems (Section 6).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Comparison with GR&N13",
"sec_num": "7"
},
{
"text": "We presented a generalized transition system that is capable of representing and executing a wide range of transition systems within one single implementation. These transition systems include systems such as arc-standard, arc-eager, easy-first.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "8"
},
{
"text": "Transitions can be freely composed of elementary operations. The transition system shows perfect alignment between the elementary operations on one hand and their preconditions and the oracle on the other hand. We adjust the transition system to work on a stack in a uniform way starting at a node on the stack and ending with the top node of the stack. The results produced by this system are more comparable as they can be executed with the same classifier and feature extraction system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "8"
},
{
"text": "Finally, we would like to highlight two insights that the experiments provide. First, a few more active tokens than two can boost the accuracy level of an arc-standard transition system towards the level of an easy-first transition system. These parsing systems maintain very nicely the linear complexity of the arc-standard transition system while they provide a higher accuracy similar to those of easy-first. Second, non-projective trees can be parsed by allowing a larger arc-distance which is a simple way to allow for non-projective edges.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "8"
},
{
"text": "We think that the transition systems with more active tokens or the combination with edges that span over more words provide very attractive transition systems for possible future parsers.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "8"
},
{
"text": "This precondition is not needed for DAG transition systems.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We would like to thank the anonymous reviewers, Slav Petrov and Michael Collins for valuable comments on earlier versions of this manuscript.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgments",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Parsing by chunks",
"authors": [
{
"first": "Steven",
"middle": [],
"last": "Abney",
"suffix": ""
}
],
"year": 1991,
"venue": "Principle-Based Parsing",
"volume": "",
"issue": "",
"pages": "257--278",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Steven Abney. 1991. Parsing by chunks. In Robert Berwick, Steven Abney, and Carol Tenny, editors, Principle-Based Parsing, pages 257-278. Kluwer.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Improved transition-based parsing and tagging with neural networks",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Alberti",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Weiss",
"suffix": ""
},
{
"first": "Greg",
"middle": [],
"last": "Coppola",
"suffix": ""
},
{
"first": "Slav",
"middle": [],
"last": "Petrov",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chris Alberti, David Weiss, Greg Coppola, and Slav Petrov. 2015. Improved transition-based parsing and tagging with neural networks. In Proceedings of EMNLP 2015.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Experiments with a multilanguage non-projective dependency parser",
"authors": [
{
"first": "Giuseppe",
"middle": [],
"last": "Attardi",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 10th Conference on Computational Natural Language Learning (CoNLL)",
"volume": "",
"issue": "",
"pages": "166--170",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Giuseppe Attardi. 2006. Experiments with a multi- language non-projective dependency parser. In Pro- ceedings of the 10th Conference on Computational Natural Language Learning (CoNLL), pages 166- 170.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Going to the roots of dependency parsing",
"authors": [
{
"first": "Miguel",
"middle": [],
"last": "Ballesteros",
"suffix": ""
},
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2013,
"venue": "Computational Linguistics",
"volume": "39",
"issue": "1",
"pages": "5--13",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Miguel Ballesteros and Joakim Nivre. 2013. Going to the roots of dependency parsing. Computational Linguistics, 39(1):5-13.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "The best of both worlds -a graph-based completion model for transition-based parsers",
"authors": [
{
"first": "Bernd",
"middle": [],
"last": "Bohnet",
"suffix": ""
},
{
"first": "Jonas",
"middle": [],
"last": "Kuhn",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 13th Conference of the European Chpater of the Association for Computational Linguistics (EACL)",
"volume": "",
"issue": "",
"pages": "77--87",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bernd Bohnet and Jonas Kuhn. 2012. The best of both worlds -a graph-based completion model for transition-based parsers. In Proceedings of the 13th Conference of the European Chpater of the Associ- ation for Computational Linguistics (EACL), pages 77-87.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "A transitionbased system for joint part-of-speech tagging and labeled non-projective dependency parsing",
"authors": [
{
"first": "Bernd",
"middle": [],
"last": "Bohnet",
"suffix": ""
},
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Computational Natural Language Learning (EMNLP-CoNLL)",
"volume": "",
"issue": "",
"pages": "1455--1465",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bernd Bohnet and Joakim Nivre. 2012. A transition- based system for joint part-of-speech tagging and la- beled non-projective dependency parsing. In Pro- ceedings of the 2012 Joint Conference on Empirical Methods in Natural Language Processing and Com- putational Natural Language Learning (EMNLP- CoNLL), pages 1455-1465.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "A fast and accurate dependency parser using neural networks",
"authors": [
{
"first": "Danqi",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Christopher",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2014,
"venue": "Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Danqi Chen and Christopher D Manning. 2014. A fast and accurate dependency parser using neural net- works. In Empirical Methods in Natural Language Processing.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Getting the most out of transition-based dependency parsing",
"authors": [
{
"first": "D",
"middle": [],
"last": "Jinho",
"suffix": ""
},
{
"first": "Martha",
"middle": [],
"last": "Choi",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Palmer",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies",
"volume": "2",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jinho D Choi and Martha Palmer. 2011. Getting the most out of transition-based dependency parsing. In Proceedings of the 49th Annual Meeting of the Asso- ciation for Computational Linguistics: Human Lan- guage Technologies: short papers-Volume 2.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Exact inference for generative probabilistic non-projective dependency parsing",
"authors": [
{
"first": "Carlos",
"middle": [],
"last": "Shay B Cohen",
"suffix": ""
},
{
"first": "Giorgio",
"middle": [],
"last": "G\u00f3mez-Rodr\u00edguez",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Satta",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP)",
"volume": "",
"issue": "",
"pages": "1234--1245",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shay B Cohen, Carlos G\u00f3mez-Rodr\u00edguez, and Giorgio Satta. 2011. Exact inference for generative proba- bilistic non-projective dependency parsing. In Pro- ceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 1234-1245.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Incremental parsing with the perceptron algorithm",
"authors": [
{
"first": "Michael",
"middle": [],
"last": "Collins",
"suffix": ""
},
{
"first": "Brian",
"middle": [],
"last": "Roark",
"suffix": ""
}
],
"year": 2004,
"venue": "Proceedings of the 42nd Annual Meeting of the Association for Computational Linguistics (ACL)",
"volume": "",
"issue": "",
"pages": "112--119",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michael Collins and Brian Roark. 2004. Incremen- tal parsing with the perceptron algorithm. In Pro- ceedings of the 42nd Annual Meeting of the Asso- ciation for Computational Linguistics (ACL), pages 112-119.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Generating typed dependency parses from phrase structure parses",
"authors": [
{
"first": "Marie-Catherine",
"middle": [],
"last": "De Marneffe",
"suffix": ""
},
{
"first": "Bill",
"middle": [],
"last": "Maccartney",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 5th International Conference on Language Resources and Evaluation (LREC)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marie-Catherine de Marneffe, Bill MacCartney, and Christopher D. Manning. 2006. Generating typed dependency parses from phrase structure parses. In Proceedings of the 5th International Conference on Language Resources and Evaluation (LREC).",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Transitionbased dependency parsing with stack long shortterm 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 ACL 2015",
"volume": "",
"issue": "",
"pages": "334--343",
"other_ids": {},
"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 ACL 2015, pages 334-343. Association for Computational Linguis- tics.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "An efficient algorithm for easy-first non-directional dependency parsing",
"authors": [
{
"first": "Yoav",
"middle": [],
"last": "Goldberg",
"suffix": ""
},
{
"first": "Michael",
"middle": [
"Elhadad"
],
"last": "",
"suffix": ""
}
],
"year": 2010,
"venue": "Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL HLT)",
"volume": "",
"issue": "",
"pages": "742--750",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yoav Goldberg and Michael Elhadad. 2010. An effi- cient algorithm for easy-first non-directional depen- dency parsing. In Human Language Technologies: The 2010 Annual Conference of the North American Chapter of the Association for Computational Lin- guistics (NAACL HLT), pages 742-750.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "A transition-based parser for 2-planar dependency structures",
"authors": [
{
"first": "Carlos",
"middle": [],
"last": "G\u00f3mez",
"suffix": ""
},
{
"first": "-Rodr\u00edguez",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2010,
"venue": "Proceedings of the 48th Annual Meeting of the Association for Computational Linguistics (ACL)",
"volume": "",
"issue": "",
"pages": "1492--1501",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Carlos G\u00f3mez-Rodr\u00edguez and Joakim Nivre. 2010. A transition-based parser for 2-planar dependency structures. In Proceedings of the 48th Annual Meet- ing of the Association for Computational Linguistics (ACL), pages 1492-1501.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Divisible transition systems and multiplanar dependency parsing",
"authors": [
{
"first": "Carlos",
"middle": [],
"last": "G\u00f3mez",
"suffix": ""
},
{
"first": "-Rodr\u00edguez",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2013,
"venue": "Computational Linguistics",
"volume": "39",
"issue": "4",
"pages": "799--845",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Carlos G\u00f3mez-Rodr\u00edguez and Joakim Nivre. 2013. Divisible transition systems and multiplanar de- pendency parsing. Computational Linguistics, 39(4):799-845.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Single malt or blended? A study in multilingual parser optimization",
"authors": [
{
"first": "Johan",
"middle": [],
"last": "Hall",
"suffix": ""
},
{
"first": "Jens",
"middle": [],
"last": "Nilsson",
"suffix": ""
},
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
},
{
"first": "G\u00fclsen",
"middle": [],
"last": "Eryigit",
"suffix": ""
},
{
"first": "Be\u00e1ta",
"middle": [],
"last": "Megyesi",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the CoNLL Shared Task of EMNLP-CoNLL",
"volume": "",
"issue": "",
"pages": "933--939",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Johan Hall, Jens Nilsson, Joakim Nivre, G\u00fclsen Eryigit, Be\u00e1ta Megyesi, Mattias Nilsson, and Markus Saers. 2007. Single malt or blended? A study in multilingual parser optimization. In Pro- ceedings of the CoNLL Shared Task of EMNLP- CoNLL 2007, pages 933-939.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Incremental joint approach to word segmentation, pos tagging, and dependency parsing in chinese",
"authors": [
{
"first": "Jun",
"middle": [],
"last": "Hatori",
"suffix": ""
},
{
"first": "Takuya",
"middle": [],
"last": "Matsuzaki",
"suffix": ""
},
{
"first": "Yusuke",
"middle": [],
"last": "Miyao",
"suffix": ""
},
{
"first": "Jun'ichi",
"middle": [],
"last": "Tsujii",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics (ACL)",
"volume": "",
"issue": "",
"pages": "1045--1053",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jun Hatori, Takuya Matsuzaki, Yusuke Miyao, and Jun'ichi Tsujii. 2012. Incremental joint approach to word segmentation, pos tagging, and dependency parsing in chinese. In Proceedings of the 50th An- nual Meeting of the Association for Computational Linguistics (ACL), pages 1045-1053.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Dependency Parsing",
"authors": [
{
"first": "Sandra",
"middle": [],
"last": "K\u00fcbler",
"suffix": ""
},
{
"first": "Ryan",
"middle": [],
"last": "Mcdonald",
"suffix": ""
},
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2009,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sandra K\u00fcbler, Ryan McDonald, and Joakim Nivre. 2009. Dependency Parsing. Morgan and Claypool.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Japanese dependency structure analysis based on support vector machines",
"authors": [
{
"first": "Taku",
"middle": [],
"last": "Kudo",
"suffix": ""
},
{
"first": "Yuji",
"middle": [],
"last": "Matsumoto",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of the Joint SIGDAT Conference on Empirical Methods in NLP and Very Large Corpora",
"volume": "",
"issue": "",
"pages": "18--25",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Taku Kudo and Yuji Matsumoto. 2000. Japanese de- pendency structure analysis based on support vec- tor machines. In Proceedings of the Joint SIGDAT Conference on Empirical Methods in NLP and Very Large Corpora, pages 18-25.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Dynamic programming algorithms for transition-based dependency parsers",
"authors": [
{
"first": "Marco",
"middle": [],
"last": "Kuhlmann",
"suffix": ""
},
{
"first": "Carlos",
"middle": [],
"last": "G\u00f3mez-Rodr\u00edguez",
"suffix": ""
},
{
"first": "Giorgio",
"middle": [],
"last": "Satta",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics (ACL)",
"volume": "",
"issue": "",
"pages": "673--682",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marco Kuhlmann, Carlos G\u00f3mez-Rodr\u00edguez, and Gior- gio Satta. 2011. Dynamic programming algorithms for transition-based dependency parsers. In Pro- ceedings of the 49th Annual Meeting of the Asso- ciation for Computational Linguistics (ACL), pages 673-682.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Easy-first pos tagging and dependency parsing with beam search",
"authors": [
{
"first": "Ji",
"middle": [],
"last": "Ma",
"suffix": ""
},
{
"first": "Jingbo",
"middle": [],
"last": "Zhu",
"suffix": ""
},
{
"first": "Tong",
"middle": [],
"last": "Xiao",
"suffix": ""
},
{
"first": "Nan",
"middle": [],
"last": "Yang",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics",
"volume": "2",
"issue": "",
"pages": "110--114",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ji Ma, Jingbo Zhu, Tong Xiao, and Nan Yang. 2013. Easy-first pos tagging and dependency parsing with beam search. In Proceedings of the 51st Annual Meeting of the Association for Computational Lin- guistics (Volume 2: Short Papers), pages 110-114, Sofia, Bulgaria, August. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Maltparser: A data-driven parser-generator for dependency parsing",
"authors": [
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
},
{
"first": "Johan",
"middle": [],
"last": "Hall",
"suffix": ""
},
{
"first": "Jens",
"middle": [],
"last": "Nilsson",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 5th International Conference on Language Resources and Evaluation (LREC)",
"volume": "",
"issue": "",
"pages": "2216--2219",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joakim Nivre, Johan Hall, and Jens Nilsson. 2006a. Maltparser: A data-driven parser-generator for de- pendency parsing. In Proceedings of the 5th In- ternational Conference on Language Resources and Evaluation (LREC), pages 2216-2219.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Labeled pseudo-projective dependency parsing with support vector machines",
"authors": [
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
},
{
"first": "Johan",
"middle": [],
"last": "Hall",
"suffix": ""
},
{
"first": "Jens",
"middle": [],
"last": "Nilsson",
"suffix": ""
},
{
"first": "G\u00fclsen",
"middle": [],
"last": "Eryigit",
"suffix": ""
},
{
"first": "Svetoslav",
"middle": [],
"last": "Marinov",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 10th Conference on Computational Natural Language Learning (CoNLL)",
"volume": "",
"issue": "",
"pages": "221--225",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joakim Nivre, Johan Hall, Jens Nilsson, G\u00fclsen Eryigit, and Svetoslav Marinov. 2006b. Labeled pseudo-projective dependency parsing with support vector machines. In Proceedings of the 10th Confer- ence on Computational Natural Language Learning (CoNLL), pages 221-225.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "An efficient algorithm for projective dependency parsing",
"authors": [
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the 8th International Workshop on Parsing Technologies (IWPT)",
"volume": "",
"issue": "",
"pages": "149--160",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joakim Nivre. 2003. An efficient algorithm for pro- jective dependency parsing. In Proceedings of the 8th International Workshop on Parsing Technologies (IWPT), pages 149-160.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Algorithms for deterministic incremental dependency parsing",
"authors": [
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2008,
"venue": "Computational Linguistics",
"volume": "34",
"issue": "",
"pages": "513--553",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joakim Nivre. 2008. Algorithms for deterministic in- cremental dependency parsing. Computational Lin- guistics, 34:513-553.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"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 (ACL-IJCNLP)",
"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 (ACL- IJCNLP), pages 351-359.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "A lineartime transition system for crossing interval trees",
"authors": [
{
"first": "Emily",
"middle": [],
"last": "Pitler",
"suffix": ""
},
{
"first": "Ryan",
"middle": [],
"last": "Mcdonald",
"suffix": ""
}
],
"year": 2015,
"venue": "Human Language Technologies: The 2015 Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL HLT)",
"volume": "",
"issue": "",
"pages": "662--671",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Emily Pitler and Ryan McDonald. 2015. A linear- time transition system for crossing interval trees. In Human Language Technologies: The 2015 Annual Conference of the North American Chapter of the Association for Computational Linguistics (NAACL HLT), pages 662-671.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Learning to parse natural language with maximum entropy models",
"authors": [
{
"first": "Adwait",
"middle": [],
"last": "Ratnaparkhi",
"suffix": ""
}
],
"year": 1999,
"venue": "Machine Learning",
"volume": "34",
"issue": "",
"pages": "151--175",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Adwait Ratnaparkhi. 1999. Learning to parse natural language with maximum entropy models. Machine Learning, 34:151-175.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Shift-reduce dependency DAG parsing",
"authors": [
{
"first": "Kenji",
"middle": [],
"last": "Sagae",
"suffix": ""
},
{
"first": "Jun'ichi",
"middle": [],
"last": "Tsujii",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the 22nd International Conference on Computational Linguistics (COLING)",
"volume": "",
"issue": "",
"pages": "753--760",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kenji Sagae and Jun'ichi Tsujii. 2008. Shift-reduce dependency DAG parsing. In Proceedings of the 22nd International Conference on Computational Linguistics (COLING), pages 753-760.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Feature-rich part-ofspeech tagging with a cyclic dependency network",
"authors": [
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Klein",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
},
{
"first": "Yoram",
"middle": [],
"last": "Singer",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology",
"volume": "1",
"issue": "",
"pages": "173--180",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kristina Toutanova, Dan Klein, Christopher D. Man- ning, and Yoram Singer. 2003. Feature-rich part-of- speech tagging with a cyclic dependency network. In Proceedings of the 2003 Conference of the North American Chapter of the Association for Computa- tional Linguistics on Human Language Technology -Volume 1, NAACL '03, pages 173-180, Strouds- burg, PA, USA. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "Structured training for neural network transition-based parsing",
"authors": [
{
"first": "David",
"middle": [],
"last": "Weiss",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Alberti",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Collins",
"suffix": ""
},
{
"first": "Slav",
"middle": [],
"last": "Petrov",
"suffix": ""
}
],
"year": 2015,
"venue": "Proceedings of ACL 2015",
"volume": "",
"issue": "",
"pages": "323--333",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Weiss, Chris Alberti, Michael Collins, and Slav Petrov. 2015. Structured training for neural net- work transition-based parsing. In Proceedings of ACL 2015, pages 323-333.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Statistical dependency analysis with support vector machines",
"authors": [
{
"first": "Hiroyasu",
"middle": [],
"last": "Yamada",
"suffix": ""
},
{
"first": "Yuji",
"middle": [],
"last": "Matsumoto",
"suffix": ""
}
],
"year": 2003,
"venue": "Proceedings of the 8th International Workshop on Parsing Technologies (IWPT)",
"volume": "",
"issue": "",
"pages": "195--206",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hiroyasu Yamada and Yuji Matsumoto. 2003. Statis- tical dependency analysis with support vector ma- chines. In Proceedings of the 8th International Workshop on Parsing Technologies (IWPT), pages 195-206.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "A tale of two parsers: Investigating and combining graph-based and transition-based dependency parsing",
"authors": [
{
"first": "Yue",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Stephen",
"middle": [],
"last": "Clark",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP)",
"volume": "",
"issue": "",
"pages": "562--571",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yue Zhang and Stephen Clark. 2008. A tale of two parsers: Investigating and combining graph-based and transition-based dependency parsing. In Pro- ceedings of the Conference on Empirical Methods in Natural Language Processing (EMNLP), pages 562-571.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Enforcing structural diversity in cube-pruned dependency parsing",
"authors": [
{
"first": "Hao",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Ryan",
"middle": [],
"last": "Mcdonald",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "656--661",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hao Zhang and Ryan McDonald. 2014. Enforcing structural diversity in cube-pruned dependency pars- ing. In Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics (Vol- ume 2: Short Papers), pages 656-661, Baltimore, Maryland, June. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Transition-based 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 (ACL)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yue Zhang and Joakim Nivre. 2011. Transition-based parsing with rich non-local features. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics (ACL).",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"num": null,
"type_str": "figure",
"text": "2. Max arc distance D. I.e., arcs can only be created between two active tokens O[i] and O[j] if |i \u2212 j| \u2264 D."
},
"FIGREF1": {
"uris": null,
"num": null,
"type_str": "figure",
"text": "Labeled/unlabeled attachment scores with respect to the active capacity K."
},
"TABREF1": {
"content": "<table><tr><td>6.2 Bounded Capacity Easy-first</td></tr></table>",
"html": null,
"text": "State-of-the-art comparison. denotes our own re-implementation. The systems in the first block on the top use neural networks.",
"num": null,
"type_str": "table"
},
"TABREF2": {
"content": "<table><tr><td>Danish</td><td>Dutch</td></tr><tr><td>D K</td><td/></tr></table>",
"html": null,
"text": "). For the non-projective variant of easy-first with D = d, O(dn) feature extractions are required. Thus, for the unrestricted variant where K = D = \u221e, UAS LAS CUR NPS UAS LAS CUR NPS 1 \u221e 90.22 85.51 41.30 84.37 79.11 75.41 32.45 63.55 2 \u221e 90.28 85.85 59.78 96.91 84.73 81.01 70.59 92.44 3 \u221e 90.68 86.07 65.22 98.82 85.03 81.65 77.99 99.01 4 \u221e 90.58 85.53 69.57 99.69 85.99 82.73 76.85 99.89 5 \u221e 90.84 86.11 65.22 99.88 85.21 81.93 76.09 99.96 6 \u221e 90.78 86.31 68.48 99.94 84.57 81.13 75.90 100.0 7 \u221e 90.64 85.91 63.04 100.0 85.07 82.01 77.04 100.0 4 5 90.74 85.87 66.30 99.69 86.51 82.91 76.66 99.89 5 6 91.00 86.21 72.83 99.88 86.03 82.73 76.09 99.96",
"num": null,
"type_str": "table"
}
}
}
} |