File size: 113,549 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 | {
"paper_id": "P13-1001",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:33:13.474320Z"
},
"title": "A Shift-Reduce Parsing Algorithm for Phrase-based String-to-Dependency Translation",
"authors": [
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": "",
"affiliation": {
"laboratory": "State Key Laboratory of Intelligent Technology and Systems Tsinghua National Laboratory for Information Science and Technology",
"institution": "Tsinghua University",
"location": {
"postCode": "100084",
"settlement": "Beijing",
"country": "China"
}
},
"email": "liuyang2011@tsinghua.edu.cn"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We introduce a shift-reduce parsing algorithm for phrase-based string-todependency translation. As the algorithm generates dependency trees for partial translations left-to-right in decoding, it allows for efficient integration of both n-gram and dependency language models. To resolve conflicts in shift-reduce parsing, we propose a maximum entropy model trained on the derivation graph of training data. As our approach combines the merits of phrase-based and string-todependency models, it achieves significant improvements over the two baselines on the NIST Chinese-English datasets.",
"pdf_parse": {
"paper_id": "P13-1001",
"_pdf_hash": "",
"abstract": [
{
"text": "We introduce a shift-reduce parsing algorithm for phrase-based string-todependency translation. As the algorithm generates dependency trees for partial translations left-to-right in decoding, it allows for efficient integration of both n-gram and dependency language models. To resolve conflicts in shift-reduce parsing, we propose a maximum entropy model trained on the derivation graph of training data. As our approach combines the merits of phrase-based and string-todependency models, it achieves significant improvements over the two baselines on the NIST Chinese-English datasets.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Modern statistical machine translation approaches can be roughly divided into two broad categories: phrase-based and syntax-based. Phrase-based approaches treat phrase, which is usually a sequence of consecutive words, as the basic unit of translation (Koehn et al., 2003; Och and Ney, 2004) . As phrases are capable of memorizing local context, phrase-based approaches excel at handling local word selection and reordering. In addition, it is straightforward to integrate n-gram language models into phrase-based decoders in which translation always grows left-to-right. As a result, phrase-based decoders only need to maintain the boundary words on one end to calculate language model probabilities. However, as phrase-based decoding usually casts translation as a string concatenation problem and permits arbitrary permutation, it proves to be NP-complete (Knight, 1999) .",
"cite_spans": [
{
"start": 252,
"end": 272,
"text": "(Koehn et al., 2003;",
"ref_id": "BIBREF17"
},
{
"start": 273,
"end": 291,
"text": "Och and Ney, 2004)",
"ref_id": "BIBREF24"
},
{
"start": 859,
"end": 873,
"text": "(Knight, 1999)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Syntax-based approaches, on the other hand, model the hierarchical structure of natural languages (Wu, 1997; Yamada and Knight, 2001; Chiang, 2005; Quirk et al., 2005; Galley et al., 2006; Liu et al., 2006; Huang et al., 2006; Shen et al., 2008; Mi and Huang, 2008; . As syntactic information can be exploited to provide linguistically-motivated reordering rules, predicting non-local permutation is computationally tractable in syntax-based approaches. Unfortunately, as syntax-based decoders often generate target-language words in a bottom-up way using the CKY algorithm, integrating n-gram language models becomes more expensive because they have to maintain target boundary words at both ends of a partial translation (Chiang, 2007; Huang and Chiang, 2007) . Moreover, syntax-based approaches often suffer from the rule coverage problem since syntactic constraints rule out a large portion of nonsyntactic phrase pairs, which might help decoders generalize well to unseen data . Furthermore, the introduction of nonterminals makes the grammar size significantly bigger than phrase tables and leads to higher memory requirement (Chiang, 2007) .",
"cite_spans": [
{
"start": 98,
"end": 108,
"text": "(Wu, 1997;",
"ref_id": "BIBREF34"
},
{
"start": 109,
"end": 133,
"text": "Yamada and Knight, 2001;",
"ref_id": "BIBREF35"
},
{
"start": 134,
"end": 147,
"text": "Chiang, 2005;",
"ref_id": "BIBREF0"
},
{
"start": 148,
"end": 167,
"text": "Quirk et al., 2005;",
"ref_id": "BIBREF27"
},
{
"start": 168,
"end": 188,
"text": "Galley et al., 2006;",
"ref_id": "BIBREF7"
},
{
"start": 189,
"end": 206,
"text": "Liu et al., 2006;",
"ref_id": "BIBREF19"
},
{
"start": 207,
"end": 226,
"text": "Huang et al., 2006;",
"ref_id": "BIBREF12"
},
{
"start": 227,
"end": 245,
"text": "Shen et al., 2008;",
"ref_id": "BIBREF29"
},
{
"start": 246,
"end": 265,
"text": "Mi and Huang, 2008;",
"ref_id": "BIBREF22"
},
{
"start": 723,
"end": 737,
"text": "(Chiang, 2007;",
"ref_id": "BIBREF1"
},
{
"start": 738,
"end": 761,
"text": "Huang and Chiang, 2007)",
"ref_id": "BIBREF9"
},
{
"start": 1132,
"end": 1146,
"text": "(Chiang, 2007)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "As a result, incremental decoding with hierarchical structures has attracted increasing attention in recent years. While some authors try to integrate syntax into phrase-based decoding (Galley and Manning, 2008; Galley and Manning, 2009; Feng et al., 2010) , others develop incremental algorithms for syntax-based models (Watanabe et al., 2006; Huang and Mi, 2010; Dyer and Resnik, 2010; Feng et al., 2012) . Despite these successful efforts, challenges still remain for both directions. While parsing algorithms can be used to parse partial translations in phrase-based decoding, the search space is significantly enlarged since there are exponentially many parse trees for exponentially many translations. On the other hand, although target words can be generated left-to-right by altering the way of tree transversal in syntaxbased models, it is still difficult to reach full rule coverage as compared with phrase Figure 1 : A training example consisting of a (romanized) Chinese sentence, an English dependency tree, and the word alignment between them. Each translation rule is composed of a source phrase, a target phrase with a set of dependency arcs. Following Shen et al. (2008) , we distinguish between fixed, floating, and ill-formed structures.",
"cite_spans": [
{
"start": 185,
"end": 211,
"text": "(Galley and Manning, 2008;",
"ref_id": "BIBREF5"
},
{
"start": 212,
"end": 237,
"text": "Galley and Manning, 2009;",
"ref_id": "BIBREF6"
},
{
"start": 238,
"end": 256,
"text": "Feng et al., 2010)",
"ref_id": "BIBREF3"
},
{
"start": 321,
"end": 344,
"text": "(Watanabe et al., 2006;",
"ref_id": "BIBREF33"
},
{
"start": 345,
"end": 364,
"text": "Huang and Mi, 2010;",
"ref_id": "BIBREF10"
},
{
"start": 365,
"end": 387,
"text": "Dyer and Resnik, 2010;",
"ref_id": "BIBREF2"
},
{
"start": 388,
"end": 406,
"text": "Feng et al., 2012)",
"ref_id": "BIBREF4"
},
{
"start": 1169,
"end": 1187,
"text": "Shen et al. (2008)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [
{
"start": 917,
"end": 925,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper, we propose a shift-reduce parsing algorithm for phrase-based string-to-dependency translation. The basic unit of translation in our model is string-to-dependency phrase pair, which consists of a phrase on the source side and a dependency structure on the target side. The algorithm generates well-formed dependency structures for partial translations left-to-right using string-todependency phrase pairs. Therefore, our approach is capable of combining the advantages of both phrase-based and syntax-based approaches:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "1 . compact rule table: our rule table is a subset of the original string-to-dependency grammar (Shen et al., 2008; Shen et al., 2010) by excluding rules with non-terminals.",
"cite_spans": [
{
"start": 96,
"end": 115,
"text": "(Shen et al., 2008;",
"ref_id": "BIBREF29"
},
{
"start": 116,
"end": 134,
"text": "Shen et al., 2010)",
"ref_id": "BIBREF30"
}
],
"ref_spans": [
{
"start": 2,
"end": 50,
"text": ". compact rule table: our rule table is a subset",
"ref_id": "TABREF0"
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "2. full rule coverage: all phrase pairs, both syntactic and non-syntactic, can be used in our algorithm. This is the same with Moses (Koehn et al., 2007) .",
"cite_spans": [
{
"start": 133,
"end": 153,
"text": "(Koehn et al., 2007)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "3. efficient integration of n-gram language model: as translation grows left-to-right in our algorithm, integrating n-gram language models is straightforward.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "4. exploiting syntactic information: as the shift-reduce parsing algorithm generates target language dependency trees in decoding, dependency language models (Shen et al., 2008; Shen et al., 2010) can be used to encourage linguistically-motivated reordering.",
"cite_spans": [
{
"start": 158,
"end": 177,
"text": "(Shen et al., 2008;",
"ref_id": "BIBREF29"
},
{
"start": 178,
"end": 196,
"text": "Shen et al., 2010)",
"ref_id": "BIBREF30"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "5. resolving local parsing ambiguity: as dependency trees for phrases are memorized in rules, our approach avoids resolving local parsing ambiguity and explores in a smaller search space than parsing word-by-word on the fly in decoding (Galley and Manning, 2009) .",
"cite_spans": [
{
"start": 236,
"end": 262,
"text": "(Galley and Manning, 2009)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We evaluate our method on the NIST Chinese-English translation datasets. Experiments show that our approach significantly outperforms both phrase-based (Koehn et al., 2007) and string-todependency approaches (Shen et al., 2008) in terms of BLEU and TER.",
"cite_spans": [
{
"start": 152,
"end": 172,
"text": "(Koehn et al., 2007)",
"ref_id": "BIBREF18"
},
{
"start": 208,
"end": 227,
"text": "(Shen et al., 2008)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "2 Shift-Reduce Parsing for Phrase-based String-to-Dependency Translation Figure 1 shows a training example consisting of a (romanized) Chinese sentence, an English dependency tree, and the word alignment between them. Following Shen et al. (2008) , string-todependency rules without non-terminals can be extracted from the training example. As shown in Figure 1 , each rule is composed of a source phrase and a target dependency structure. Shen et al. (2008) divide dependency structures into two broad categories:",
"cite_spans": [
{
"start": 228,
"end": 246,
"text": "Shen et al. (2008)",
"ref_id": "BIBREF29"
},
{
"start": 440,
"end": 458,
"text": "Shen et al. (2008)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [
{
"start": 73,
"end": 81,
"text": "Figure 1",
"ref_id": null
},
{
"start": 353,
"end": 361,
"text": "Figure 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "1. well-formed (a) fixed: the head is known or fixed;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "0 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 1 S r 3 [The President will] \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 2 S r 1 [The President will] [visit] \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 3 R l [The President will visit] \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 4 S r 4 [The President will visit] [London in April] \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 5 R r [The President will visit London in April] \u2022 \u2022 \u2022 \u2022 \u2022 \u2022 \u2022",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "step action rule stack coverage Figure 2 : Shift-reduce parsing with string-to-dependency phrase pairs. For each state, the algorithm maintains a stack to store items (i.e., well-formed dependency structures). At each step, it chooses one action to extend a state: shift (S), reduce left (R l ), or reduce right (R r ). The decoding process terminates when all source words are covered and there is a complete dependency tree in the stack.",
"cite_spans": [],
"ref_spans": [
{
"start": 32,
"end": 40,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "(b) floating: sibling nodes of a common head, but the head itself is unspecified or floating. Each of the siblings must be a complete constituent.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "2. ill-formed: neither fixed nor floating.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We further distinguish between left and right floating structures according to the position of head. For example, as \"The President will\" is the left dependant of its head \"visit\", it is a left floating structure.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "To integrate the advantages of phrase-based and string-to-dependency models, we propose a shift-reduce algorithm for phrase-based string-todependency translation. Figure 2 shows an example. We describe a state (i.e., parser configuration) as a tuple S, C where S is a stack that stores items and C is a coverage vector that indicates which source words have been translated. Each item s \u2208 S is a well-formed dependency structure. The algorithm starts with an empty state. At each step, it chooses one of the three actions (Huang et al., 2009) to extend a state:",
"cite_spans": [
{
"start": 522,
"end": 542,
"text": "(Huang et al., 2009)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [
{
"start": 163,
"end": 171,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "1. shift (S): move a target dependency structure onto the stack;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "2. reduce left (R l ): combine the two items on the stack, s t and s t\u22121 (t \u2265 2), with the root of s t as the head and replace them with a combined item;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "3. reduce right (R r ): combine the two items on the stack, s t and s t\u22121 (t \u2265 2), with the root of s t\u22121 as the head and replace them with a combined item.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The decoding process terminates when all source words are covered and there is a complete dependency tree in the stack. Note that unlike monolingual shift-reduce parsers (Nivre, 2004; Zhang and Clark, 2008; Huang et al., 2009) , our algorithm does not maintain a queue for remaining words of the input because the future dependency structure to be shifted is unknown in advance in the translation scenario. Instead, we use a coverage vector on the source side to determine when to terminate the algorithm.",
"cite_spans": [
{
"start": 170,
"end": 183,
"text": "(Nivre, 2004;",
"ref_id": "BIBREF23"
},
{
"start": 184,
"end": 206,
"text": "Zhang and Clark, 2008;",
"ref_id": "BIBREF36"
},
{
"start": 207,
"end": 226,
"text": "Huang et al., 2009)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "For an input sentence of J words, the number of actions is 2K \u2212 1, where K is the number of rules used in decoding. 1 There are always K shifts and ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "S R r R l R l R l R l S R r Figure 3: Ambiguity in shift-reduce parsing. s t\u22121 s t legal action(s) yes S h yes S l yes S r no h h yes S, R l , R r h l yes S h r yes R r l h yes R l l l yes S l r no r",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "h no r l no r r no Table 1 : Conflicts in shift-reduce parsing. s t and s t\u22121 are the top two items in the stack of a state. We use \"h\" to denote fixed structure, \"l\" to denote left floating structure, and \"r\" to denote right floating structure. It is clear that only \"h+h\" is ambiguous.",
"cite_spans": [],
"ref_spans": [
{
"start": 19,
"end": 26,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "K \u2212 1 reductions. It is easy to verify that the reduce left and reduce right actions are equivalent to the left adjoining and right adjoining operations defined by Shen et al. (2008) . They suffice to operate on wellformed structures and produce projective dependency parse trees. Therefore, with dependency structures present in the stacks, it is possible to use dependency language models to encourage linguistically plausible phrase reordering.",
"cite_spans": [
{
"start": 164,
"end": 182,
"text": "Shen et al. (2008)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Shift-reduce parsing is efficient but suffers from parsing errors caused by syntactic ambiguity. Figure 3 shows two (partial) derivations for a dependency tree. Consider the item on the top, the algorithm can either apply a shift action to move a new item or apply a reduce left action to obtain a bigger structure. This is often referred to as conflict in the shift-reduce dependency parsing literature (Huang et al., 2009) . In this work, the shift-reduce parser faces four types of conflicts: ",
"cite_spans": [
{
"start": 404,
"end": 424,
"text": "(Huang et al., 2009)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [
{
"start": 97,
"end": 103,
"text": "Figure",
"ref_id": null
}
],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "W h (st\u22121) W lc (st) Wrc(st\u22121) T h (st) T h (st\u22121) T lc (st) Trc(st\u22121) Bigram W h (st) \u2022 W h (st\u22121) T h (St) \u2022 T h (st\u22121) W h (st) \u2022 T h (st) W h (st\u22121) \u2022 T h (st\u22121) W h (st) \u2022 Wrc(st\u22121) W h (st\u22121) \u2022 W lc (st) Trigram c \u2022 W h (st) \u2022 W (st\u22121) c \u2022 T h (st) \u2022 T h (st\u22121) W h (st) \u2022 W h (st\u22121) \u2022 T lc (st) W h (st) \u2022 W h (st\u22121) \u2022 Trc(st\u22121) T h (st) \u2022 T h (st\u22121) \u2022 T lc (st) T h (st) \u2022 T h (st\u22121) \u2022 Trc(st\u22121)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "c = true, W h (s t ) = in, T h (s t ) = IN, W h (s t\u22121 ) = visit, W lc (s t\u22121 ) = London.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "items in the stack. \"h\" stands for fixed structure, \"l\" for left floating structure, and \"r\" for right floating structure. If the stack is empty, the only applicable action is shift. If there is only one item in the stack and the item is either fixed or left floating, the only applicable action is shift. Note that it is illegal to shift a right floating structure onto an empty stack because it will never be reduced. If the stack contains at least two items, only \"h+h\" is ambiguous and the others are either unambiguous or illegal. Therefore, we only need to focus on how to resolve conflicts for the \"h+h\" case (i.e., the top two items in a stack are both fixed structures).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "We propose a maximum entropy model to resolve the conflicts for \"h+h\": 2 The shift-shift conflicts always exist because there are usually multiple rules that can be shifted. This can be revolved using standard features in phrase-based models.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "P \u03b8 (a|c, s t , s t\u22121 ) = exp(\u03b8 \u2022 h(a, c, s t , s t\u22121 )) a exp(\u03b8 \u2022 h(a, c, s t , s t\u22121 )) where a \u2208 {S, R l , R r } is an action, c",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "word and tag of the right most child of the root. In this example, c = true, W h (s",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "t ) = in, T h (s t ) = IN, W h (s t\u22121 ) = visit, W lc (s t\u22121 ) = London.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "To train the model, we need an \"oracle\" or goldstandard action sequence for each training example. Unfortunately, such oracle turns out to be non-unique even for monolingual shift-reduce dependency parsing (Huang et al., 2009) . The situation for phrase-based shift-reduce parsing aggravates because there are usually multiple ways of segmenting sentence into phrases.",
"cite_spans": [
{
"start": 206,
"end": 226,
"text": "(Huang et al., 2009)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "To alleviate this problem, we introduce a structure called derivation graph to compactly represent all derivations of a training example. Figure 3 shows a (partial) derivation graph, in which a node corresponds to a state and an edge corresponds to an action. The graph begins with an empty state and ends with the given training example.",
"cite_spans": [],
"ref_spans": [
{
"start": 138,
"end": 146,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "More formally, a derivation graph is a directed acyclic graph G = V, E where V is a set of nodes and E is a set of edges. Each node v corresponds to a state in the shift-reduce parsing process. There are two distinguished nodes: v 0 , the staring empty state, and v |V | , the ending completed state. Each edge e = (a, i, j) transits node v i to node v j via an action a \u2208 {S, R l , R r }.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "To build the derivation graph, our algorithm starts with an empty state and iteratively extends an unprocessed state until reaches the completed state. During the process, states that violate the training example are discarded. Even so, there are still exponentially many states for a training example, especially for long sentences. Fortunately, we Algorithm 1 Beam-search shift-reduce parsing. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "1: procedure PARSE(f ) 2: V \u2190 \u2205 3: ADD(v 0 , V[0]) 4: k \u2190 0 5: while V[k] = \u2205 do 6: for all v \u2208 V[k] do 7: for all a \u2208 {S, R l , R r } do 8: EXTEND(f , v, a, V",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "k \u2190 k + 1 12:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "end while 13: end procedure only need to focus on \"h+h\" states. In addition, we follow Huang et al. (2009) to use the heuristic of \"shortest stack\" to always prefer R l to S.",
"cite_spans": [
{
"start": 87,
"end": 106,
"text": "Huang et al. (2009)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "A Maximum Entropy Based Shift-Reduce Parsing Model",
"sec_num": "3"
},
{
"text": "Our decoder is based on a linear model (Och, 2003) with the following features: In practice, we extend deterministic shiftreduce parsing with beam search (Zhang and Clark, 2008; Huang et al., 2009) . As shown in Algorithm 1, the algorithm maintains a list of stacks V and each stack groups states with the same number of accumulated actions (line 2). The stack list V initializes with an empty state v 0 (line 3). Then, the states in the stack are iteratively extended until there are no incomplete states (lines 4-12). The search space is constrained by discarding any state that has a score worse than:",
"cite_spans": [
{
"start": 39,
"end": 50,
"text": "(Och, 2003)",
"ref_id": "BIBREF25"
},
{
"start": 154,
"end": 177,
"text": "(Zhang and Clark, 2008;",
"ref_id": "BIBREF36"
},
{
"start": 178,
"end": 197,
"text": "Huang et al., 2009)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "4"
},
{
"text": "1. \u03b2 multiplied with the best score in the stack, or 2. the score of b-th best state in the stack.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "4"
},
{
"text": "As the stack of a state keeps changing during the decoding process, the context information needed to calculate dependency language model and maximum entropy model probabilities (e.g., root word, leftmost child, etc.) changes dynamically as well. As a result, the chance of risk-free hypothesis recombination (Koehn et al., 2003 ) significantly decreases because complicated contextual information is much less likely to be identical.",
"cite_spans": [
{
"start": 309,
"end": 328,
"text": "(Koehn et al., 2003",
"ref_id": "BIBREF17"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "4"
},
{
"text": "Therefore, we use hypergraph reranking (Huang and Chiang, 2007; Huang, 2008) , which proves to be effective for integrating non-local features into dynamic programming, to alleviate this problem. The decoding process is divided into two passes. In the first pass, only standard features (i.e., features 1-7 in the list in the beginning of this section) are used to produce a hypergraph. 3 In the second pass, we use the hypergraph reranking algorithm (Huang, 2008) to find promising translations using additional dependency features (i.e., features 8-10 in the list). As hypergraph is capable of storing exponentially many derivations compactly, the negative effect of propagating mistakes made in the first pass to the second pass can be minimized.",
"cite_spans": [
{
"start": 39,
"end": 63,
"text": "(Huang and Chiang, 2007;",
"ref_id": "BIBREF9"
},
{
"start": 64,
"end": 76,
"text": "Huang, 2008)",
"ref_id": "BIBREF14"
},
{
"start": 387,
"end": 388,
"text": "3",
"ref_id": null
},
{
"start": 451,
"end": 464,
"text": "(Huang, 2008)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "4"
},
{
"text": "To improve rule coverage, we follow Shen et al. (2008) to use ill-formed structures in decoding. If an ill-formed structure has a single root, it can treated as a (pseudo) fixed structure; otherwise it is transformed to one (pseudo) left floating structure and one (pseudo) right floating structure. We use a feature to count how many ill-formed structures are used in decoding. (Koehn et al., 2007) and a re-implementation of the bottom-up stringto-dependency decoder (Shen et al., 2008) in terms of uncased BLEU and TER. We use randomization test (Riezler and Maxwell, 2005) to calculate statistical significance. *: significantly better than Moses (p < 0.05), **: significantly better than Moses (p < 0.01), +: significantly better than string-todependency (p < 0.05), ++: significantly better than string-to-dependency (p < 0.01). Table 3 : Contribution of maximum entropy shiftreduce parsing model. \"standard\" denotes using standard features of phrase-based system. Adding dependency language model (\"depLM\") and the maximum entropy shift-reduce parsing model (\"maxent\") significantly improves BLEU and TER on the development set, both separately and jointly.",
"cite_spans": [
{
"start": 36,
"end": 54,
"text": "Shen et al. (2008)",
"ref_id": "BIBREF29"
},
{
"start": 379,
"end": 399,
"text": "(Koehn et al., 2007)",
"ref_id": "BIBREF18"
},
{
"start": 469,
"end": 488,
"text": "(Shen et al., 2008)",
"ref_id": "BIBREF29"
},
{
"start": 549,
"end": 576,
"text": "(Riezler and Maxwell, 2005)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [
{
"start": 835,
"end": 842,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Decoding",
"sec_num": "4"
},
{
"text": "4-gram language model on the Xinhua portion of the GIGAWORD coprus, which contians 238M English words. A 3-gram dependency language model was trained on the English dependency trees. We used the 2002 NIST MT Chinese-English dataset as the development set and the 2003-2005 NIST datasets as the testsets. We evaluated translation quality using uncased BLEU (Papineni et al., 2002) and TER (Snover et al., 2006) . The features were optimized with respect to BLEU using the minimum error rate training algorithm (Och, 2003) .",
"cite_spans": [
{
"start": 356,
"end": 379,
"text": "(Papineni et al., 2002)",
"ref_id": "BIBREF26"
},
{
"start": 388,
"end": 409,
"text": "(Snover et al., 2006)",
"ref_id": "BIBREF31"
},
{
"start": 509,
"end": 520,
"text": "(Och, 2003)",
"ref_id": "BIBREF25"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "features",
"sec_num": null
},
{
"text": "We chose the following two systems that are closest to our work as baselines:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "features",
"sec_num": null
},
{
"text": "1. The Moses phrase-based decoder (Koehn et al., 2007) .",
"cite_spans": [
{
"start": 34,
"end": 54,
"text": "(Koehn et al., 2007)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "features",
"sec_num": null
},
{
"text": "A re-implementation of bottom-up string-todependency decoder (Shen et al., 2008) .",
"cite_spans": [
{
"start": 61,
"end": 80,
"text": "(Shen et al., 2008)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "All the three systems share with the same targetside parsed, word-aligned training data. phrase table limit is set to 20 for all the three systems. Moses shares the same feature set with our system except for the dependency features. For the bottom-up string-to-dependency system, we included both well-formed and ill-formed structures in chart parsing. To control the grammar size, we only extracted \"tight\" initial phrase pairs (i.e., the boundary words of a phrase must be aligned) as suggested by (Chiang, 2007) . For our system, we used the Le Zhang's maximum entropy modeling toolkit to train the shift-reduce parsing model after extracting 32.6M events from the training data. 4 We set the iteration limit to 100. The accuracy on the training data is 90.18%. Table 2 gives the performance of Moses, the bottom-up string-to-dependency system, and our system in terms of uncased BLEU and TER scores. From the same training data, Moses extracted 103M bilingual phrases, the bottomup string-to-dependency system extracted 587M string-to-dependency rules, and our system extracted 124M phrase-based dependency rules. We find that our approach outperforms both baselines systematically on all testsets. We use randomization test (Riezler and Maxwell, 2005) dency language models without loss in rule coverage, it achieves significantly better results than Moses on all test sets. The gains in TER are much larger than BLEU because dependency language models do not model n-grams directly. Compared with the bottom-up string-to-dependency system, our system outperforms consistently but not significantly in all cases. The average decoding time for Moses is 3.67 seconds per sentence, bottomup string-to-dependency is 13.89 seconds, and our system is 4.56 seconds. Table 3 shows the effect of hypergraph reranking. In the first pass, our decoder uses standard phrase-based features to build a hypergraph. The BLEU score is slightly lower than Moses with the same configuration. One possible reason is that our decoder organizes stacks with respect to actions, whereas Moses groups partial translations with the same number of covered source words in stacks. In the second pass, our decoder reranks the hypergraph with additional dependency features. We find that adding dependency language and maximum entropy shift-reduce models consistently brings significant improvements, both separately and jointly.",
"cite_spans": [
{
"start": 501,
"end": 515,
"text": "(Chiang, 2007)",
"ref_id": "BIBREF1"
},
{
"start": 684,
"end": 685,
"text": "4",
"ref_id": null
},
{
"start": 1230,
"end": 1257,
"text": "(Riezler and Maxwell, 2005)",
"ref_id": "BIBREF28"
}
],
"ref_spans": [
{
"start": 766,
"end": 773,
"text": "Table 2",
"ref_id": "TABREF5"
},
{
"start": 1765,
"end": 1772,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "We analyzed translation rules extracted from the training data. Among them, well-formed structures account for 43.58% (fixed 33.21%, floating left 9.01%, and floating right 1.36%) and illformed structures 56.42%. As shown in Table 4 , using all rules clearly outperforms using only well-formed structures. Figure 5 shows the performance of Moses and our system with various distortion limits on the development set. Our system consistently outper-forms Moses in all cases, suggesting that adding dependency helps improve phrase reordering.",
"cite_spans": [],
"ref_spans": [
{
"start": 225,
"end": 233,
"text": "Table 4",
"ref_id": "TABREF8"
},
{
"start": 307,
"end": 315,
"text": "Figure 5",
"ref_id": "FIGREF4"
}
],
"eq_spans": [],
"section": "2.",
"sec_num": null
},
{
"text": "The work of Galley and Manning (2009) is closest in spirit to ours. They introduce maximum spanning tree (MST) parsing (McDonald et al., 2005) into phrase-based translation. The system is phrase-based except that an MST parser runs to parse partial translations at the same time. One challenge is that MST parsing itself is not incremental, making it expensive to identify loops during hypothesis expansion. On the contrary, shiftreduce parsing is naturally incremental and can be seamlessly integrated into left-to-right phrasebased decoding. More importantly, in our work dependency trees are memorized for phrases rather than being generated word by word on the fly in decoding. This treatment might not only reduce decoding complexity but also potentially revolve local parsing ambiguity.",
"cite_spans": [
{
"start": 12,
"end": 37,
"text": "Galley and Manning (2009)",
"ref_id": "BIBREF6"
},
{
"start": 119,
"end": 142,
"text": "(McDonald et al., 2005)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "Our decoding algorithm is similar to Gimpel and Smith (2011)'s lattice parsing algorithm as we divide decoding into two steps: hypergraph generation and hypergraph rescoring. The major difference is that our hypergraph is not a phrasal lattice because each phrase pair is associated with a dependency structure on the target side. In other words, our second pass is to find the Viterbi derivation with addition features rather than parsing the phrasal lattice. In addition, their algorithm produces phrasal dependency parse trees while the leaves of our dependency trees are words, making dependency language models can be directly used.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "Shift-reduce parsing has been successfully used in phrase-based decoding but limited to adding structural constraints. Galley and Manning (2008) propose a shift-reduce algorithm to integrate a hierarchical reordering model into phrase-based systems. Feng et al. (2010) use shift-reduce parsing to impose ITG (Wu, 1997) constraints on phrase permutation. Our work differs from theirs by going further to incorporate linguistic syntax into phrase-based decoding.",
"cite_spans": [
{
"start": 119,
"end": 144,
"text": "Galley and Manning (2008)",
"ref_id": "BIBREF5"
},
{
"start": 250,
"end": 268,
"text": "Feng et al. (2010)",
"ref_id": "BIBREF3"
},
{
"start": 308,
"end": 318,
"text": "(Wu, 1997)",
"ref_id": "BIBREF34"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "Along another line, a number of authors have developed incremental algorithms for syntaxbased models (Watanabe et al., 2006; Huang and Mi, 2010; Dyer and Resnik, 2010; Feng et al., 2012) . Watanabe et al. (2006) introduce an Earlystyle top-down parser based on binary-branching Greibach Normal Form. , Dyer and Resnik (2010) , and Feng et al. (2012) use dotted rules to change the tree transversal to generate target words left-to-right, either top-down or bottom-up.",
"cite_spans": [
{
"start": 101,
"end": 124,
"text": "(Watanabe et al., 2006;",
"ref_id": "BIBREF33"
},
{
"start": 125,
"end": 144,
"text": "Huang and Mi, 2010;",
"ref_id": "BIBREF10"
},
{
"start": 145,
"end": 167,
"text": "Dyer and Resnik, 2010;",
"ref_id": "BIBREF2"
},
{
"start": 168,
"end": 186,
"text": "Feng et al., 2012)",
"ref_id": "BIBREF4"
},
{
"start": 189,
"end": 211,
"text": "Watanabe et al. (2006)",
"ref_id": "BIBREF33"
},
{
"start": 302,
"end": 324,
"text": "Dyer and Resnik (2010)",
"ref_id": "BIBREF2"
},
{
"start": 331,
"end": 349,
"text": "Feng et al. (2012)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "6"
},
{
"text": "We have presented a shift-reduce parsing algorithm for phrase-based string-to-dependency translation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "7"
},
{
"text": "The algorithm generates dependency structures incrementally using string-todependency phrase pairs. Therefore, our approach is capable of combining the advantages of both phrase-based and string-to-dependency models, it outperforms the two baselines on Chineseto-English translation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "7"
},
{
"text": "In the future, we plan to include more contextual information (e.g., the uncovered source phrases) in the maximum entropy model to resolve conflicts. Another direction is to adapt the dynamic programming algorithm proposed by Huang and Sagae (2010) to improve our string-todependency decoder. It is also interesting to compare with applying word-based shift-reduce parsing to phrase-based decoding similar to (Galley and Manning, 2009) .",
"cite_spans": [
{
"start": 226,
"end": 248,
"text": "Huang and Sagae (2010)",
"ref_id": "BIBREF11"
},
{
"start": 409,
"end": 435,
"text": "(Galley and Manning, 2009)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "7"
},
{
"text": "Empirically, we find that the average number of stacks for J words is about 1.5 \u00d7 J on the Chinese-English data.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "ExperimentsWe evaluated our phrase-based string-todependency translation system on Chinese-English translation. The training data consists of 2.9M pairs of sentences with 76.0M Chinese words and 82.2M English words. We used the Stanford parser(Klein and Manning, 2003) to get dependency trees for English sentences. We used the SRILM toolkit(Stolcke, 2002) to train a 3 Note that the first pass does not work like a phrase-based decoder because it yields dependency trees on the target side. A uniform model (i.e., each action has a fixed probability of 1/3) is used to resolve \"h+h\" conflicts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "http://homepages.inf.ed.ac.uk/lzhang10/maxent.html",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "A hiearchical phrase-based model for statistical machine translation",
"authors": [
{
"first": "David",
"middle": [],
"last": "Chiang",
"suffix": ""
}
],
"year": 2005,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Chiang. 2005. A hiearchical phrase-based model for statistical machine translation. In Proc. of ACL 2005.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Hierarchical phrase-based translation",
"authors": [
{
"first": "David",
"middle": [],
"last": "Chiang",
"suffix": ""
}
],
"year": 2007,
"venue": "Computational Linguistics",
"volume": "33",
"issue": "2",
"pages": "201--228",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Chiang. 2007. Hierarchical phrase-based trans- lation. Computational Linguistics, 33(2):201-228.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Context-free reordering, finite-state translation",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Dyer",
"suffix": ""
},
{
"first": "Philip",
"middle": [],
"last": "Resnik",
"suffix": ""
}
],
"year": 2010,
"venue": "Proc. of NAACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chris Dyer and Philip Resnik. 2010. Context-free re- ordering, finite-state translation. In Proc. of NAACL 2010.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "An efficient shift-reduce decoding algorithm for phrased-based machine translation",
"authors": [
{
"first": "Yang",
"middle": [],
"last": "Feng",
"suffix": ""
},
{
"first": "Haitao",
"middle": [],
"last": "Mi",
"suffix": ""
},
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Qun",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2010,
"venue": "Proc. of COLING",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yang Feng, Haitao Mi, Yang Liu, and Qun Liu. 2010. An efficient shift-reduce decoding algorithm for phrased-based machine translation. In Proc. of COLING 2010.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Left-to-right tree-to-string decoding with prediction",
"authors": [
{
"first": "Yang",
"middle": [],
"last": "Feng",
"suffix": ""
},
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Qun",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Trevor",
"middle": [],
"last": "Cohn",
"suffix": ""
}
],
"year": 2012,
"venue": "Proc. of EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yang Feng, Yang Liu, Qun Liu, and Trevor Cohn. 2012. Left-to-right tree-to-string decoding with pre- diction. In Proc. of EMNLP 2012.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "A simple and effective hierarchical phrase reordering model",
"authors": [
{
"first": "Michel",
"middle": [],
"last": "Galley",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
}
],
"year": 2008,
"venue": "Proc. of EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michel Galley and Christopher D. Manning. 2008. A simple and effective hierarchical phrase reordering model. In Proc. of EMNLP 2008.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Quadratic-time dependency parsing for machine translation",
"authors": [
{
"first": "Michel",
"middle": [],
"last": "Galley",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
}
],
"year": 2009,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michel Galley and Christopher D. Manning. 2009. Quadratic-time dependency parsing for machine translation. In Proc. of ACL 2009.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Scalable inference and training of context-rich syntactic translation models",
"authors": [
{
"first": "Michel",
"middle": [],
"last": "Galley",
"suffix": ""
},
{
"first": "Jonathan",
"middle": [],
"last": "Graehl",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Marcu",
"suffix": ""
},
{
"first": "Steve",
"middle": [],
"last": "Deneefe",
"suffix": ""
},
{
"first": "Wei",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Ignacio",
"middle": [],
"last": "Thayer",
"suffix": ""
}
],
"year": 2006,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michel Galley, Jonathan Graehl, Kevin Knight, Daniel Marcu, Steve DeNeefe, Wei Wang, and Ignacio Thayer. 2006. Scalable inference and training of context-rich syntactic translation models. In Proc. of ACL 2006.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Quasisynchronous phrase dependency grammars for machine translation",
"authors": [
{
"first": "Kevin",
"middle": [],
"last": "Gimpel",
"suffix": ""
},
{
"first": "Noah",
"middle": [
"A"
],
"last": "Smith",
"suffix": ""
}
],
"year": 2011,
"venue": "Proc. of EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kevin Gimpel and Noah A. Smith. 2011. Quasi- synchronous phrase dependency grammars for ma- chine translation. In Proc. of EMNLP 2011.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Forest rescoring: Faster decoding with integrated language models",
"authors": [
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Chiang",
"suffix": ""
}
],
"year": 2007,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liang Huang and David Chiang. 2007. Forest rescor- ing: Faster decoding with integrated language mod- els. In Proc. of ACL 2007.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Efficient incremental decoding for tree-to-string translation",
"authors": [
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Haitao",
"middle": [],
"last": "Mi",
"suffix": ""
}
],
"year": 2010,
"venue": "Proc. of EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liang Huang and Haitao Mi. 2010. Efficient incre- mental decoding for tree-to-string translation. In Proc. of EMNLP 2010.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Dynamic programming for linear-time incremental parsing",
"authors": [
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Kenji",
"middle": [],
"last": "Sagae",
"suffix": ""
}
],
"year": 2010,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liang Huang and Kenji Sagae. 2010. Dynamic pro- gramming for linear-time incremental parsing. In Proc. of ACL 2010.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Statistical syntax-directed translation with extended domain of locality",
"authors": [
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
},
{
"first": "Aravind",
"middle": [],
"last": "Joshi",
"suffix": ""
}
],
"year": 2006,
"venue": "Proc. of AMTA",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liang Huang, Kevin Knight, and Aravind Joshi. 2006. Statistical syntax-directed translation with extended domain of locality. In Proc. of AMTA 2006.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Bilingually-constrained (monolingual) shift-reduce parsing",
"authors": [
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Wenbin",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Qun",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2009,
"venue": "Proc. of EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liang Huang, Wenbin Jiang, and Qun Liu. 2009. Bilingually-constrained (monolingual) shift-reduce parsing. In Proc. of EMNLP 2009.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Forest reranking: Discriminative parsing with non-local features",
"authors": [
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
}
],
"year": 2008,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liang Huang. 2008. Forest reranking: Discrimina- tive parsing with non-local features. In Proc. of ACL 2008.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Accurate unlexicalized parsing",
"authors": [
{
"first": "Dan",
"middle": [],
"last": "Klein",
"suffix": ""
},
{
"first": "Christopher",
"middle": [],
"last": "Manning",
"suffix": ""
}
],
"year": 2003,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dan Klein and Christopher Manning. 2003. Accurate unlexicalized parsing. In Proc. of ACL 2003.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Decoding complexity in wordreplacement translation models",
"authors": [
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
}
],
"year": 1999,
"venue": "Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kevin Knight. 1999. Decoding complexity in word- replacement translation models. Computational Linguistics.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Statistical phrase-based translation",
"authors": [
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "Franz",
"middle": [],
"last": "Och",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Marcu",
"suffix": ""
}
],
"year": 2003,
"venue": "Proc. of NAACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Philipp Koehn, Franz Och, and Daniel Marcu. 2003. Statistical phrase-based translation. In Proc. of NAACL 2003.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Moses: Open source toolkit for statistical machine translation",
"authors": [
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "Hieu",
"middle": [],
"last": "Hoang",
"suffix": ""
},
{
"first": "Alexandra",
"middle": [],
"last": "Birch",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Callison-Burch",
"suffix": ""
},
{
"first": "Marcello",
"middle": [],
"last": "Federico",
"suffix": ""
},
{
"first": "Nicola",
"middle": [],
"last": "Bertoldi",
"suffix": ""
},
{
"first": "Brooke",
"middle": [],
"last": "Cowan",
"suffix": ""
},
{
"first": "Wade",
"middle": [],
"last": "Shen",
"suffix": ""
}
],
"year": 2007,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Philipp Koehn, Hieu Hoang, Alexandra Birch, Chris Callison-Burch, Marcello Federico, Nicola Bertoldi, Brooke Cowan, Wade Shen, Christine Moran, Richard Zens, Chris Dyer, Ondrej Bojar, Alexandra Constantin, and Evan Herbst. 2007. Moses: Open source toolkit for statistical machine translation. In Proc. of ACL 2007.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Treeto-string alignment template for statistical machine translation",
"authors": [
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Qun",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Shouxun",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 2006,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yang Liu, Qun Liu, and Shouxun Lin. 2006. Tree- to-string alignment template for statistical machine translation. In Proc. of ACL 2006.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Spmt: Statistical machine translation with syntactified target language phrases",
"authors": [
{
"first": "Daniel",
"middle": [],
"last": "Marcu",
"suffix": ""
},
{
"first": "Wei",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Abdessamad",
"middle": [],
"last": "Echihabi",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
}
],
"year": 2006,
"venue": "Proc. of EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Daniel Marcu, Wei Wang, Abdessamad Echihabi, and Kevin Knight. 2006. Spmt: Statistical machine translation with syntactified target language phrases. In Proc. of EMNLP 2006.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Non-projective dependency parsing using spanning tree algorithms",
"authors": [
{
"first": "R",
"middle": [],
"last": "Mcdonald",
"suffix": ""
},
{
"first": "F",
"middle": [],
"last": "Pereira",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Ribarov",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Hajic",
"suffix": ""
}
],
"year": 2005,
"venue": "Proc. of EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "R. McDonald, F. Pereira, K. Ribarov, and J. Hajic. 2005. Non-projective dependency parsing using spanning tree algorithms. In Proc. of EMNLP 2005.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Forest-based translation",
"authors": [
{
"first": "Haitao",
"middle": [],
"last": "Mi",
"suffix": ""
},
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
}
],
"year": 2008,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Haitao Mi and Liang Huang. 2008. Forest-based trans- lation. In Proc. of ACL 2008.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Incrementality in deterministic dependency parsing",
"authors": [
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
}
],
"year": 2004,
"venue": "Proc. of ACL 2004 Workshop Incremental Parsing: Bringning Engineering and Cognition Together",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joakim Nivre. 2004. Incrementality in deterministic dependency parsing. In Proc. of ACL 2004 Work- shop Incremental Parsing: Bringning Engineering and Cognition Together.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "The alignment template approach to statistical machine translation",
"authors": [
{
"first": "Franz",
"middle": [],
"last": "Och",
"suffix": ""
},
{
"first": "Hermann",
"middle": [],
"last": "Ney",
"suffix": ""
}
],
"year": 2004,
"venue": "Computational Linguistics",
"volume": "",
"issue": "4",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Franz Och and Hermann Ney. 2004. The alignment template approach to statistical machine translation. Computational Linguistics, 30(4).",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Minimum error rate training in statistical machine translation",
"authors": [
{
"first": "Franz",
"middle": [],
"last": "Och",
"suffix": ""
}
],
"year": 2003,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Franz Och. 2003. Minimum error rate training in sta- tistical machine translation. In Proc. of ACL 2003.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Bleu: a method for automatic evaluation of machine translation",
"authors": [
{
"first": "Kishore",
"middle": [],
"last": "Papineni",
"suffix": ""
},
{
"first": "Salim",
"middle": [],
"last": "Roukos",
"suffix": ""
},
{
"first": "Todd",
"middle": [],
"last": "Ward",
"suffix": ""
},
{
"first": "Wei-Jing",
"middle": [],
"last": "Zhu",
"suffix": ""
}
],
"year": 2002,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kishore Papineni, Salim Roukos, Todd Ward, and Wei- Jing Zhu. 2002. Bleu: a method for automatic eval- uation of machine translation. In Proc. of ACL 2002.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Dependency treelet translation: Syntactically informed phrasal smt",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Quirk",
"suffix": ""
},
{
"first": "Arul",
"middle": [],
"last": "Menezes",
"suffix": ""
},
{
"first": "Colin",
"middle": [],
"last": "Cherry",
"suffix": ""
}
],
"year": 2005,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chris Quirk, Arul Menezes, and Colin Cherry. 2005. Dependency treelet translation: Syntactically in- formed phrasal smt. In Proc. of ACL 2005.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "On some pitfalls in automatic evaluation and significance testing for mt",
"authors": [
{
"first": "S",
"middle": [],
"last": "Riezler",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Maxwell",
"suffix": ""
}
],
"year": 2005,
"venue": "Proc. of ACL 2005 Workshop on Intrinsic and Extrinsic Evaluation Measures for Machine Translation and/or Summarization",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "S. Riezler and J. Maxwell. 2005. On some pitfalls in automatic evaluation and significance testing for mt. In Proc. of ACL 2005 Workshop on Intrinsic and Extrinsic Evaluation Measures for Machine Trans- lation and/or Summarization.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "A new string-to-dependency machine translation algorithm with a target dependency language model",
"authors": [
{
"first": "Libin",
"middle": [],
"last": "Shen",
"suffix": ""
},
{
"first": "Jinxi",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Ralph",
"middle": [],
"last": "Weischedel",
"suffix": ""
}
],
"year": 2008,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Libin Shen, Jinxi Xu, and Ralph Weischedel. 2008. A new string-to-dependency machine translation algo- rithm with a target dependency language model. In Proc. of ACL 2008.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "String-to-dependency statistical machine translation",
"authors": [
{
"first": "Libin",
"middle": [],
"last": "Shen",
"suffix": ""
},
{
"first": "Jinxi",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Ralph",
"middle": [],
"last": "Weischedel",
"suffix": ""
}
],
"year": 2010,
"venue": "Computational Linguistics",
"volume": "",
"issue": "4",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Libin Shen, Jinxi Xu, and Ralph Weischedel. 2010. String-to-dependency statistical machine transla- tion. Computational Linguistics, 36(4).",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "A study of translation edit rate with targeted human annotation",
"authors": [
{
"first": "Matthew",
"middle": [],
"last": "Snover",
"suffix": ""
},
{
"first": "Bonnie",
"middle": [],
"last": "Dorr",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Schwartz",
"suffix": ""
},
{
"first": "Linnea",
"middle": [],
"last": "Micciulla",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Makhoul",
"suffix": ""
}
],
"year": 2006,
"venue": "Proc. of AMTA",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Matthew Snover, Bonnie Dorr, Richard Schwartz, Lin- nea Micciulla, and John Makhoul. 2006. A study of translation edit rate with targeted human annotation. In Proc. of AMTA 2006.",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Srilm -an extensible language modeling toolkit",
"authors": [
{
"first": "Andreas",
"middle": [],
"last": "Stolcke",
"suffix": ""
}
],
"year": 2002,
"venue": "Proc. of ICSLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Andreas Stolcke. 2002. Srilm -an extensible language modeling toolkit. In Proc. of ICSLP 2002.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Left-to-right target generation for hierarchical phrase-based translation",
"authors": [
{
"first": "Taro",
"middle": [],
"last": "Watanabe",
"suffix": ""
},
{
"first": "Hajime",
"middle": [],
"last": "Tsukuda",
"suffix": ""
},
{
"first": "Hideki",
"middle": [],
"last": "Isozaki",
"suffix": ""
}
],
"year": 2006,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Taro Watanabe, Hajime Tsukuda, and Hideki Isozaki. 2006. Left-to-right target generation for hierarchical phrase-based translation. In Proc. of ACL 2006.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Stochastic inversion transduction grammars and bilingual parsing of parallel corpora",
"authors": [
{
"first": "Dekai",
"middle": [],
"last": "Wu",
"suffix": ""
}
],
"year": 1997,
"venue": "Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dekai Wu. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "A syntaxbased statistical translation model",
"authors": [
{
"first": "Kenji",
"middle": [],
"last": "Yamada",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
}
],
"year": 2001,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kenji Yamada and Kevin Knight. 2001. A syntax- based statistical translation model. In Proc. of ACL 2001.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "A tale of two parsers: investigating and combining graphbased and transition-based dependency parsing using beam search",
"authors": [
{
"first": "Yue",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Stephen",
"middle": [],
"last": "Clark",
"suffix": ""
}
],
"year": 2008,
"venue": "Proc. of EMNLP",
"volume": "",
"issue": "",
"pages": "",
"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 us- ing beam search. In Proc. of EMNLP 2008.",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"title": "A tree sequence alignment-based tree-to-tree translation model",
"authors": [
{
"first": "Min",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Hongfei",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Aiti",
"middle": [],
"last": "Aw",
"suffix": ""
},
{
"first": "Haizhou",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Sheng",
"middle": [],
"last": "Chew Lim Tan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2008,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Min Zhang, Hongfei Jiang, Aiti Aw, Haizhou Li, Chew Lim Tan, and Sheng Li. 2008. A tree sequence alignment-based tree-to-tree translation model. In Proc. of ACL 2008.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "Feature templates for maximum entropy based shift-reduce parsing model. c is a boolean value that indicate whether all source words are covered (shift is prohibited if true), W h (\u2022) and T h (\u2022) are functions that get the root word and tag of an item, W lc (\u2022) and T lc (\u2022) returns the word and tag of the left most child of the root, W rc (\u2022) amd T rc (\u2022) returns the word and tag of the right most child of the root. Symbol \u2022 denotes feature conjunction. In this example,"
},
"FIGREF1": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "is a boolean value that indicates whether all source words are covered (shift is prohibited if true), s t and s t\u22121 are the top two items on the stack, h(a, c, s t , s t\u22121 ) is a vector of binary features and \u03b8 is a vector of feature weights."
},
"FIGREF2": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "shows the feature templates used in our experiments. W h (\u2022) and T h (\u2022) are functions that get the root word and tag of an item, W lc (\u2022) and T lc (\u2022) returns the word and tag of the left most child of the root, W rc (\u2022) and T rc (\u2022) returns the 2"
},
"FIGREF4": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "Performance of Moses and our system with various distortion limits."
},
"TABREF0": {
"content": "<table><tr><td>zongtong jiang</td><td>yu</td><td>siyue</td><td>lai</td><td colspan=\"2\">lundun fangwen</td></tr><tr><td colspan=\"2\">The President will</td><td colspan=\"2\">visit London</td><td>in</td><td>April</td></tr><tr><td>source phrase</td><td colspan=\"2\">target phrase</td><td/><td colspan=\"2\">dependency category</td></tr><tr><td colspan=\"5\">r 1 fangwen r 2 yu siyue r 3 zongtong jiang r 4 yu siyue lai lundun London in April visit in April The President will {2 \u2192 1} {} {1 \u2192 2} {2 \u2192 3} r 5 zongtong jiang President will {}</td><td>fixed fixed floating left floating right ill-formed</td></tr></table>",
"type_str": "table",
"text": "",
"num": null,
"html": null
},
"TABREF2": {
"content": "<table><tr><td>type</td><td>feature templates</td></tr><tr><td>Unigram c</td><td>W</td></tr><tr><td/><td>1. shift vs. shift;</td></tr><tr><td/><td>2. shift vs. reduce left;</td></tr><tr><td/><td>3. shift vs. reduce right;</td></tr><tr><td/><td>4. reduce left vs. reduce right.</td></tr></table>",
"type_str": "table",
"text": "Fortunately, if we distinguish between left and right floating structures, it is possible to rule out most conflicts.Table 1shows the relationship between conflicts, dependency structures and actions. We use s t and s t\u22121 to denote the top two[The President will visit London][in April] DT NNP MD VB NNP IN IN",
"num": null,
"html": null
},
"TABREF4": {
"content": "<table><tr><td>system</td><td colspan=\"2\">MT02 (tune) BLEU TER</td><td>BLEU</td><td>MT03 TER</td><td>BLEU</td><td>MT04 TER</td><td colspan=\"2\">MT05 BLEU TER</td></tr><tr><td>phrase</td><td>34.88</td><td>57.00</td><td>33.82</td><td>57.19</td><td>35.48</td><td>56.48</td><td>32.52</td><td>57.62</td></tr><tr><td colspan=\"2\">dependency 35.23</td><td>56.12</td><td>34.20</td><td>56.36</td><td>36.01</td><td>55.55</td><td>33.06</td><td>56.94</td></tr><tr><td>this work</td><td>35.71</td><td/><td/><td/><td/><td/><td/><td/></tr></table>",
"type_str": "table",
"text": "* 55.87 * * 34.81 * * + 55.94 * * + 36.37 * * 55.02 * * + 33.53 * * 56.58 * *",
"num": null,
"html": null
},
"TABREF5": {
"content": "<table/>",
"type_str": "table",
"text": "Comparison with Moses",
"num": null,
"html": null
},
"TABREF8": {
"content": "<table><tr><td>: Comparison of well-formed and ill-</td></tr><tr><td>formed structures. Using all rules significantly</td></tr><tr><td>outperforms using only well-formed structures.</td></tr><tr><td>BLEU and TER scores are calculated on the de-</td></tr><tr><td>velopment set.</td></tr></table>",
"type_str": "table",
"text": "",
"num": null,
"html": null
}
}
}
} |