File size: 164,570 Bytes
6fa4bc9 | 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 1662 1663 1664 1665 1666 1667 1668 1669 1670 1671 1672 1673 1674 1675 1676 1677 1678 1679 1680 1681 1682 1683 1684 1685 1686 1687 1688 1689 1690 1691 1692 1693 1694 1695 1696 1697 1698 1699 1700 1701 1702 1703 1704 1705 1706 1707 1708 1709 1710 1711 1712 1713 1714 1715 1716 1717 1718 1719 1720 1721 1722 1723 1724 1725 1726 1727 1728 1729 1730 1731 1732 1733 1734 1735 1736 1737 1738 1739 1740 1741 1742 1743 1744 1745 1746 1747 1748 1749 1750 1751 1752 1753 1754 1755 1756 1757 1758 1759 1760 1761 1762 1763 1764 1765 1766 1767 1768 1769 1770 1771 1772 1773 1774 1775 1776 1777 1778 1779 1780 1781 1782 1783 1784 1785 1786 1787 1788 1789 1790 1791 1792 1793 1794 1795 1796 1797 1798 1799 1800 1801 1802 1803 1804 1805 1806 1807 1808 1809 1810 1811 1812 1813 1814 1815 1816 1817 1818 1819 1820 1821 1822 1823 1824 1825 1826 1827 1828 1829 1830 1831 1832 1833 1834 1835 1836 1837 1838 1839 1840 1841 1842 1843 1844 1845 1846 1847 1848 1849 1850 1851 1852 1853 1854 1855 1856 1857 1858 1859 1860 1861 1862 1863 1864 1865 1866 1867 1868 1869 1870 1871 1872 1873 1874 1875 1876 1877 1878 1879 1880 1881 1882 1883 1884 1885 1886 1887 1888 1889 1890 1891 1892 1893 1894 1895 1896 1897 1898 1899 1900 1901 1902 1903 1904 1905 1906 1907 1908 1909 1910 1911 1912 1913 1914 1915 1916 1917 1918 1919 1920 1921 1922 1923 1924 1925 1926 1927 1928 1929 1930 1931 1932 1933 1934 1935 1936 1937 1938 1939 1940 1941 1942 1943 1944 1945 1946 1947 1948 1949 1950 1951 1952 1953 1954 1955 1956 1957 1958 1959 1960 1961 1962 1963 1964 1965 1966 1967 1968 1969 1970 1971 1972 1973 1974 1975 1976 1977 1978 1979 1980 1981 1982 1983 1984 1985 1986 1987 1988 1989 1990 1991 1992 1993 1994 1995 1996 1997 1998 1999 2000 2001 2002 2003 2004 2005 2006 2007 2008 2009 2010 2011 2012 2013 2014 2015 2016 2017 2018 2019 2020 2021 2022 2023 2024 2025 2026 2027 2028 2029 2030 2031 2032 2033 2034 2035 2036 2037 2038 2039 2040 2041 2042 2043 2044 2045 2046 2047 2048 2049 2050 2051 2052 2053 2054 2055 2056 2057 2058 2059 2060 2061 2062 2063 2064 2065 2066 2067 2068 2069 2070 2071 2072 2073 2074 2075 2076 2077 2078 2079 2080 2081 2082 2083 2084 2085 2086 2087 2088 2089 2090 2091 2092 2093 2094 2095 2096 2097 2098 2099 2100 2101 2102 2103 2104 2105 2106 2107 2108 2109 2110 2111 2112 2113 2114 2115 2116 2117 2118 2119 2120 2121 2122 2123 2124 2125 2126 2127 2128 2129 2130 2131 2132 2133 2134 2135 2136 2137 2138 2139 2140 2141 2142 2143 2144 2145 2146 2147 2148 2149 2150 2151 2152 2153 2154 2155 2156 2157 2158 2159 2160 2161 2162 2163 2164 2165 2166 2167 2168 2169 2170 2171 2172 2173 2174 2175 2176 2177 2178 2179 2180 2181 2182 2183 2184 2185 2186 2187 2188 2189 2190 2191 2192 2193 2194 2195 2196 2197 2198 2199 2200 2201 2202 2203 2204 2205 2206 2207 2208 2209 2210 2211 2212 2213 2214 2215 2216 2217 2218 2219 2220 2221 2222 2223 2224 2225 2226 2227 2228 2229 2230 2231 2232 2233 2234 2235 2236 2237 2238 2239 2240 2241 2242 2243 2244 2245 2246 2247 2248 2249 2250 2251 2252 2253 2254 2255 2256 2257 2258 2259 2260 2261 2262 2263 2264 2265 2266 2267 2268 2269 2270 2271 2272 2273 2274 2275 2276 2277 2278 2279 2280 2281 2282 2283 2284 2285 2286 2287 2288 2289 2290 2291 2292 2293 2294 2295 2296 2297 2298 2299 2300 2301 2302 2303 2304 2305 2306 2307 2308 2309 2310 2311 2312 2313 2314 2315 2316 2317 2318 2319 2320 2321 2322 2323 2324 2325 2326 2327 2328 2329 2330 2331 2332 2333 2334 2335 2336 2337 2338 2339 2340 2341 2342 2343 2344 2345 2346 2347 2348 2349 2350 2351 2352 2353 2354 2355 2356 2357 2358 2359 2360 2361 2362 2363 2364 2365 2366 2367 2368 2369 2370 2371 2372 2373 2374 2375 2376 2377 2378 2379 2380 2381 2382 2383 2384 2385 2386 2387 2388 2389 2390 2391 2392 2393 2394 2395 2396 2397 2398 2399 2400 2401 2402 2403 2404 2405 2406 2407 2408 2409 2410 2411 2412 2413 2414 2415 2416 2417 2418 2419 2420 2421 2422 2423 2424 2425 2426 2427 2428 2429 2430 2431 2432 2433 2434 2435 2436 2437 2438 2439 2440 2441 2442 2443 2444 2445 2446 2447 2448 2449 2450 2451 2452 2453 2454 2455 2456 2457 2458 2459 2460 2461 2462 2463 2464 2465 2466 2467 2468 2469 2470 2471 2472 2473 2474 2475 2476 2477 2478 2479 2480 2481 2482 2483 2484 2485 2486 2487 2488 2489 2490 2491 2492 2493 2494 2495 2496 2497 2498 2499 2500 2501 2502 2503 2504 2505 2506 2507 2508 2509 2510 2511 2512 2513 2514 2515 2516 2517 2518 2519 2520 2521 2522 2523 2524 2525 2526 2527 2528 2529 2530 2531 2532 2533 2534 2535 2536 2537 2538 2539 2540 2541 2542 2543 2544 2545 2546 2547 2548 2549 2550 2551 2552 2553 2554 2555 2556 2557 2558 2559 2560 2561 2562 2563 2564 2565 2566 2567 2568 2569 2570 2571 2572 2573 2574 2575 2576 2577 2578 2579 2580 2581 2582 2583 2584 2585 2586 2587 2588 2589 2590 2591 2592 2593 2594 2595 2596 2597 2598 2599 2600 2601 2602 2603 2604 2605 2606 2607 2608 2609 2610 2611 2612 2613 2614 2615 2616 2617 2618 2619 2620 2621 2622 2623 2624 2625 2626 2627 2628 2629 2630 2631 2632 2633 2634 2635 2636 2637 2638 2639 2640 2641 2642 2643 2644 2645 2646 2647 2648 2649 2650 2651 2652 2653 2654 2655 2656 2657 2658 2659 2660 2661 2662 2663 2664 2665 2666 2667 2668 2669 2670 2671 2672 2673 2674 2675 2676 2677 2678 2679 2680 2681 2682 2683 2684 2685 2686 2687 2688 2689 2690 2691 2692 2693 2694 2695 2696 2697 2698 2699 2700 2701 2702 2703 2704 2705 2706 2707 2708 2709 2710 2711 2712 2713 2714 2715 2716 2717 2718 2719 2720 2721 2722 2723 2724 2725 2726 2727 2728 2729 2730 2731 2732 2733 2734 2735 2736 2737 2738 2739 2740 2741 2742 2743 2744 2745 2746 2747 2748 2749 2750 2751 2752 2753 2754 2755 2756 2757 2758 2759 2760 2761 2762 2763 2764 2765 2766 2767 2768 2769 2770 2771 2772 2773 2774 2775 2776 2777 2778 2779 2780 2781 2782 2783 2784 2785 2786 2787 2788 2789 2790 2791 2792 2793 2794 2795 2796 2797 2798 2799 2800 2801 2802 2803 2804 2805 2806 2807 2808 2809 2810 2811 2812 2813 2814 2815 2816 2817 2818 2819 2820 2821 2822 2823 2824 2825 2826 2827 2828 2829 2830 2831 2832 2833 2834 2835 2836 2837 2838 2839 2840 2841 2842 2843 2844 2845 2846 2847 2848 2849 2850 2851 2852 2853 2854 2855 2856 2857 2858 2859 2860 2861 2862 2863 2864 2865 2866 2867 2868 2869 2870 2871 2872 2873 2874 2875 2876 2877 2878 2879 2880 2881 2882 2883 2884 2885 2886 2887 2888 2889 2890 2891 2892 2893 2894 2895 2896 2897 2898 2899 2900 2901 2902 2903 2904 2905 2906 2907 2908 2909 2910 2911 2912 2913 2914 2915 2916 2917 2918 2919 2920 2921 2922 2923 2924 2925 2926 2927 2928 2929 2930 2931 2932 2933 2934 2935 2936 2937 2938 2939 2940 2941 2942 2943 2944 2945 2946 2947 2948 2949 2950 2951 2952 2953 2954 2955 2956 2957 2958 2959 2960 2961 2962 2963 2964 2965 2966 2967 2968 2969 2970 2971 2972 2973 2974 2975 2976 2977 2978 2979 2980 2981 2982 2983 2984 2985 2986 2987 2988 2989 2990 2991 2992 2993 2994 2995 2996 2997 2998 2999 3000 3001 3002 3003 3004 3005 3006 3007 3008 3009 3010 3011 3012 3013 3014 3015 3016 3017 3018 3019 3020 3021 3022 3023 3024 3025 3026 3027 3028 3029 3030 3031 3032 3033 3034 3035 3036 3037 3038 3039 3040 3041 3042 3043 3044 3045 3046 3047 3048 3049 3050 3051 3052 3053 3054 3055 3056 3057 3058 3059 3060 3061 3062 3063 3064 3065 3066 3067 3068 3069 3070 3071 3072 3073 3074 3075 3076 3077 3078 3079 3080 3081 3082 3083 3084 3085 3086 3087 3088 3089 3090 3091 3092 3093 3094 3095 3096 3097 3098 3099 3100 3101 3102 3103 3104 3105 3106 3107 3108 3109 3110 3111 3112 3113 3114 3115 3116 3117 3118 3119 3120 3121 3122 3123 3124 3125 3126 3127 3128 3129 3130 3131 3132 3133 3134 3135 3136 3137 3138 3139 3140 3141 3142 3143 3144 3145 3146 3147 3148 3149 3150 3151 3152 3153 3154 3155 3156 3157 3158 3159 3160 3161 3162 3163 3164 3165 3166 3167 3168 3169 3170 3171 3172 3173 3174 3175 3176 3177 3178 3179 3180 3181 3182 3183 3184 3185 3186 3187 3188 3189 3190 3191 3192 3193 3194 3195 3196 3197 3198 3199 3200 3201 3202 3203 3204 3205 3206 3207 3208 3209 3210 3211 3212 3213 3214 3215 3216 3217 3218 3219 3220 3221 3222 3223 3224 3225 3226 3227 3228 3229 3230 3231 3232 3233 3234 3235 3236 3237 3238 3239 3240 3241 3242 3243 3244 3245 3246 3247 3248 3249 3250 3251 3252 3253 3254 3255 3256 3257 3258 3259 3260 3261 3262 3263 3264 3265 3266 3267 3268 3269 3270 3271 3272 3273 3274 3275 3276 3277 3278 3279 3280 3281 3282 3283 3284 3285 3286 3287 3288 3289 3290 3291 3292 3293 3294 3295 3296 3297 3298 3299 3300 3301 3302 3303 3304 3305 3306 3307 3308 3309 3310 3311 3312 3313 3314 3315 3316 3317 3318 3319 3320 3321 3322 3323 3324 3325 3326 3327 3328 3329 3330 3331 3332 3333 3334 3335 3336 3337 3338 3339 3340 3341 3342 3343 3344 3345 3346 3347 3348 3349 3350 3351 3352 3353 3354 3355 3356 3357 3358 3359 3360 3361 3362 3363 3364 3365 3366 3367 3368 3369 3370 3371 3372 3373 3374 3375 3376 3377 3378 3379 3380 3381 3382 3383 3384 3385 3386 3387 3388 3389 3390 3391 3392 3393 3394 3395 3396 3397 3398 3399 3400 3401 3402 3403 3404 3405 3406 3407 3408 3409 3410 3411 3412 3413 3414 3415 3416 3417 3418 3419 3420 3421 3422 3423 3424 3425 3426 3427 3428 3429 3430 3431 3432 3433 3434 3435 3436 3437 3438 3439 3440 3441 3442 3443 3444 3445 3446 3447 3448 3449 3450 3451 3452 3453 3454 3455 3456 3457 3458 3459 3460 3461 3462 3463 3464 3465 3466 3467 3468 3469 3470 3471 3472 3473 3474 3475 3476 3477 3478 3479 3480 3481 3482 3483 3484 3485 3486 3487 3488 3489 3490 3491 3492 3493 3494 3495 3496 3497 3498 3499 3500 3501 3502 3503 3504 3505 3506 3507 3508 3509 3510 3511 3512 3513 3514 3515 3516 3517 3518 3519 3520 3521 3522 3523 3524 3525 3526 3527 3528 3529 3530 3531 3532 3533 3534 3535 3536 3537 3538 3539 3540 3541 3542 3543 3544 3545 3546 3547 3548 3549 3550 3551 3552 3553 3554 3555 3556 3557 3558 3559 3560 3561 3562 3563 3564 3565 3566 3567 3568 3569 3570 3571 3572 3573 3574 3575 3576 3577 3578 3579 3580 3581 3582 3583 3584 3585 3586 3587 3588 3589 3590 3591 3592 3593 3594 3595 3596 3597 3598 3599 3600 3601 3602 3603 3604 3605 | {
"paper_id": "2021",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T13:27:28.909240Z"
},
"title": "Capturing document context inside sentence-level neural machine translation models with self-training",
"authors": [
{
"first": "Elman",
"middle": [],
"last": "Mansimov",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "New York University",
"location": {}
},
"email": "mansimov@cs.nyu.edu"
},
{
"first": "G\u00e1bor",
"middle": [],
"last": "Melis",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "New York University",
"location": {}
},
"email": "melisgl@google.com"
},
{
"first": "Lei",
"middle": [],
"last": "Yu",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "New York University",
"location": {}
},
"email": "leiyu@google.com"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Neural machine translation (NMT) has arguably achieved human level parity when trained and evaluated at the sentence-level. Document-level neural machine translation has received less attention and lags behind its sentence-level counterpart. The majority of the proposed document-level approaches investigate ways of conditioning the model on several source or target sentences to capture document context. These approaches require training a specialized NMT model from scratch on parallel document-level corpora. We propose an approach that doesn't require training a specialized model on parallel document-level corpora and is applied to a trained sentence-level NMT model at decoding time. We process the document from left to right multiple times and self-train the sentence-level model on pairs of source sentences and generated translations. Our approach reinforces the choices made by the model, thus making it more likely that the same choices will be made in other sentences in the document. We evaluate our approach on three document-level datasets: NIST Chinese-English, WMT19 Chinese-English and Open-Subtitles English-Russian. We demonstrate that our approach has higher BLEU score and higher human preference than the baseline. Qualitative analysis of our approach shows that choices made by model are consistent across the document.",
"pdf_parse": {
"paper_id": "2021",
"_pdf_hash": "",
"abstract": [
{
"text": "Neural machine translation (NMT) has arguably achieved human level parity when trained and evaluated at the sentence-level. Document-level neural machine translation has received less attention and lags behind its sentence-level counterpart. The majority of the proposed document-level approaches investigate ways of conditioning the model on several source or target sentences to capture document context. These approaches require training a specialized NMT model from scratch on parallel document-level corpora. We propose an approach that doesn't require training a specialized model on parallel document-level corpora and is applied to a trained sentence-level NMT model at decoding time. We process the document from left to right multiple times and self-train the sentence-level model on pairs of source sentences and generated translations. Our approach reinforces the choices made by the model, thus making it more likely that the same choices will be made in other sentences in the document. We evaluate our approach on three document-level datasets: NIST Chinese-English, WMT19 Chinese-English and Open-Subtitles English-Russian. We demonstrate that our approach has higher BLEU score and higher human preference than the baseline. Qualitative analysis of our approach shows that choices made by model are consistent across the document.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Neural machine translation (NMT) Kalchbrenner and Blunsom, 2013; Bahdanau et al., 2014) has achieved great success, arguably reaching the levels of human parity (Hassan et al., 2018) on Chinese to English news translation that led to its popularity and adoption in academia and industry. These models are predominantly trained and evaluated on sentence-level parallel corpora. Document-level machine translation that requires capturing the context to accurately translate sentences has been recently gaining more popularity and was selected as one of the main tasks in the premier machine translation conference WMT19 (Barrault et al., 2019) and WMT20 (Barrault et al., 2020) .",
"cite_spans": [
{
"start": 33,
"end": 64,
"text": "Kalchbrenner and Blunsom, 2013;",
"ref_id": "BIBREF25"
},
{
"start": 65,
"end": 87,
"text": "Bahdanau et al., 2014)",
"ref_id": "BIBREF5"
},
{
"start": 161,
"end": 182,
"text": "(Hassan et al., 2018)",
"ref_id": "BIBREF18"
},
{
"start": 618,
"end": 641,
"text": "(Barrault et al., 2019)",
"ref_id": null
},
{
"start": 652,
"end": 675,
"text": "(Barrault et al., 2020)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "A straightforward solution to translate documents by translating sentences in isolation leads to inconsistent but syntactically valid text. The inconsistency is the result of the model not being able to resolve ambiguity with consistent choices across the document. For example, the recent NMT system that achieved human parity (Hassan et al., 2018) inconsistently used three different names \"Twitter Move Car\", \"WeChat mobile\", \"WeChat move\" when referring to the same entity (Sennrich, 2018) .",
"cite_spans": [
{
"start": 328,
"end": 349,
"text": "(Hassan et al., 2018)",
"ref_id": "BIBREF18"
},
{
"start": 477,
"end": 493,
"text": "(Sennrich, 2018)",
"ref_id": "BIBREF41"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "To tackle this issue, the majority of the previous approaches (Jean et al., 2017; Wang et al., 2017; Kuang et al., 2017; Tiedemann and Scherrer, 2017; Maruf and Haffari, 2018; Agrawal et al., 2018; Xiong et al., 2018; Miculicich et al., 2018; Voita et al., 2019a,b; Jean et al., 2019; Junczys-Dowmunt, 2019) proposed contextconditional NMT models trained on documentlevel data. However, none of the previous approaches are able to exploit trained NMT models on sentence-level parallel corpora and require training specialized context-conditional NMT models for document-level machine translation.",
"cite_spans": [
{
"start": 62,
"end": 81,
"text": "(Jean et al., 2017;",
"ref_id": "BIBREF23"
},
{
"start": 82,
"end": 100,
"text": "Wang et al., 2017;",
"ref_id": "BIBREF53"
},
{
"start": 101,
"end": 120,
"text": "Kuang et al., 2017;",
"ref_id": "BIBREF29"
},
{
"start": 121,
"end": 150,
"text": "Tiedemann and Scherrer, 2017;",
"ref_id": "BIBREF47"
},
{
"start": 151,
"end": 175,
"text": "Maruf and Haffari, 2018;",
"ref_id": "BIBREF32"
},
{
"start": 176,
"end": 197,
"text": "Agrawal et al., 2018;",
"ref_id": "BIBREF0"
},
{
"start": 198,
"end": 217,
"text": "Xiong et al., 2018;",
"ref_id": "BIBREF57"
},
{
"start": 218,
"end": 242,
"text": "Miculicich et al., 2018;",
"ref_id": "BIBREF34"
},
{
"start": 243,
"end": 265,
"text": "Voita et al., 2019a,b;",
"ref_id": null
},
{
"start": 266,
"end": 284,
"text": "Jean et al., 2019;",
"ref_id": "BIBREF22"
},
{
"start": 285,
"end": 307,
"text": "Junczys-Dowmunt, 2019)",
"ref_id": "BIBREF24"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We propose a way of incorporating context into a trained sentence-level neural machine translation model at decoding time. We process each document monotonically from left to right one sentence at a time and self-train the sentence-level NMT model on its own generated translation. This procedure reinforces choices made by the model and hence increases the chance of making the same choices in the remaining sentences in the document. Our approach does not require training a separate context-conditional model on parallel document-Algorithm 1: Document-level NMT with self-training at decoding time Input: Document D = (X 1 , ..., X n ), pretrained sentence-level NMT model f (\u03b8), learning rate \u03b1, decay prior \u03bb and number of passes over document P Output:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Translated sentences (Y 1 , ..., Y n )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Backup original values of parameters\u03b8 \u2190 \u03b8 for p = 1 to P {multi-pass document} do for i = 1 to n do Translate sentence X i using sentence-level model f (\u03b8) into target sentence",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Y i . Calculate cross-entropy loss L(X i , Y i ) using Y i as target. for j = 1 to m do \u03b8 \u2190 \u03b8 \u2212 \u03b1\u2207 \u03b8 L(X i , Y i ) + \u03bb(\u03b8 \u2212 \u03b8)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "end for end for end for level data and allows us to capture context in documents using a trained sentence-level model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We make the key contribution in the paper by introducing the document-level neural machine translation approach that does not require training a context-conditional model on document data and does not require separate document-level language model to rank the outputs of the NMT model according to consistency of translated document. We show how to adapt a trained sentence-level neural machine translation model to capture context in the document during decoding. We evaluate and demonstrate improvements of our proposed approach measured by BLEU score and preferences of human annotators on several document-level machine translation tasks including NIST Chinese-English, WMT19 Chinese-English and OpenSubtitles English-Russian datasets. We qualitatively analyze the decoded sentences produced using our approach and show that they indeed capture the context.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We translate a document D consisting of n source sentences X 1 , X 2 , ..., X n into the target language, given a well-trained sentence-level neural machine translation model f \u03b8 . The sentencelevel model parametrizes a conditional distribution p(Y |X) = T i=1 p(y t |Y <t , X) of each target word y t given the preceding words Y <t and the source sentence X. Decoding is done by approximately finding arg max Y p(Y |X) using greedy decoding or beam-search. f is typically a recurrent neural network with attention (Bahdanau et al., 2014) or a Transformer model (Vaswani et al., 2017) with parameters \u03b8.",
"cite_spans": [
{
"start": 515,
"end": 538,
"text": "(Bahdanau et al., 2014)",
"ref_id": "BIBREF5"
},
{
"start": 562,
"end": 584,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF50"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Proposed Approach",
"sec_num": "2"
},
{
"text": "We start by translating a first source sentence X 1 in the document D into the target sentence Y 1 . We then self-train the model on the sentence pair (X 1 , Y 1 ), which maximizes the log probabilities of each word in the generated sentence Y 1 given source sentence X 1 . The self-training procedure runs gradient descent steps for a fixed number of steps with a weight decay. Weight decay keeps the updated values of weights closer to original values. We repeat the same update process for the remaining sentences in the document. The detailed implementation of self-training procedure during decoding is shown in Algorithm 1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Self-training",
"sec_num": "2.1"
},
{
"text": "Since the document is processed in the left-to-right, monotonic order, our self-training procedure does not incorporate the choices of the model yet to be made on unprocessed sentences. In order to leverage global information from the full document and to further reinforce the choices made by the model across all generated sentences, we propose multipass document decoding with self-training. Specifically, we process the document multiple times monotonically from left to right while continuing self-training of the model. Multi-pass self-training only requires adding additional parameter P to selftraining Algorithm 1. This parameter specifies the number of passes over the entire document.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Multi-pass self-training",
"sec_num": "2.2"
},
{
"text": "Since generated sentences are likely to contain some errors, our self-training procedure can reinforce those errors and thus potentially hurt the performance of the model on unprocessed sentences in the document. In order to isolate the effect of imperfect translations and estimate the upper bound of performance, we evaluate our self-training procedure with ground-truth translations as targets, which we call oracle self-training. Running oracle self-training makes it similar to the dynamic evaluation approach introduced in language modeling (Mikolov, 2012; Graves, 2013; Krause et al., 2018) , where input text to the language model is the target used to train the neural language model during evaluation. Oracle self-training is also related to domain adaptation in machine translation (Axelrod et al., 2011; Freitag and Al-Onaizan, 2016; Chu and Wang, 2018) . Unlike domain adaptation in MT, oracle self-training only runs adaptation within a single document and does not rely on the entire in-domain document-level test data. We do not use the oracle in multi-pass self-training since this would make it equivalent to memorizing the correct translation for each sentence in the document and regenerating it again.",
"cite_spans": [
{
"start": 547,
"end": 562,
"text": "(Mikolov, 2012;",
"ref_id": "BIBREF35"
},
{
"start": 563,
"end": 576,
"text": "Graves, 2013;",
"ref_id": "BIBREF16"
},
{
"start": 577,
"end": 597,
"text": "Krause et al., 2018)",
"ref_id": "BIBREF28"
},
{
"start": 793,
"end": 815,
"text": "(Axelrod et al., 2011;",
"ref_id": "BIBREF2"
},
{
"start": 816,
"end": 845,
"text": "Freitag and Al-Onaizan, 2016;",
"ref_id": "BIBREF12"
},
{
"start": 846,
"end": 865,
"text": "Chu and Wang, 2018)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Oracle self-training to upper bound performance",
"sec_num": "2.3"
},
{
"text": "Although there have been some attempts at tackling document-level neural machine translation (for example see proceedings of discourse in machine translation workshop (Popescu-Belis et al., 2019)), it has largely received less attention compared to sentence-level neural machine translation. Prior document-level NMT approaches (Jean et al., 2017; Wang et al., 2017; Kuang et al., 2017; Tiedemann and Scherrer, 2017; Maruf and Haffari, 2018; Agrawal et al., 2018; Miculicich et al., 2018) proposed different ways of conditioning NMT models on several source sentences in the document. Perhaps closest of those document NMT approaches to our work is the approach by Kuang et al. (2017) , where they train a NMT model with a separate non-parametric cache (Kuhn and Mori, 1990 ) that incorporates topic information about the document. Recent approaches (Jean et al., 2019; Junczys-Dowmunt, 2019; Voita et al., 2019a) use only partially available parallel document data or monolingual document data. These approaches proposed to fill in missing context in the documents with random or generated sentences. Another line of document-level NMT work (Xiong et al., 2018; Voita et al., 2019b) proposed a twopass document decoding model inspired by the deliberation network (Xia et al., 2017) in order to incorporate target side document context. A parallel line of work (Garcia et al., 2017 (Garcia et al., , 2019 Yu et al., 2019) introduced document-level approaches that do not require training the context-conditional NMT model by introducing a separate language model to enforce the consistency in the outputs of sentence-level NMT model. Garcia et al. (2019) used a simple n-gram based semantic space language model (Hardmeier et al., 2012) to re-rank the outputs of the sentence-level NMT model inside the beam-search algorithm to enforce documentlevel consistency. Yu et al. (2019) proposed a novel beam search method that incorporates document context inside noisy channel model (Shannon, 1948; Yee et al., 2019) that uses a powerful GPT2 language model (Radford et al., 2019) . Similar to our work, their approach doesn't require training context-conditional models on parallel document corpora, but relies on separate target-to-source NMT model and unconditional language model to re-rank hypotheses of the sourceto-target NMT model.",
"cite_spans": [
{
"start": 328,
"end": 347,
"text": "(Jean et al., 2017;",
"ref_id": "BIBREF23"
},
{
"start": 348,
"end": 366,
"text": "Wang et al., 2017;",
"ref_id": "BIBREF53"
},
{
"start": 367,
"end": 386,
"text": "Kuang et al., 2017;",
"ref_id": "BIBREF29"
},
{
"start": 387,
"end": 416,
"text": "Tiedemann and Scherrer, 2017;",
"ref_id": "BIBREF47"
},
{
"start": 417,
"end": 441,
"text": "Maruf and Haffari, 2018;",
"ref_id": "BIBREF32"
},
{
"start": 442,
"end": 463,
"text": "Agrawal et al., 2018;",
"ref_id": "BIBREF0"
},
{
"start": 464,
"end": 488,
"text": "Miculicich et al., 2018)",
"ref_id": "BIBREF34"
},
{
"start": 665,
"end": 684,
"text": "Kuang et al. (2017)",
"ref_id": "BIBREF29"
},
{
"start": 753,
"end": 773,
"text": "(Kuhn and Mori, 1990",
"ref_id": "BIBREF30"
},
{
"start": 850,
"end": 869,
"text": "(Jean et al., 2019;",
"ref_id": "BIBREF22"
},
{
"start": 870,
"end": 892,
"text": "Junczys-Dowmunt, 2019;",
"ref_id": "BIBREF24"
},
{
"start": 893,
"end": 913,
"text": "Voita et al., 2019a)",
"ref_id": "BIBREF51"
},
{
"start": 1142,
"end": 1162,
"text": "(Xiong et al., 2018;",
"ref_id": "BIBREF57"
},
{
"start": 1163,
"end": 1183,
"text": "Voita et al., 2019b)",
"ref_id": "BIBREF52"
},
{
"start": 1264,
"end": 1282,
"text": "(Xia et al., 2017)",
"ref_id": "BIBREF56"
},
{
"start": 1361,
"end": 1381,
"text": "(Garcia et al., 2017",
"ref_id": "BIBREF14"
},
{
"start": 1382,
"end": 1404,
"text": "(Garcia et al., , 2019",
"ref_id": "BIBREF13"
},
{
"start": 1405,
"end": 1421,
"text": "Yu et al., 2019)",
"ref_id": "BIBREF60"
},
{
"start": 1634,
"end": 1654,
"text": "Garcia et al. (2019)",
"ref_id": "BIBREF13"
},
{
"start": 1712,
"end": 1736,
"text": "(Hardmeier et al., 2012)",
"ref_id": "BIBREF17"
},
{
"start": 1863,
"end": 1879,
"text": "Yu et al. (2019)",
"ref_id": "BIBREF60"
},
{
"start": 1978,
"end": 1993,
"text": "(Shannon, 1948;",
"ref_id": "BIBREF44"
},
{
"start": 1994,
"end": 2011,
"text": "Yee et al., 2019)",
"ref_id": "BIBREF59"
},
{
"start": 2053,
"end": 2075,
"text": "(Radford et al., 2019)",
"ref_id": "BIBREF38"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "3"
},
{
"text": "Closest to our work is the dynamic evaluation approach proposed by Mikolov (2012) and further extended by Graves (2013) ; Krause et al. (2018) , where a neural language model is trained at evaluation time. However unlike language modeling where inputs are ground-truth targets used both during training and evaluation, in machine translation ground-truth translation are not available at decoding time in practical settings. The general idea of storing memories in the weights of the neural network rather than storing memories as copies of neural network activations, that is behind our approach and dynamic evaluation, goes back to 1970s and 1980s work on associative memory models (Willshaw et al., 1969; Kohonen, 1972; Anderson and Hinton, 1981; Hopfield, 1982) and to more recent work on fast weights (Ba et al., 2016) .",
"cite_spans": [
{
"start": 67,
"end": 81,
"text": "Mikolov (2012)",
"ref_id": "BIBREF35"
},
{
"start": 106,
"end": 119,
"text": "Graves (2013)",
"ref_id": "BIBREF16"
},
{
"start": 122,
"end": 142,
"text": "Krause et al. (2018)",
"ref_id": "BIBREF28"
},
{
"start": 684,
"end": 707,
"text": "(Willshaw et al., 1969;",
"ref_id": "BIBREF54"
},
{
"start": 708,
"end": 722,
"text": "Kohonen, 1972;",
"ref_id": "BIBREF27"
},
{
"start": 723,
"end": 749,
"text": "Anderson and Hinton, 1981;",
"ref_id": "BIBREF1"
},
{
"start": 750,
"end": 765,
"text": "Hopfield, 1982)",
"ref_id": "BIBREF20"
},
{
"start": 806,
"end": 823,
"text": "(Ba et al., 2016)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "3"
},
{
"text": "Our work belongs to the broad category of selftraining or pseudo-labelling approaches (Scudder, 1965; Lee, 2013) proposed to annotate the unlabeled data to train supervised classifiers. Selftraining has been successfully applied to NLP tasks such as word-sense disambiguation (Yarowsky, 1995) and parsing (McClosky et al., 2006; Reichart and Rappoport, 2007; Huang and Harper, 2009) . Self-training has also been used to label monolingual data to improve the performance of sentencelevel statistical and neural machine translation models (Ueffing, 2006; Zhang and Zong, 2016) . Recently, proposed noisy version of self-training and showed improvement over classical self-training on machine translation and text summarization tasks. Backtranslation (Sennrich et al., 2016a) is another popular pseudo-labelling technique that utilizes target-side monolingual data to improve performance of NMT models. Table 1 : Results on NIST evaluation sets. The first four rows show the performance of the previous document-level NMT models from (Wang et al., 2017; Kuang et al., 2017; . The last four rows show performance of our baseline sentence-level Transformer models with and without self-training. BT: backtranslation. Table 2 : Ablation study on NIST evaluation sets measuring the effect on multiple passes of decoding and the oracle on self-training procedure. BT: backtranslation. ST: self-training.",
"cite_spans": [
{
"start": 86,
"end": 101,
"text": "(Scudder, 1965;",
"ref_id": "BIBREF40"
},
{
"start": 102,
"end": 112,
"text": "Lee, 2013)",
"ref_id": "BIBREF31"
},
{
"start": 276,
"end": 292,
"text": "(Yarowsky, 1995)",
"ref_id": "BIBREF58"
},
{
"start": 305,
"end": 328,
"text": "(McClosky et al., 2006;",
"ref_id": "BIBREF33"
},
{
"start": 329,
"end": 358,
"text": "Reichart and Rappoport, 2007;",
"ref_id": "BIBREF39"
},
{
"start": 359,
"end": 382,
"text": "Huang and Harper, 2009)",
"ref_id": "BIBREF21"
},
{
"start": 538,
"end": 553,
"text": "(Ueffing, 2006;",
"ref_id": "BIBREF48"
},
{
"start": 554,
"end": 575,
"text": "Zhang and Zong, 2016)",
"ref_id": "BIBREF63"
},
{
"start": 749,
"end": 773,
"text": "(Sennrich et al., 2016a)",
"ref_id": "BIBREF42"
},
{
"start": 1032,
"end": 1051,
"text": "(Wang et al., 2017;",
"ref_id": "BIBREF53"
},
{
"start": 1052,
"end": 1071,
"text": "Kuang et al., 2017;",
"ref_id": "BIBREF29"
}
],
"ref_spans": [
{
"start": 901,
"end": 908,
"text": "Table 1",
"ref_id": null
},
{
"start": 1213,
"end": 1220,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Related Work",
"sec_num": "3"
},
{
"text": "We use the NIST Chinese-English (Zh-En), the WMT19 Chinese-English (Zh-En) and the Open-Subtitles English-Russian (En-Ru) datasets in our experiments. The NIST training set consists of 1.5M sentence pairs from LDC-distributed news. We use MT06 set as validation set. We use MT03, MT04, MT05 and MT08 sets as held out test sets. The MT06 validation set consists of 1649 sentences with 21 sentences per document. MT03, MT04, MT05 and MT08 consist of 919, 1788, 1082 and 1357 sentences with 9, 9, 11 and 13 sentences on average per document respectively. We follow previous work when preprocessing NIST dataset. We preprocess the NIST dataset with punctuation normalization, tokenization, and lowercasing. Sentences are encoded using byte-pair encoding (Sennrich et al., 2016b) with source and target vocabularies of roughly 32K tokens. We use the case-insensitive multi-bleu.perl script with 4 reference files to evaluate the model. The WMT19 dataset includes the UN corpus, CWMT, and news commentary. We filter the training data by removing duplicate sentences and sen-tences longer than 250 words. The training dataset consits of 18M sentence pairs. We use news-dev2017 as a validation set and use newstest2017, newstest2018 and newstest2019 as held out test sets. newsdev2017, newstest2017, newstest2018 and newstest2019 consist of total of 2002, 2001, 3981 and 2000 sentences with average of 14, 12, 15 and 12 sentences per document respectively. We similarly follow previous work (Xia et al., 2019) when preprocessing the dataset. Chinese sentences are preprocessed by segmenting and normalizing punctuation. English sentences are preprocessed by tokenizing and true casing. We learn a byte-pair encoding (Sennrich et al., 2016b) with source and target vocabularies of roughly 32K tokens. We use sacreBLEU (Post, 2018) for evaluation.",
"cite_spans": [
{
"start": 750,
"end": 774,
"text": "(Sennrich et al., 2016b)",
"ref_id": "BIBREF43"
},
{
"start": 1483,
"end": 1501,
"text": "(Xia et al., 2019)",
"ref_id": "BIBREF55"
},
{
"start": 1708,
"end": 1732,
"text": "(Sennrich et al., 2016b)",
"ref_id": "BIBREF43"
},
{
"start": 1809,
"end": 1821,
"text": "(Post, 2018)",
"ref_id": "BIBREF37"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Datasets",
"sec_num": "4.1"
},
{
"text": "The OpenSubtitles English-Russian dataset, consisting of movie and TV subtitles, was prepared by (Voita et al., 2019b) . 1 The training dataset consists of 6M parallel sentence pairs. We use the context aware sets provided by the authors consisting of 10000 documents both in validation and test sets. Due to the way the dataset is processed, each document only contains 4 sentences. The dataset is preprocessed by tokenizing and lower casing. We use byte-pair encoding (Sennrich et al., 2016b) to prepare source and target vocabularies of roughly 32K tokens. We use multi-bleu.perl script for evaluation.",
"cite_spans": [
{
"start": 97,
"end": 118,
"text": "(Voita et al., 2019b)",
"ref_id": "BIBREF52"
},
{
"start": 121,
"end": 122,
"text": "1",
"ref_id": null
},
{
"start": 470,
"end": 494,
"text": "(Sennrich et al., 2016b)",
"ref_id": "BIBREF43"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Datasets",
"sec_num": "4.1"
},
{
"text": "We train a Transformer (Vaswani et al., 2017) on all datasets. Following previous Voita et al., 2019b; Xia et al., 2019) work we use the Transformer base configuration (transformer_base) on the NIST Zh-En and the OpenSubtitles En-Ru datasets and use the Transformer big configuration (transformer_big) on the WMT19 Zh-En dataset. Transformer base consists of 6 layers, 512 hidden units and 8 attention heads. Transformer big consists of 6 layers, 1024 hidden units and 16 attention heads. We use a dropout rate (Srivastava et al., 2014) of 0.1 and label smoothing to regularize our models. We train our models with the Adam optimizer (Kingma and Ba, 2014) using the same warm-up learning rate schedule as in (Vaswani et al., 2017) . During decoding we use beam search with beam size 4 and length penalty 0.6. We additionally train backtranslated models (Sennrich et al., 2016a) on the NIST Zh-En and the OpenSubtitles En-Ru datasets. We use the publicly available English gigaword dataset (Graff et al., 2003) to create synthetic parallel data for the NIST Zh-En dataset and use synthetic parallel data provided by (Voita et al., 2019a) for the OpenSubtitles En-Ru dataset. When training backtranslated models, we oversample the original parallel data to make the ratio of synthetic data to original data equal to 1 (Edunov et al., 2018) . We tune the number of update steps, learning rate, decay rate, and number of passes over the document of our selftraining approach with a random search on a validation set. We use the range of (5 \u00d7 10 \u22125 , 5 \u00d7 10 \u22121 ) for learning rate, range of (0.001, 0.999) for decay rate, number of update steps (2, 4, 8) and number of passes over the document (2, 4) for random search. We found that best performing models required a small number of update steps (either 2 or 4) with a relatively large learning rate (\u223c 0.005 \u2212 0.01) and small decay rate (\u223c 0.2 \u2212 0.5). We use 3 random seeds to train each model in our experiments and report the average results. We use the Ten-sor2Tensor library (Vaswani et al., 2018) to train baseline models and to implement our method.",
"cite_spans": [
{
"start": 23,
"end": 45,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF50"
},
{
"start": 82,
"end": 102,
"text": "Voita et al., 2019b;",
"ref_id": "BIBREF52"
},
{
"start": 103,
"end": 120,
"text": "Xia et al., 2019)",
"ref_id": "BIBREF55"
},
{
"start": 708,
"end": 730,
"text": "(Vaswani et al., 2017)",
"ref_id": "BIBREF50"
},
{
"start": 853,
"end": 877,
"text": "(Sennrich et al., 2016a)",
"ref_id": "BIBREF42"
},
{
"start": 989,
"end": 1009,
"text": "(Graff et al., 2003)",
"ref_id": "BIBREF15"
},
{
"start": 1115,
"end": 1136,
"text": "(Voita et al., 2019a)",
"ref_id": "BIBREF51"
},
{
"start": 1316,
"end": 1337,
"text": "(Edunov et al., 2018)",
"ref_id": "BIBREF10"
},
{
"start": 2026,
"end": 2048,
"text": "(Vaswani et al., 2018)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Hyperparameters",
"sec_num": "4.2"
},
{
"text": "We present translation quality results measured by BLEU on NIST dataset on Table 1 . The selftraining procedure improves the results of our sentence-level baseline by the average of 0.53 BLEU for non-backtranslated model and by 0.93 BLEU for backtranslated model for all evaluation sets. Our baseline sentence-level Transformer model trained without backtranslation outperforms previous document-level models by Wang et al. (2017) and Kuang et al. (2017) and is comparable to the document-level model proposed by . Backtranslation further improves the results of our sentence-level model leading to higher BLEU score compared to the Document Transformer .",
"cite_spans": [
{
"start": 412,
"end": 430,
"text": "Wang et al. (2017)",
"ref_id": "BIBREF53"
},
{
"start": 435,
"end": 454,
"text": "Kuang et al. (2017)",
"ref_id": "BIBREF29"
}
],
"ref_spans": [
{
"start": 75,
"end": 82,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "5"
},
{
"text": "In Table 2 , we show a detailed study of effects of multi-pass self-training and oracle self-training on BLEU scores on NIST evaluation sets. First, multiple decoding passes over the document give an additional average improvement of 0.25\u22120.45 BLEU points compared to the single decoding pass over the document. Using oracle self-training procedure gives an average of 0.86 and 1.63 BLEU improvement over our non-backtranslated and backtranslated sentence-level baseline models respectively. Compared to using generated translations by the model, oracle self-training gives an improvement of 0.3 and 0.7 BLEU points for non-backtranslated and backtranslated models respectively.",
"cite_spans": [],
"ref_spans": [
{
"start": 3,
"end": 10,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "5"
},
{
"text": "The results on the WMT19 evaluation sets are presented on Table 3 . Compared to the NIST dataset our self-training procedure shows an improvement of 0.1 BLEU over a sentence-level baseline model. Oracle self-training outperforms sentence-level baselines by a significant margin of 2.5 BLEU. We hypothesize that such a large gap between performance of oracle and non-oracle selftraining is due to the more challenging nature of the WMT dataset which is reflected in the worse performance of sentence-level baseline on WMT compared to NIST. We investigate this claim by measuring the relationship between BLEU achieved by self-training and the relative quality of the sentencelevel model on the NIST dataset. Figure 1 shows that the BLEU difference between self-training and sentence-level models monotonically increases as the quality of the sentence-level model gets better on the NIST dataset. This implies that we can expect a larger improvement from applying selftraining as we improve the sentence-level model (Xia et al., 2019) . All models were trained without additional monolingual data and without pretraining. ST: self-training. on the WMT dataset. Preliminary experiments on training back-translated models didn't improve results on the WMT dataset. We leave further investigation of ways to improve the sentence-level model on the WMT dataset for future work. The results on OpenSubtitles evaluation sets are in Table 4 . Our self-training and oracle self-training approaches give the performance improvement of 0.1 and 0.3 BLEU respectively. We hypothesize that the small improvement of self-training is due to relatively small number of sentences in the documents in the OpenSubtitles dataset. We validate this claim by varying the number of sentences in the document used for self-training on NIST dataset. Figure 2 shows that the self-training approach achieves higher BLEU improvement as we increase the number of sentences in documents used for self-training.",
"cite_spans": [
{
"start": 1014,
"end": 1032,
"text": "(Xia et al., 2019)",
"ref_id": "BIBREF55"
}
],
"ref_spans": [
{
"start": 58,
"end": 65,
"text": "Table 3",
"ref_id": "TABREF3"
},
{
"start": 707,
"end": 715,
"text": "Figure 1",
"ref_id": "FIGREF1"
},
{
"start": 1424,
"end": 1431,
"text": "Table 4",
"ref_id": "TABREF5"
},
{
"start": 1822,
"end": 1830,
"text": "Figure 2",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "5"
},
{
"text": "We conduct a human evaluation study on the NIST Zh-En and the OpenSubtitles En-Ru datasets. For both datasets we sample 50 documents from the test set where translated documents generated by the self-training approach are not exact copies of the translated documents generated by the sentencelevel baseline model. For the NIST Zh-En dataset we present reference documents, translated documents generated by the sentence-level baseline, and translated documents generated by self-training approach to 4 native English speakers. For the Open-Subtitles En-Ru dataset we follow a similar setup, where we present reference documents, translated documents generated by sentence-level baseline, and translated documents generated by self-training approach to 4 native Russian speakers. All translated documents are presented in random order with no indication of which approach was used to generate them. We highlight the differences between translated documents when presenting them to human evaluators. The human evaluators are asked to pick one of two translations as their preferred option for each document. We ask the human evaluators to consider fluency, idiomaticity and correctness of the translation relative to the reference when entering their preferred choices.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Human Evaluation",
"sec_num": "6"
},
{
"text": "We follow the setup of Yu et al. (2019) when performing human evaluation. We collect a total of 200 annotations for 50 documents from all 4 human evaluators and show results in Table 5 . For both datasets, human evaluators prefer translated documents generated by the self-training approach to translated documents generated by the sentence-level model. For NIST Zh-En, 122 out of 200 annotations indicate a preference towards translations generated by self-training approach. For OpenSubtitles En-Ru, 118 out of 200 annotations similarly show a preference towards translations generated by our self-training approach. This is a statistically significant preference p < 0.05 according to two-sided Binomial test. When aggregated for each document by majority vote, for NIST Zh-En, translations generated by the selftraining approach are considered better in 25 documents, worse in 12 documents, and the same in 13 documents. For OpenSubtitles En-Ru, translations generated by self-training approach are considered better in 23 documents, worse in 15 documents, and the same in 12 documents. The agreement between annotators for NIST Zh-En and OpenSub- Table 5 : Human evaluation results on the NIST Zh-En and the OpenSubtitles En-Ru datasets. \"Total\" denotes total number of annotations collected from humans. \"Self-train\" denotes number of times evaluators preferred documents by the self-training approach. \"Baseline\" denotes number of times evaluators preferred documents by sentence-level baseline.",
"cite_spans": [
{
"start": 23,
"end": 39,
"text": "Yu et al. (2019)",
"ref_id": "BIBREF60"
}
],
"ref_spans": [
{
"start": 177,
"end": 184,
"text": "Table 5",
"ref_id": null
},
{
"start": 1152,
"end": 1159,
"text": "Table 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Human Evaluation",
"sec_num": "6"
},
{
"text": "titles En-Ru is \u03ba = 0.293 and \u03ba = 0.320 according to Fleiss' kappa (Fleiss, 1971) . For both datasets, the inter-annotator agreement rate is considered fair. The agreement rate is similar to the inter-annotator agreement found in the previous WMT human evaluation studies (Bojar et al., 2014) .",
"cite_spans": [
{
"start": 67,
"end": 81,
"text": "(Fleiss, 1971)",
"ref_id": "BIBREF11"
},
{
"start": 272,
"end": 292,
"text": "(Bojar et al., 2014)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Human Evaluation",
"sec_num": "6"
},
{
"text": "In Table 6 , we show four reference document pairs together with translated documents generated by the baseline sentence-level model and by our selftraining approach. We emphasize the underlined words in all documents.",
"cite_spans": [],
"ref_spans": [
{
"start": 3,
"end": 10,
"text": "Table 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Qualitative Results",
"sec_num": "7"
},
{
"text": "In the first two examples we emphasize the gender of the person marked on verbs and adjectives in translated Russian sentences. In the first example, the baseline sentence-level model inconsistenly produces different gender markings on the underlined verb \u0441\u043a\u0430\u0437\u0430\u043b (masculine told) and underlined adjective \u0441\u0438\u043b\u044c\u043d\u043e\u0439 (feminine strong). The selftraining approach correctly generates a translation with consistent male gender markings on both the underlined verb \u0441\u043a\u0430\u0437\u0430\u043b and the underlined adjective \u0441\u0438\u043b\u044c\u043d\u044b\u043c. Similarly, in the second example, the baseline model inconsistenly produces different gender markings on the underlined verbs \u043f\u0440\u0438\u0433\u043b\u0430\u0448\u0435\u043d\u0430 (feminine invited) and \u043f\u043e\u0440\u0443\u0433\u0430\u043b\u0441\u044f (masculine fought). Self-training consistently generates female gender markings on both the underlined verbs \u043f\u0440\u0438\u0433\u043b\u0430\u0448\u0435\u043d\u0430 (feminine invited) and \u043f\u043e\u0441\u0441\u043e\u0440\u0438\u043b\u0430\u0441\u044c (feminine fought).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Qualitative Results",
"sec_num": "7"
},
{
"text": "In the third example, we emphasize the underlined named entity in reference and generated translations. The baseline sentence-level model inconsistently generates the names \"doyle\" and \"du\" when referring to the same entity across two sentences in the same document. The self-training approach consistently uses the name \"doyle\" across two sentences when referring to the same entity. In the fourth example, we emphasize the plurality of the underlined words. The baseline model inconsistenly generates both singular and plural forms when referring to same noun in consecutive sentences. Self-training generates the noun \"pilots\" in correct plural form in both sentences.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Qualitative Results",
"sec_num": "7"
},
{
"text": "In this paper, we propose a way of incorporating the document context inside a trained sentencelevel neural machine translation model using selftraining. We process documents from left to right multiple times and self-train the sentence-level NMT model on the pair of source sentence and generated target sentence. This reinforces the choices made by the NMT model thus making it more likely that the choices will be repeated in the rest of the document.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "8"
},
{
"text": "We demonstrate the feasibility of our approach on three machine translation datasets: NIST Zh-En, WMT19 Zh-En and OpenSubtitles En-Ru. We show that self-training improves sentence-level Ref we are actively seeking a local partner to set up a joint fund company , \" duchateau said . duchateau said that the chinese market still has ample potentials . Baseline we are actively looking for a local partner to establish a joint venture fund company , \" doyle said .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "8"
},
{
"text": "du said that there is still a lot of room for the chinese market . Ours we are actively looking for a local partner to establish a joint venture fund company , \" doyle said . doyle said that there is still great room for the chinese market .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "8"
},
{
"text": "Ref in may this year , 13 pilots with china eastern airlines wuhan company in succession handed in their resignations , which were rejected by the company . soon afterwards , the pilots applied one after another at the beginning of june to the labor dispute arbitration commission of hubei province for labor arbitration , requesting for a ruling that their labor relationship with china eastern airlines wuhan company be terminated . Baseline in may this year , 13 pilots of china eastern 's wuhan company submitted their resignations one after another , but the company refused . the pilot then applied for labor arbitration with the hubei province labor dispute arbitration committee in early june , requesting the ruling to terminate the labor relationship with the wuhan company of china eastern airlines . Ours in may this year , 13 pilots of china eastern 's wuhan company submitted their resignations one after another , but the company refused . subsequently , in early june , the pilots successively applied for labor arbitration with the hubei province labor dispute arbitration committee , requesting that the labor relationship with china eastern airlines be terminated . Table 6 : Four reference documents together with translations generated by the baseline sentence-level model and by our self-training approach. First two documents are taken from the OpenSubtitles English-Russian and second two documents are taken from the NIST Chinese-English dataset.",
"cite_spans": [],
"ref_spans": [
{
"start": 1185,
"end": 1192,
"text": "Table 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "8"
},
{
"text": "baselines by up to 0.93 BLEU. We also conduct a human evaluation study and show a strong preference of the annotators to the translated documents generated by our self-training approach. Our analysis demonstrates that self-training achieves higher improvement on longer documents and using better sentence-level models.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "8"
},
{
"text": "In this work, we only use self-training on sourceto-target NMT models in order to capture the target side document context. One extension could investigate the application of self-training on both target-to-source and source-to-target sentence-level models to incorporate both source and target document context into generated translations. Overall, we hope that our work would motivate novel approaches of making trained sentence-level models better suited for document translation at decoding time.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "8"
},
{
"text": "https://github.com/lena-voita/ good-translation-wrong-in-context",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We would like to thank Phil Blunsom, Kris Cao, Kyunghyun Cho, Chris Dyer, Wojciech Stokowiec and members of the Language team for helpful suggestions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": "9"
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Contextual handling in neural machine translation: Look behind, ahead and on both sides",
"authors": [
{
"first": "Ruchit",
"middle": [],
"last": "Agrawal",
"suffix": ""
},
{
"first": "Marco",
"middle": [],
"last": "Turchi",
"suffix": ""
},
{
"first": "Matteo",
"middle": [],
"last": "Negri",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ruchit Agrawal, Marco Turchi, and Matteo Negri. 2018. Contextual handling in neural machine trans- lation: Look behind, ahead and on both sides.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Models of information processing in the brain. Parallel models of associative memory",
"authors": [
{
"first": "A",
"middle": [],
"last": "James",
"suffix": ""
},
{
"first": "Geoffrey",
"middle": [
"E"
],
"last": "Anderson",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Hinton",
"suffix": ""
}
],
"year": 1981,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "James A Anderson and Geoffrey E Hinton. 1981. Mod- els of information processing in the brain. Parallel models of associative memory.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Domain adaptation via pseudo in-domain data selection",
"authors": [
{
"first": "A",
"middle": [],
"last": "Axelrod",
"suffix": ""
},
{
"first": "X",
"middle": [],
"last": "He",
"suffix": ""
},
{
"first": "Jianfeng",
"middle": [],
"last": "Gao",
"suffix": ""
}
],
"year": 2011,
"venue": "EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. Axelrod, X. He, and Jianfeng Gao. 2011. Domain adaptation via pseudo in-domain data selection. In EMNLP.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Using fast weights to attend to the recent past",
"authors": [
{
"first": "Joel",
"middle": [
"Z"
],
"last": "Leibo",
"suffix": ""
},
{
"first": "Catalin",
"middle": [],
"last": "Ionescu",
"suffix": ""
}
],
"year": 2016,
"venue": "NIPS",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joel Z. Leibo, and Catalin Ionescu. 2016. Using fast weights to attend to the recent past. In NIPS.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Neural machine translation by jointly learning to align and translate",
"authors": [
{
"first": "Dzmitry",
"middle": [],
"last": "Bahdanau",
"suffix": ""
},
{
"first": "Kyunghyun",
"middle": [],
"last": "Cho",
"suffix": ""
},
{
"first": "Yoshua",
"middle": [],
"last": "Bengio",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1409.0473"
]
},
"num": null,
"urls": [],
"raw_text": "Dzmitry Bahdanau, Kyunghyun Cho, and Yoshua Ben- gio. 2014. Neural machine translation by jointly learning to align and translate. arXiv preprint arXiv:1409.0473.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Proceedings of the Fifth Conference on Machine Translation",
"authors": [
{
"first": "Lo\u00efc",
"middle": [],
"last": "Barrault",
"suffix": ""
},
{
"first": "Magdalena",
"middle": [],
"last": "Biesialska",
"suffix": ""
},
{
"first": "Ond\u0159ej",
"middle": [],
"last": "Bojar",
"suffix": ""
},
{
"first": "Marta",
"middle": [
"R"
],
"last": "Costa-Juss\u00e0",
"suffix": ""
},
{
"first": "Christian",
"middle": [],
"last": "Federmann",
"suffix": ""
},
{
"first": "Yvette",
"middle": [],
"last": "Graham",
"suffix": ""
},
{
"first": "Roman",
"middle": [],
"last": "Grundkiewicz",
"suffix": ""
},
{
"first": "Barry",
"middle": [],
"last": "Haddow",
"suffix": ""
},
{
"first": "Matthias",
"middle": [],
"last": "Huck",
"suffix": ""
},
{
"first": "Eric",
"middle": [],
"last": "Joanis",
"suffix": ""
},
{
"first": "Tom",
"middle": [],
"last": "Kocmi",
"suffix": ""
},
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "Chi-Kiu",
"middle": [],
"last": "Lo",
"suffix": ""
},
{
"first": "Nikola",
"middle": [],
"last": "Ljube\u0161i\u0107",
"suffix": ""
},
{
"first": "Christof",
"middle": [],
"last": "Monz",
"suffix": ""
},
{
"first": "Makoto",
"middle": [],
"last": "Morishita",
"suffix": ""
},
{
"first": "Masaaki",
"middle": [],
"last": "Nagata",
"suffix": ""
},
{
"first": "Toshiaki",
"middle": [],
"last": "Nakazawa",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "1--55",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lo\u00efc Barrault, Magdalena Biesialska, Ond\u0159ej Bojar, Marta R. Costa-juss\u00e0, Christian Federmann, Yvette Graham, Roman Grundkiewicz, Barry Haddow, Matthias Huck, Eric Joanis, Tom Kocmi, Philipp Koehn, Chi-kiu Lo, Nikola Ljube\u0161i\u0107, Christof Monz, Makoto Morishita, Masaaki Nagata, Toshi- aki Nakazawa, Santanu Pal, Matt Post, and Marcos Zampieri. 2020. Findings of the 2020 conference on machine translation (WMT20). In Proceedings of the Fifth Conference on Machine Translation, pages 1-55, Online. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Santanu Pal, Matt Post, and Marcos Zampieri. 2019. Findings of the 2019 conference on machine translation (WMT19). In ACL",
"authors": [
{
"first": "Lo\u00efc",
"middle": [],
"last": "Barrault",
"suffix": ""
},
{
"first": "Ond\u0159ej",
"middle": [],
"last": "Bojar",
"suffix": ""
},
{
"first": "Marta",
"middle": [
"R"
],
"last": "Costa-Juss\u00e0",
"suffix": ""
},
{
"first": "Christian",
"middle": [],
"last": "Federmann",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Fishel",
"suffix": ""
},
{
"first": "Yvette",
"middle": [],
"last": "Graham",
"suffix": ""
},
{
"first": "Barry",
"middle": [],
"last": "Haddow",
"suffix": ""
},
{
"first": "Matthias",
"middle": [],
"last": "Huck",
"suffix": ""
},
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "Shervin",
"middle": [],
"last": "Malmasi",
"suffix": ""
},
{
"first": "Christof",
"middle": [],
"last": "Monz",
"suffix": ""
},
{
"first": "Mathias",
"middle": [],
"last": "M\u00fcller",
"suffix": ""
}
],
"year": null,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lo\u00efc Barrault, Ond\u0159ej Bojar, Marta R. Costa-juss\u00e0, Christian Federmann, Mark Fishel, Yvette Gra- ham, Barry Haddow, Matthias Huck, Philipp Koehn, Shervin Malmasi, Christof Monz, Mathias M\u00fcller, Santanu Pal, Matt Post, and Marcos Zampieri. 2019. Findings of the 2019 conference on machine transla- tion (WMT19). In ACL.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Findings of the 2014 workshop on statistical machine translation",
"authors": [
{
"first": "Ondrej",
"middle": [],
"last": "Bojar",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Buck",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Federmann",
"suffix": ""
},
{
"first": "B",
"middle": [],
"last": "Haddow",
"suffix": ""
},
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "Johannes",
"middle": [],
"last": "Leveling",
"suffix": ""
},
{
"first": "Christof",
"middle": [],
"last": "Monz",
"suffix": ""
},
{
"first": "Pavel",
"middle": [],
"last": "Pecina",
"suffix": ""
},
{
"first": "Matt",
"middle": [],
"last": "Post",
"suffix": ""
},
{
"first": "Herve",
"middle": [],
"last": "Saint-Amand",
"suffix": ""
},
{
"first": "Radu",
"middle": [],
"last": "Soricut",
"suffix": ""
},
{
"first": "Lucia",
"middle": [],
"last": "Specia",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Tamchyna",
"suffix": ""
}
],
"year": 2014,
"venue": "WMT@ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ondrej Bojar, C. Buck, C. Federmann, B. Haddow, Philipp Koehn, Johannes Leveling, Christof Monz, Pavel Pecina, Matt Post, Herve Saint-Amand, Radu Soricut, Lucia Specia, and A. Tamchyna. 2014. Findings of the 2014 workshop on statistical ma- chine translation. In WMT@ACL.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "A survey of domain adaptation for neural machine translation",
"authors": [
{
"first": "Chenhui",
"middle": [],
"last": "Chu",
"suffix": ""
},
{
"first": "Rui",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 27th International Conference on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "1304--1319",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chenhui Chu and Rui Wang. 2018. A survey of do- main adaptation for neural machine translation. In Proceedings of the 27th International Conference on Computational Linguistics, pages 1304-1319, Santa Fe, New Mexico, USA. Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Understanding back-translation at scale",
"authors": [
{
"first": "Sergey",
"middle": [],
"last": "Edunov",
"suffix": ""
},
{
"first": "Myle",
"middle": [],
"last": "Ott",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Auli",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Grangier",
"suffix": ""
}
],
"year": 2018,
"venue": "EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sergey Edunov, Myle Ott, Michael Auli, and David Grangier. 2018. Understanding back-translation at scale. In EMNLP.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Measuring nominal scale agreement among many raters",
"authors": [
{
"first": "Joseph",
"middle": [
"L"
],
"last": "Fleiss",
"suffix": ""
}
],
"year": 1971,
"venue": "Psychological Bulletin",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Joseph L. Fleiss. 1971. Measuring nominal scale agree- ment among many raters. Psychological Bulletin.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Fast domain adaptation for neural machine translation",
"authors": [
{
"first": "Markus",
"middle": [],
"last": "Freitag",
"suffix": ""
},
{
"first": "Y",
"middle": [],
"last": "Al-Onaizan",
"suffix": ""
}
],
"year": 2016,
"venue": "ArXiv",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Markus Freitag and Y. Al-Onaizan. 2016. Fast domain adaptation for neural machine translation. ArXiv, abs/1612.06897.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Context-aware neural machine translation decoding",
"authors": [
{
"first": "Eva Mart\u00ednez",
"middle": [],
"last": "Garcia",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Creus",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Espa\u00f1a-Bonet",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Eva Mart\u00ednez Garcia, C. Creus, and C. Espa\u00f1a-Bonet. 2019. Context-aware neural machine translation de- coding. In DiscoMT@EMNLP.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Using word embeddings to enforce document-level lexical consistency in machine translation",
"authors": [
{
"first": "Eva Mart\u00ednez",
"middle": [],
"last": "Garcia",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Creus",
"suffix": ""
},
{
"first": "C",
"middle": [],
"last": "Espa\u00f1a-Bonet",
"suffix": ""
},
{
"first": "Llu\u00eds",
"middle": [],
"last": "M\u00e0rquez I Villodre",
"suffix": ""
}
],
"year": 2017,
"venue": "The Prague Bulletin of Mathematical Linguistics",
"volume": "108",
"issue": "",
"pages": "85--96",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Eva Mart\u00ednez Garcia, C. Creus, C. Espa\u00f1a-Bonet, and Llu\u00eds M\u00e0rquez i Villodre. 2017. Using word embed- dings to enforce document-level lexical consistency in machine translation. The Prague Bulletin of Math- ematical Linguistics, 108:85 -96.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "English gigaword. Linguistic Data Consortium",
"authors": [
{
"first": "David",
"middle": [],
"last": "Graff",
"suffix": ""
},
{
"first": "Junbo",
"middle": [],
"last": "Kong",
"suffix": ""
},
{
"first": "Ke",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Kazuaki",
"middle": [],
"last": "Maeda",
"suffix": ""
}
],
"year": 2003,
"venue": "",
"volume": "4",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Graff, Junbo Kong, Ke Chen, and Kazuaki Maeda. 2003. English gigaword. Linguistic Data Consortium, Philadelphia, 4(1):34.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Generating sequences with recurrent neural networks",
"authors": [
{
"first": "Alex",
"middle": [],
"last": "Graves",
"suffix": ""
}
],
"year": 2013,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1308.0850"
]
},
"num": null,
"urls": [],
"raw_text": "Alex Graves. 2013. Generating sequences with recurrent neural networks. arXiv preprint arXiv:1308.0850.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "Document-wide decoding for phrase-based statistical machine translation",
"authors": [
{
"first": "Christian",
"middle": [],
"last": "Hardmeier",
"suffix": ""
},
{
"first": "Joakim",
"middle": [],
"last": "Nivre",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Tiedemann",
"suffix": ""
}
],
"year": 2012,
"venue": "EMNLP-CoNLL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Christian Hardmeier, Joakim Nivre, and J. Tiedemann. 2012. Document-wide decoding for phrase-based statistical machine translation. In EMNLP-CoNLL.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Achieving human parity on automatic chinese to english news translation",
"authors": [
{
"first": "Hany",
"middle": [],
"last": "Hassan",
"suffix": ""
},
{
"first": "Anthony",
"middle": [],
"last": "Aue",
"suffix": ""
},
{
"first": "Chang",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Vishal",
"middle": [],
"last": "Chowdhary",
"suffix": ""
},
{
"first": "Jonathan",
"middle": [],
"last": "Clark",
"suffix": ""
},
{
"first": "Christian",
"middle": [],
"last": "Federmann",
"suffix": ""
},
{
"first": "Xuedong",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Marcin",
"middle": [],
"last": "Junczys-Dowmunt",
"suffix": ""
},
{
"first": "William",
"middle": [],
"last": "Lewis",
"suffix": ""
},
{
"first": "Mu",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Shujie",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Tie-Yan",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Renqian",
"middle": [],
"last": "Luo",
"suffix": ""
},
{
"first": "Arul",
"middle": [],
"last": "Menezes",
"suffix": ""
},
{
"first": "Tao",
"middle": [],
"last": "Qin",
"suffix": ""
},
{
"first": "Frank",
"middle": [],
"last": "Seide",
"suffix": ""
},
{
"first": "Xu",
"middle": [],
"last": "Tan",
"suffix": ""
},
{
"first": "Fei",
"middle": [],
"last": "Tian",
"suffix": ""
},
{
"first": "Lijun",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Shuangzhi",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Yingce",
"middle": [],
"last": "Xia",
"suffix": ""
},
{
"first": "Dongdong",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Zhirui",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Ming",
"middle": [],
"last": "Zhou",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1803.05567"
]
},
"num": null,
"urls": [],
"raw_text": "Hany Hassan, Anthony Aue, Chang Chen, Vishal Chowdhary, Jonathan Clark, Christian Feder- mann, Xuedong Huang, Marcin Junczys-Dowmunt, William Lewis, Mu Li, Shujie Liu, Tie-Yan Liu, Renqian Luo, Arul Menezes, Tao Qin, Frank Seide, Xu Tan, Fei Tian, Lijun Wu, Shuangzhi Wu, Yingce Xia, Dongdong Zhang, Zhirui Zhang, and Ming Zhou. 2018. Achieving human parity on automatic chinese to english news translation. arXiv preprint arXiv:1803.05567.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Revisiting self-training for neural sequence generation",
"authors": [
{
"first": "Junxian",
"middle": [],
"last": "He",
"suffix": ""
},
{
"first": "Jiatao",
"middle": [],
"last": "Gu",
"suffix": ""
},
{
"first": "Jiajun",
"middle": [],
"last": "Shen",
"suffix": ""
},
{
"first": "Marc'aurelio",
"middle": [],
"last": "Ranzato",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1909.13788"
]
},
"num": null,
"urls": [],
"raw_text": "Junxian He, Jiatao Gu, Jiajun Shen, and Marc'Aurelio Ranzato. 2019. Revisiting self-training for neural sequence generation. arXiv preprint arXiv:1909.13788.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Neural networks and physical systems with emergent collective computational abilities",
"authors": [
{
"first": "J J",
"middle": [],
"last": "Hopfield",
"suffix": ""
}
],
"year": 1982,
"venue": "Proceedings of the National Academy of Sciences",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J J Hopfield. 1982. Neural networks and physical sys- tems with emergent collective computational abili- ties. Proceedings of the National Academy of Sci- ences.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Selftraining pcfg grammars with latent annotations across languages",
"authors": [
{
"first": "Zhongqiang",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Mary",
"middle": [],
"last": "Harper",
"suffix": ""
}
],
"year": 2009,
"venue": "EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Zhongqiang Huang and Mary Harper. 2009. Self- training pcfg grammars with latent annotations across languages. In EMNLP.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Fill in the blanks: Imputing missing sentences for larger-context neural machine translation",
"authors": [
{
"first": "Sebastien",
"middle": [],
"last": "Jean",
"suffix": ""
},
{
"first": "Ankur",
"middle": [],
"last": "Bapna",
"suffix": ""
},
{
"first": "Orhan",
"middle": [],
"last": "Firat",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1910.14075"
]
},
"num": null,
"urls": [],
"raw_text": "Sebastien Jean, Ankur Bapna, and Orhan Firat. 2019. Fill in the blanks: Imputing missing sentences for larger-context neural machine translation. arXiv preprint arXiv:1910.14075.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Does neural machine translation benefit from larger context? arXiv preprint",
"authors": [
{
"first": "Sebastien",
"middle": [],
"last": "Jean",
"suffix": ""
},
{
"first": "Stanislas",
"middle": [],
"last": "Lauly",
"suffix": ""
},
{
"first": "Orhan",
"middle": [],
"last": "Firat",
"suffix": ""
},
{
"first": "Kyunghyun",
"middle": [],
"last": "Cho",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1704.05135"
]
},
"num": null,
"urls": [],
"raw_text": "Sebastien Jean, Stanislas Lauly, Orhan Firat, and Kyunghyun Cho. 2017. Does neural machine trans- lation benefit from larger context? arXiv preprint arXiv:1704.05135.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Microsoft translator at wmt 2019: Towards large-scale document-level neural machine translation",
"authors": [
{
"first": "Marcin",
"middle": [],
"last": "Junczys-Dowmunt",
"suffix": ""
}
],
"year": 2019,
"venue": "WMT",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Marcin Junczys-Dowmunt. 2019. Microsoft translator at wmt 2019: Towards large-scale document-level neural machine translation. In WMT.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "Recurrent continuous translation models",
"authors": [
{
"first": "Nal",
"middle": [],
"last": "Kalchbrenner",
"suffix": ""
},
{
"first": "Phil",
"middle": [],
"last": "Blunsom",
"suffix": ""
}
],
"year": 2013,
"venue": "EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nal Kalchbrenner and Phil Blunsom. 2013. Recurrent continuous translation models. In EMNLP.",
"links": null
},
"BIBREF26": {
"ref_id": "b26",
"title": "Adam: A method for stochastic optimization",
"authors": [
{
"first": "P",
"middle": [],
"last": "Diederik",
"suffix": ""
},
{
"first": "Jimmy",
"middle": [],
"last": "Kingma",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ba",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1412.6980"
]
},
"num": null,
"urls": [],
"raw_text": "Diederik P Kingma and Jimmy Ba. 2014. Adam: A method for stochastic optimization. arXiv preprint arXiv:1412.6980.",
"links": null
},
"BIBREF27": {
"ref_id": "b27",
"title": "Correlation matrix memories",
"authors": [
{
"first": "Teuvo",
"middle": [],
"last": "Kohonen",
"suffix": ""
}
],
"year": 1972,
"venue": "IEEE Transactions on Computers",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Teuvo Kohonen. 1972. Correlation matrix memories. IEEE Transactions on Computers.",
"links": null
},
"BIBREF28": {
"ref_id": "b28",
"title": "Dynamic evaluation of neural sequence models",
"authors": [
{
"first": "Ben",
"middle": [],
"last": "Krause",
"suffix": ""
},
{
"first": "Emmanuel",
"middle": [],
"last": "Kahembwe",
"suffix": ""
},
{
"first": "Iain",
"middle": [],
"last": "Murray",
"suffix": ""
},
{
"first": "Steve",
"middle": [],
"last": "Renals",
"suffix": ""
}
],
"year": 2018,
"venue": "ICML",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ben Krause, Emmanuel Kahembwe, Iain Murray, and Steve Renals. 2018. Dynamic evaluation of neural sequence models. In ICML.",
"links": null
},
"BIBREF29": {
"ref_id": "b29",
"title": "Modeling coherence for neural machine translation with dynamic and topic caches",
"authors": [
{
"first": "Shaohui",
"middle": [],
"last": "Kuang",
"suffix": ""
},
{
"first": "Deyi",
"middle": [],
"last": "Xiong",
"suffix": ""
},
{
"first": "Weihua",
"middle": [],
"last": "Luo",
"suffix": ""
},
{
"first": "Guodong",
"middle": [],
"last": "Zhou",
"suffix": ""
}
],
"year": 2017,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1711.11221"
]
},
"num": null,
"urls": [],
"raw_text": "Shaohui Kuang, Deyi Xiong, Weihua Luo, and Guodong Zhou. 2017. Modeling coherence for neural machine translation with dynamic and topic caches. arXiv preprint arXiv:1711.11221.",
"links": null
},
"BIBREF30": {
"ref_id": "b30",
"title": "A cachebased natural language model for speech recognition",
"authors": [
{
"first": "Roland",
"middle": [],
"last": "Kuhn",
"suffix": ""
},
{
"first": "Renato",
"middle": [
"De"
],
"last": "Mori",
"suffix": ""
}
],
"year": 1990,
"venue": "PAMI",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Roland Kuhn and Renato De Mori. 1990. A cache- based natural language model for speech recogni- tion. In PAMI.",
"links": null
},
"BIBREF31": {
"ref_id": "b31",
"title": "Pseudo-label : The simple and efficient semi-supervised learning method for deep neural networks",
"authors": [
{
"first": "Dong-Hyun",
"middle": [],
"last": "Lee",
"suffix": ""
}
],
"year": 2013,
"venue": "ICML 2013 Workshop : Challenges in Representation Learning (WREPL)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dong-Hyun Lee. 2013. Pseudo-label : The simple and efficient semi-supervised learning method for deep neural networks. ICML 2013 Workshop : Chal- lenges in Representation Learning (WREPL).",
"links": null
},
"BIBREF32": {
"ref_id": "b32",
"title": "Document context neural machine translation with memory networks",
"authors": [
{
"first": "Sameen",
"middle": [],
"last": "Maruf",
"suffix": ""
},
{
"first": "Gholamreza",
"middle": [],
"last": "Haffari",
"suffix": ""
}
],
"year": 2018,
"venue": "ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sameen Maruf and Gholamreza Haffari. 2018. Docu- ment context neural machine translation with mem- ory networks. In ACL.",
"links": null
},
"BIBREF33": {
"ref_id": "b33",
"title": "Effective self-training for parsing",
"authors": [
{
"first": "David",
"middle": [],
"last": "Mcclosky",
"suffix": ""
},
{
"first": "Eugene",
"middle": [],
"last": "Charniak",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Johnson",
"suffix": ""
}
],
"year": 2006,
"venue": "ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David McClosky, Eugene Charniak, and Mark Johnson. 2006. Effective self-training for parsing. In ACL.",
"links": null
},
"BIBREF34": {
"ref_id": "b34",
"title": "Document-level neural machine translation with hierarchical attention networks",
"authors": [
{
"first": "Lesly",
"middle": [],
"last": "Miculicich",
"suffix": ""
},
{
"first": "Dhananjay",
"middle": [],
"last": "Ram",
"suffix": ""
},
{
"first": "Nikolaos",
"middle": [],
"last": "Pappas",
"suffix": ""
},
{
"first": "James",
"middle": [],
"last": "Henderson",
"suffix": ""
}
],
"year": 2018,
"venue": "EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lesly Miculicich, Dhananjay Ram, Nikolaos Pappas, and James Henderson. 2018. Document-level neural machine translation with hierarchical attention net- works. In EMNLP.",
"links": null
},
"BIBREF35": {
"ref_id": "b35",
"title": "Statistical language models based on neural networks",
"authors": [
{
"first": "Tomas",
"middle": [],
"last": "Mikolov",
"suffix": ""
}
],
"year": 2012,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tomas Mikolov. 2012. Statistical language models based on neural networks. Ph.D. thesis, Brno Uni- versity of Technology.",
"links": null
},
"BIBREF36": {
"ref_id": "b36",
"title": "Proceedings of the Fourth Workshop on Discourse in Machine Translation",
"authors": [
{
"first": "Andrei",
"middle": [],
"last": "Popescu-Belis",
"suffix": ""
},
{
"first": "Sharid",
"middle": [],
"last": "Lo\u00e1iciga",
"suffix": ""
},
{
"first": "Christian",
"middle": [],
"last": "Hardmeier",
"suffix": ""
},
{
"first": "Deyi",
"middle": [],
"last": "Xiong",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Andrei Popescu-Belis, Sharid Lo\u00e1iciga, Christian Hardmeier, and Deyi Xiong. 2019. Proceedings of the Fourth Workshop on Discourse in Machine Translation (DiscoMT 2019). https://www. aclweb.org/anthology/D19-65.pdf.",
"links": null
},
"BIBREF37": {
"ref_id": "b37",
"title": "A call for clarity in reporting BLEU scores",
"authors": [
{
"first": "Matt",
"middle": [],
"last": "Post",
"suffix": ""
}
],
"year": 2018,
"venue": "WMT",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Matt Post. 2018. A call for clarity in reporting BLEU scores. In WMT.",
"links": null
},
"BIBREF38": {
"ref_id": "b38",
"title": "Language models are unsupervised multitask learners",
"authors": [
{
"first": "A",
"middle": [],
"last": "Radford",
"suffix": ""
},
{
"first": "Jeffrey",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Child",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Luan",
"suffix": ""
},
{
"first": "Dario",
"middle": [],
"last": "Amodei",
"suffix": ""
},
{
"first": "Ilya",
"middle": [],
"last": "Sutskever",
"suffix": ""
}
],
"year": 2019,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "A. Radford, Jeffrey Wu, R. Child, David Luan, Dario Amodei, and Ilya Sutskever. 2019. Language mod- els are unsupervised multitask learners.",
"links": null
},
"BIBREF39": {
"ref_id": "b39",
"title": "Self-training for enhancement and domain adaptation of statistical parsers trained on small datasets",
"authors": [
{
"first": "Roi",
"middle": [],
"last": "Reichart",
"suffix": ""
},
{
"first": "Rai",
"middle": [],
"last": "Rappoport",
"suffix": ""
}
],
"year": 2007,
"venue": "ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Roi Reichart and Rai Rappoport. 2007. Self-training for enhancement and domain adaptation of statistical parsers trained on small datasets. In ACL.",
"links": null
},
"BIBREF40": {
"ref_id": "b40",
"title": "Probability of error of some adaptive pattern-recognition machines",
"authors": [
{
"first": "H",
"middle": [],
"last": "Scudder",
"suffix": ""
}
],
"year": 1965,
"venue": "IEEE Trans. Inf. Theor",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "H. Scudder. 1965. Probability of error of some adap- tive pattern-recognition machines. IEEE Trans. Inf. Theor.",
"links": null
},
"BIBREF41": {
"ref_id": "b41",
"title": "Why the Time Is Ripe for Discourse in Machine Translation",
"authors": [
{
"first": "Rico",
"middle": [],
"last": "Sennrich",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rico Sennrich. 2018. Why the Time Is Ripe for Discourse in Machine Translation. http://homepages.inf.ed.ac.uk/ rsennric/wnmt2018.pdf.",
"links": null
},
"BIBREF42": {
"ref_id": "b42",
"title": "Improving neural machine translation models with monolingual data",
"authors": [
{
"first": "Rico",
"middle": [],
"last": "Sennrich",
"suffix": ""
},
{
"first": "Barry",
"middle": [],
"last": "Haddow",
"suffix": ""
},
{
"first": "Alexandra",
"middle": [],
"last": "Birch",
"suffix": ""
}
],
"year": 2016,
"venue": "ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rico Sennrich, Barry Haddow, and Alexandra Birch. 2016a. Improving neural machine translation mod- els with monolingual data. In ACL.",
"links": null
},
"BIBREF43": {
"ref_id": "b43",
"title": "Neural machine translation of rare words with subword units",
"authors": [
{
"first": "Rico",
"middle": [],
"last": "Sennrich",
"suffix": ""
},
{
"first": "Barry",
"middle": [],
"last": "Haddow",
"suffix": ""
},
{
"first": "Alexandra",
"middle": [],
"last": "Birch",
"suffix": ""
}
],
"year": 2016,
"venue": "ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rico Sennrich, Barry Haddow, and Alexandra Birch. 2016b. Neural machine translation of rare words with subword units. In ACL.",
"links": null
},
"BIBREF44": {
"ref_id": "b44",
"title": "A mathematical theory of communication",
"authors": [
{
"first": "Claude",
"middle": [
"E"
],
"last": "Shannon",
"suffix": ""
}
],
"year": 1948,
"venue": "Bell Syst. Tech. J",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Claude E. Shannon. 1948. A mathematical theory of communication. Bell Syst. Tech. J.",
"links": null
},
"BIBREF45": {
"ref_id": "b45",
"title": "Dropout: A simple way to prevent neural networks from overfitting",
"authors": [
{
"first": "Nitish",
"middle": [],
"last": "Srivastava",
"suffix": ""
},
{
"first": "Geoffrey",
"middle": [],
"last": "Hinton",
"suffix": ""
},
{
"first": "Alex",
"middle": [],
"last": "Krizhevsky",
"suffix": ""
},
{
"first": "Ilya",
"middle": [],
"last": "Sutskever",
"suffix": ""
},
{
"first": "Ruslan",
"middle": [],
"last": "Salakhutdinov",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nitish Srivastava, Geoffrey Hinton, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. 2014. Dropout: A simple way to prevent neural networks from overfitting.",
"links": null
},
"BIBREF46": {
"ref_id": "b46",
"title": "Sequence to sequence learning with neural networks",
"authors": [
{
"first": "Ilya",
"middle": [],
"last": "Sutskever",
"suffix": ""
},
{
"first": "Oriol",
"middle": [],
"last": "Vinyals",
"suffix": ""
},
{
"first": "Quoc V",
"middle": [],
"last": "Le",
"suffix": ""
}
],
"year": 2014,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ilya Sutskever, Oriol Vinyals, and Quoc V Le. 2014. Sequence to sequence learning with neural networks. In NIPS.",
"links": null
},
"BIBREF47": {
"ref_id": "b47",
"title": "Neural machine translation with extended context",
"authors": [
{
"first": "J\u00f6rg",
"middle": [],
"last": "Tiedemann",
"suffix": ""
},
{
"first": "Yves",
"middle": [],
"last": "Scherrer",
"suffix": ""
}
],
"year": 2017,
"venue": "Proceedings of the Third Workshop on Discourse in Machine Translation",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J\u00f6rg Tiedemann and Yves Scherrer. 2017. Neural ma- chine translation with extended context. In Proceed- ings of the Third Workshop on Discourse in Machine Translation.",
"links": null
},
"BIBREF48": {
"ref_id": "b48",
"title": "Using monolingual sourcelanguage data to improve mt performance",
"authors": [
{
"first": "Nicola",
"middle": [],
"last": "Ueffing",
"suffix": ""
}
],
"year": 2006,
"venue": "IWSLT",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nicola Ueffing. 2006. Using monolingual source- language data to improve mt performance. In IWSLT.",
"links": null
},
"BIBREF50": {
"ref_id": "b50",
"title": "Attention is all you need",
"authors": [
{
"first": "Ashish",
"middle": [],
"last": "Vaswani",
"suffix": ""
},
{
"first": "Noam",
"middle": [],
"last": "Shazeer",
"suffix": ""
},
{
"first": "Niki",
"middle": [],
"last": "Parmar",
"suffix": ""
},
{
"first": "Jakob",
"middle": [],
"last": "Uszkoreit",
"suffix": ""
},
{
"first": "Llion",
"middle": [],
"last": "Jones",
"suffix": ""
},
{
"first": "Aidan",
"middle": [
"N"
],
"last": "Gomez",
"suffix": ""
},
{
"first": "\u0141ukasz",
"middle": [],
"last": "Kaiser",
"suffix": ""
},
{
"first": "Illia",
"middle": [],
"last": "Polosukhin",
"suffix": ""
}
],
"year": 2017,
"venue": "NIPS",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ashish Vaswani, Noam Shazeer, Niki Parmar, Jakob Uszkoreit, Llion Jones, Aidan N Gomez, \u0141ukasz Kaiser, and Illia Polosukhin. 2017. Attention is all you need. In NIPS.",
"links": null
},
"BIBREF51": {
"ref_id": "b51",
"title": "Context-aware monolingual repair for neural machine translation",
"authors": [
{
"first": "Elena",
"middle": [],
"last": "Voita",
"suffix": ""
},
{
"first": "Rico",
"middle": [],
"last": "Sennrich",
"suffix": ""
},
{
"first": "Ivan",
"middle": [],
"last": "Titov",
"suffix": ""
}
],
"year": 2019,
"venue": "EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Elena Voita, Rico Sennrich, and Ivan Titov. 2019a. Context-aware monolingual repair for neural ma- chine translation. In EMNLP.",
"links": null
},
"BIBREF52": {
"ref_id": "b52",
"title": "When a good translation is wrong in context: Context-aware machine translation improves on deixis, ellipsis, and lexical cohesion",
"authors": [
{
"first": "Elena",
"middle": [],
"last": "Voita",
"suffix": ""
},
{
"first": "Rico",
"middle": [],
"last": "Sennrich",
"suffix": ""
},
{
"first": "Ivan",
"middle": [],
"last": "Titov",
"suffix": ""
}
],
"year": 2019,
"venue": "ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Elena Voita, Rico Sennrich, and Ivan Titov. 2019b. When a good translation is wrong in context: Context-aware machine translation improves on deixis, ellipsis, and lexical cohesion. In ACL.",
"links": null
},
"BIBREF53": {
"ref_id": "b53",
"title": "Exploiting cross-sentence context for neural machine translation",
"authors": [
{
"first": "Longyue",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Zhaopeng",
"middle": [],
"last": "Tu",
"suffix": ""
},
{
"first": "Andy",
"middle": [],
"last": "Way",
"suffix": ""
},
{
"first": "Qun",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2017,
"venue": "EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Longyue Wang, Zhaopeng Tu, Andy Way, and Qun Liu. 2017. Exploiting cross-sentence context for neural machine translation. In EMNLP.",
"links": null
},
"BIBREF54": {
"ref_id": "b54",
"title": "Nonholographic associative memory",
"authors": [
{
"first": "J",
"middle": [],
"last": "David",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Willshaw",
"suffix": ""
},
{
"first": "Hugh",
"middle": [
"Christopher"
],
"last": "Peter Buneman",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Longuet-Higgins",
"suffix": ""
}
],
"year": 1969,
"venue": "Nature",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David J Willshaw, O Peter Buneman, and Hugh Christopher Longuet-Higgins. 1969. Non- holographic associative memory. Nature.",
"links": null
},
"BIBREF55": {
"ref_id": "b55",
"title": "Microsoft research asia's systems for WMT19",
"authors": [
{
"first": "Yingce",
"middle": [],
"last": "Xia",
"suffix": ""
},
{
"first": "Xu",
"middle": [],
"last": "Tan",
"suffix": ""
},
{
"first": "Fei",
"middle": [],
"last": "Tian",
"suffix": ""
},
{
"first": "Fei",
"middle": [],
"last": "Gao",
"suffix": ""
},
{
"first": "Di",
"middle": [],
"last": "He",
"suffix": ""
},
{
"first": "Weicong",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Yang",
"middle": [],
"last": "Fan",
"suffix": ""
},
{
"first": "Linyuan",
"middle": [],
"last": "Gong",
"suffix": ""
},
{
"first": "Yichong",
"middle": [],
"last": "Leng",
"suffix": ""
},
{
"first": "Renqian",
"middle": [],
"last": "Luo",
"suffix": ""
},
{
"first": "Yiren",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Lijun",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Jinhua",
"middle": [],
"last": "Zhu",
"suffix": ""
},
{
"first": "Tao",
"middle": [],
"last": "Qin",
"suffix": ""
},
{
"first": "Tie-Yan",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2019,
"venue": "WMT",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yingce Xia, Xu Tan, Fei Tian, Fei Gao, Di He, Weicong Chen, Yang Fan, Linyuan Gong, Yichong Leng, Ren- qian Luo, Yiren Wang, Lijun Wu, Jinhua Zhu, Tao Qin, and Tie-Yan Liu. 2019. Microsoft research asia's systems for WMT19. In WMT.",
"links": null
},
"BIBREF56": {
"ref_id": "b56",
"title": "Deliberation networks: Sequence generation beyond one-pass decoding",
"authors": [
{
"first": "Yingce",
"middle": [],
"last": "Xia",
"suffix": ""
},
{
"first": "Fei",
"middle": [],
"last": "Tian",
"suffix": ""
},
{
"first": "Lijun",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Jianxin",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "Tao",
"middle": [],
"last": "Qin",
"suffix": ""
},
{
"first": "Nenghai",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "Tie-Yan",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2017,
"venue": "NIPS",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yingce Xia, Fei Tian, Lijun Wu, Jianxin Lin, Tao Qin, Nenghai Yu, and Tie-Yan Liu. 2017. Deliberation networks: Sequence generation beyond one-pass de- coding. In NIPS.",
"links": null
},
"BIBREF57": {
"ref_id": "b57",
"title": "Modeling coherence for discourse neural machine translation",
"authors": [
{
"first": "Hao",
"middle": [],
"last": "Xiong",
"suffix": ""
},
{
"first": "Zhongjun",
"middle": [],
"last": "He",
"suffix": ""
},
{
"first": "Hua",
"middle": [],
"last": "Wu",
"suffix": ""
},
{
"first": "Haifeng",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2018,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {
"arXiv": [
"arXiv:1811.05683"
]
},
"num": null,
"urls": [],
"raw_text": "Hao Xiong, Zhongjun He, Hua Wu, and Haifeng Wang. 2018. Modeling coherence for discourse neural ma- chine translation. arXiv preprint arXiv:1811.05683.",
"links": null
},
"BIBREF58": {
"ref_id": "b58",
"title": "Unsupervised word sense disambiguation rivaling supervised methods",
"authors": [
{
"first": "David",
"middle": [],
"last": "Yarowsky",
"suffix": ""
}
],
"year": 1995,
"venue": "ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Yarowsky. 1995. Unsupervised word sense dis- ambiguation rivaling supervised methods. In ACL.",
"links": null
},
"BIBREF59": {
"ref_id": "b59",
"title": "Simple and effective noisy channel modeling for neural machine translation",
"authors": [
{
"first": "Kyra",
"middle": [],
"last": "Yee",
"suffix": ""
},
{
"first": "Nathan",
"middle": [],
"last": "Ng",
"suffix": ""
},
{
"first": "Yann",
"middle": [
"N"
],
"last": "Dauphin",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Auli",
"suffix": ""
}
],
"year": 2019,
"venue": "EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kyra Yee, Nathan Ng, Yann N. Dauphin, and Michael Auli. 2019. Simple and effective noisy channel mod- eling for neural machine translation. In EMNLP.",
"links": null
},
"BIBREF60": {
"ref_id": "b60",
"title": "Better document-level machine translation with bayes' rule",
"authors": [
{
"first": "L",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "Laurent",
"middle": [],
"last": "Sartran",
"suffix": ""
},
{
"first": "Wojciech",
"middle": [],
"last": "Stokowiec",
"suffix": ""
},
{
"first": "Wang",
"middle": [],
"last": "Ling",
"suffix": ""
},
{
"first": "Lingpeng",
"middle": [],
"last": "Kong",
"suffix": ""
},
{
"first": "P",
"middle": [],
"last": "Blunsom",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Dyer",
"suffix": ""
}
],
"year": 2019,
"venue": "Transactions of the Association for Computational Linguistics",
"volume": "8",
"issue": "",
"pages": "346--360",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "L. Yu, Laurent Sartran, Wojciech Stokowiec, Wang Ling, Lingpeng Kong, P. Blunsom, and Chris Dyer. 2019. Better document-level machine translation with bayes' rule. Transactions of the Association for Computational Linguistics, 8:346-360.",
"links": null
},
"BIBREF61": {
"ref_id": "b61",
"title": "The neural noisy channel",
"authors": [
{
"first": "Lei",
"middle": [],
"last": "Yu",
"suffix": ""
},
{
"first": "Phil",
"middle": [],
"last": "Blunsom",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Dyer",
"suffix": ""
},
{
"first": "Edward",
"middle": [],
"last": "Grefenstette",
"suffix": ""
},
{
"first": "Tomas",
"middle": [],
"last": "Kocisky",
"suffix": ""
}
],
"year": 2017,
"venue": "ICLR",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lei Yu, Phil Blunsom, Chris Dyer, Edward Grefen- stette, and Tomas Kocisky. 2017. The neural noisy channel. In ICLR.",
"links": null
},
"BIBREF62": {
"ref_id": "b62",
"title": "Improving the transformer translation model with document-level context",
"authors": [
{
"first": "Jiacheng",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Huanbo",
"middle": [],
"last": "Luan",
"suffix": ""
},
{
"first": "Maosong",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Feifei",
"middle": [],
"last": "Zhai",
"suffix": ""
},
{
"first": "Jingfang",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Min",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2018,
"venue": "EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jiacheng Zhang, Huanbo Luan, Maosong Sun, Feifei Zhai, Jingfang Xu, Min Zhang, and Yang Liu. 2018. Improving the transformer translation model with document-level context. In EMNLP.",
"links": null
},
"BIBREF63": {
"ref_id": "b63",
"title": "Exploiting source-side monolingual data in neural machine translation",
"authors": [
{
"first": "Jiajun",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Chengqing",
"middle": [],
"last": "Zong",
"suffix": ""
}
],
"year": 2016,
"venue": "EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jiajun Zhang and Chengqing Zong. 2016. Exploit- ing source-side monolingual data in neural machine translation. In EMNLP.",
"links": null
}
},
"ref_entries": {
"FIGREF1": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "Relationship between relative performance of the sentence-level model and BLEU difference of self-training on the NIST dataset."
},
"FIGREF2": {
"num": null,
"uris": null,
"type_str": "figure",
"text": "Relationship between number of sentences and BLEU improvement of self-training on the NIST dataset."
},
"TABREF3": {
"num": null,
"html": null,
"text": "Results on WMT'19 Chinese-English evaluation sets. The first row shows the performance of the Transformer Big model by",
"content": "<table/>",
"type_str": "table"
},
"TABREF5": {
"num": null,
"html": null,
"text": "",
"content": "<table/>",
"type_str": "table"
},
"TABREF6": {
"num": null,
"html": null,
"text": "Ref \u043c\u044b \u0441 \u044d\u0439\u043f\u0440\u0438\u043b \u0440\u0430\u0437\u0432\u0435\u043b\u0438\u0441\u044c . \u043a\u0430\u043a \u044f \u0438 \u0441\u043a\u0430\u0437\u0430\u043b ... \u0438\u0433\u0440\u0430 \u0432 \u043e\u0436\u0438\u0434\u0430\u043d\u0438\u0435 . \u0431\u0443\u0434\u044c \u0441\u0438\u043b\u044c\u043d\u044b\u043c . \u0438 \u0432\u0441\u0451 \u043f\u043e\u043b\u0443\u0447\u0438\u0442\u0441\u044f . Baseline \u043c\u044b \u0441 \u044d\u0439\u043f\u0440\u0438\u043b \u0440\u0430\u0437\u0432\u0435\u043b\u0438\u0441\u044c . \u043d\u0443 , \u043a\u0430\u043a \u044f \u0443\u0436\u0435 \u0441\u043a\u0430\u0437\u0430\u043b ... \u0438\u0433\u0440\u0430 \u043e\u0436\u0438\u0434\u0430\u043d\u0438\u044f . \u0431\u0443\u0434\u044c \u0441\u0438\u043b\u044c\u043d\u043e\u0439 . \u0442\u044b \u0441\u043f\u0440\u0430\u0432\u0438\u0448\u044c\u0441\u044f . Ours \u043c\u044b \u0441 \u044d\u0439\u043f\u0440\u0438\u043b \u0440\u0430\u0437\u0432\u0435\u043b\u0438\u0441\u044c . \u043d\u0443 , \u043a\u0430\u043a \u044f \u0443\u0436\u0435 \u0441\u043a\u0430\u0437\u0430\u043b ... \u0438\u0433\u0440\u0430 \u043e\u0436\u0438\u0434\u0430\u043d\u0438\u044f . \u0431\u0443\u0434\u044c \u0441\u0438\u043b\u044c\u043d\u044b\u043c . \u0442\u044b \u0441\u043f\u0440\u0430\u0432\u0438\u0448\u044c\u0441\u044f . Ref \u0441\u0451\u0440\u0435\u043d \u0443\u0441\u0442\u0440\u0430\u0438\u0432\u0430\u0435\u0442 \u0432\u0435\u0447\u0435\u0440\u0438\u043d\u043a\u0443 \u043f\u043e \u043f\u043e\u0432\u043e\u0434\u0443 \u0441\u0432\u043e\u0435\u0433\u043e \u0434\u043d\u044f \u0440\u043e\u0436\u0434\u0435\u043d\u0438\u044f \u0432 \u0441\u0443\u0431\u0431\u043e\u0442\u0443 , \u0430 \u044f \u043d\u0435 \u0437\u043d\u0430\u044e , \u043f\u043e\u0439\u0434\u0443 \u043b\u0438 \u044f . \u043f\u043e\u0447\u0435\u043c\u0443 \u0431\u044b \u0442\u0435\u0431\u0435 \u043d\u0435 \u043f\u043e\u0439\u0442\u0438 ? \u043f\u0440\u043e\u0441\u0442\u043e \u0432\u0441\u0451 \u043f\u043e\u0448\u043b\u043e \u043d\u0435 \u0442\u0430\u043a . -\u0438 \u044f \u043f\u043e\u0441\u0441\u043e\u0440\u0438\u043b\u0441\u044f \u0441 \u043a\u043d\u0443\u0434\u043e\u043c . Baseline \u0432 \u0441\u0443\u0431\u0431\u043e\u0442\u0443 \u0434\u0435\u043d\u044c \u0440\u043e\u0436\u0434\u0435\u043d\u0438\u044f \u0441\u0451\u0440\u0435\u043d\u0430 \u0438 \u044f \u043d\u0435 \u0437\u043d\u0430\u044e , \u043f\u0440\u0438\u0433\u043b\u0430\u0448\u0435\u043d\u0430 \u043b\u0438 \u044f . \u043f\u043e\u0447\u0435\u043c\u0443 \u0442\u0435\u0431\u044f \u043d\u0435 \u043f\u0440\u0438\u0433\u043b\u0430\u0441\u0438\u043b\u0438 ? \u0432\u0441\u0435 \u043f\u0440\u043e\u0441\u0442\u043e \u043f\u043e\u0448\u043b\u043e \u043d\u0435 \u0442\u0430\u043a . -\u0438 \u044f \u043f\u043e\u0440\u0443\u0433\u0430\u043b\u0441\u044f \u0441 \u043a\u043d\u0443\u0434\u043e\u043c .",
"content": "<table><tr><td>Ours</td><td>\u0432 \u0441\u0443\u0431\u0431\u043e\u0442\u0443 \u0434\u0435\u043d\u044c \u0440\u043e\u0436\u0434\u0435\u043d\u0438\u044f \u0441\u0451\u0440\u0435\u043d\u0430 \u0438 \u044f \u043d\u0435 \u0437\u043d\u0430\u044e , \u043f\u0440\u0438\u0433\u043b\u0430\u0448\u0435\u043d\u0430 \u043b\u0438 \u044f .</td></tr><tr><td/><td>\u043f\u043e\u0447\u0435\u043c\u0443 \u0442\u0435\u0431\u044f \u043d\u0435 \u043f\u0440\u0438\u0433\u043b\u0430\u0441\u0438\u043b\u0438 ? \u0432\u0441\u0435 \u043f\u0440\u043e\u0441\u0442\u043e \u043f\u043e\u0448\u043b\u043e \u043d\u0435 \u0442\u0430\u043a . -\u0438 \u044f \u043f\u043e\u0441\u0441\u043e\u0440\u0438\u043b\u0430\u0441\u044c \u0441 \u043a\u043d\u0443\u0434\u043e\u043c .</td></tr></table>",
"type_str": "table"
}
}
}
} |