File size: 111,767 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 | {
"paper_id": "D13-1048",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T16:41:58.264463Z"
},
"title": "Anchor Graph: Global Reordering Contexts for Statistical Machine Translation",
"authors": [
{
"first": "Hendra",
"middle": [],
"last": "Setiawan",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Bowen",
"middle": [],
"last": "Zhou",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Bing",
"middle": [],
"last": "Xiang",
"suffix": "",
"affiliation": {},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "Reordering poses one of the greatest challenges in Statistical Machine Translation research as the key contextual information may well be beyond the confine of translation units. We present the \"Anchor Graph\" (AG) model where we use a graph structure to model global contextual information that is crucial for reordering. The key ingredient of our AG model is the edges that capture the relationship between the reordering around a set of selected translation units, which we refer to as anchors. As the edges link anchors that may span multiple translation units at decoding time, our AG model effectively encodes global contextual information that is previously absent. We integrate our proposed model into a state-of-the-art translation system and demonstrate the efficacy of our proposal in a largescale Chinese-to-English translation task. * This work was done when the authors were with IBM. 1 We define translation units as phrases in phrase-based SMT or as translation rules in syntax-based SMT.",
"pdf_parse": {
"paper_id": "D13-1048",
"_pdf_hash": "",
"abstract": [
{
"text": "Reordering poses one of the greatest challenges in Statistical Machine Translation research as the key contextual information may well be beyond the confine of translation units. We present the \"Anchor Graph\" (AG) model where we use a graph structure to model global contextual information that is crucial for reordering. The key ingredient of our AG model is the edges that capture the relationship between the reordering around a set of selected translation units, which we refer to as anchors. As the edges link anchors that may span multiple translation units at decoding time, our AG model effectively encodes global contextual information that is previously absent. We integrate our proposed model into a state-of-the-art translation system and demonstrate the efficacy of our proposal in a largescale Chinese-to-English translation task. * This work was done when the authors were with IBM. 1 We define translation units as phrases in phrase-based SMT or as translation rules in syntax-based SMT.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Reordering remains one of the greatest challenges in Statistical Machine Translation (SMT) research as the key contextual information may span across multiple translation units. 1 Unfortunately, previous approaches fall short in capturing such cross-unit contextual information that could be critical in reordering. For example, state-of-the-art translation models, such as Hiero (Chiang, 2005) or Moses (Koehn et al., 2007) , are good at capturing local reordering within the confine of a translation unit, but their formulation is approximately a simple unigram model over derivation (a sequence of the application of translation units) with some aid from target language models. Moving to a higher order formulation (say to a bigram model) is highly impractical for several reasons: 1) it has to deal with a severe sparsity issue as the size of the unigram model is already huge; and 2) it has to deal with a spurious ambiguity issue which allows multiple derivations of a sentence pair to have radically different model scores.",
"cite_spans": [
{
"start": 178,
"end": 179,
"text": "1",
"ref_id": null
},
{
"start": 380,
"end": 394,
"text": "(Chiang, 2005)",
"ref_id": "BIBREF6"
},
{
"start": 404,
"end": 424,
"text": "(Koehn et al., 2007)",
"ref_id": "BIBREF12"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper, we develop \"Anchor Graph\" (AG) where we use a graph structure to capture global contexts that are crucial for translation. To circumvent the sparsity issue, we design our model to rely only on contexts from a set of selected translation units, particularly those that appear frequently with important reordering patterns. We refer to the units in this special set as anchors where they act as vertices in the graph. To address the spurious ambiguity issue, we insist on computing the model score for every anchors in the derivation, including those that appear inside larger translation units, as such our AG model gives the same score to the derivations that share the same reordering pattern.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In AG model, the actual reordering is modeled by the edges, or more specifically, by the edges' labels where different reordering around the anchors would correspond to a different label. As detailed later, we consider two distinct set of labels, namely dominance and precedence, reflecting the two dominant views about reordering in literature, i.e. the first one that views reordering as a linear operation over a sequence and the second one that views reordering as a recursive operation over nodes in a tree structure The former is prevalent in phrase-based context, while the latter in hierarchical phrase-based and syntax-based context. More concretely, the dominance looks at the anchors' relative positions in the translated sentence, while the precedence looks at the anchors' relative positions in a latent structure, induced via a novel synchronous grammar: Anchorcentric, Lexicalized Synchronous Grammar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "From these two sets of labels, we develop two probabilistic models, namely the dominance and the orientation models. As the edges of AG link pairs of anchors that may appear in multiple translation units, our AG models are able to capture high order contextual information that is previously absent. Furthermore, the parameters of these models are estimated in an unsupervised manner without linguistic supervision. More importantly, our experimental results demonstrate the efficacy of our proposed AGbased models, which we integrate into a state-of-theart syntax-based translation system, in a large scale Chinese-to-English translation task. We would like to emphasize that although we use a syntax-based translation system in our experiments, in principle, our approach is applicable to other translation models as it is agnostic to the translation units.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Formally, an AG consists of {A, L} where A is a set of vertices that correspond to anchors, while L is a set of labeled edges that link a pair of anchors. In principle, our AG model is part of a translation model that focuses on the reordering within the source sentence F and its translation E. Thus, we start by first introducing A into a translation model (either word-based, phrase-based or syntax-based model) followed by L. Given an F , A is essentially a subset of non-overlapping (word or phrase) units that make up F . As the information related to A is not observed, we introduce A as a latent variable.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor Graph Model",
"sec_num": "2"
},
{
"text": "Let P (E, \u223c |F ) be a translation model where \u223c corresponds to the alignments between units in F and E. 2 We introduce A into a translation model, 2 Alignment (\u223c) represents an existing latent variable. Depending on the translation units, it can be defined at different level, i.e. word, phrase or hierarchical phrase. As during translation, we are interested in the anchors that appear inside larger translation units, we set \u223c at word level, which information can be induced for (hierarchical) phrase units by either keeping the word alignment from the training data inside the units or inferring it via lexical translation probability. We use the former.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor Graph Model",
"sec_num": "2"
},
{
"text": "as follow:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor Graph Model",
"sec_num": "2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "P (E, \u223c |F ) = \u2200A P (E, \u223c, A |F ) (1) P (E, \u223c, A |F ) = P (E, \u223c |A , F )P (A )",
"eq_num": "(2)"
}
],
"section": "Anchor Graph Model",
"sec_num": "2"
},
{
"text": "As there can be many possible subsets of F and summing over all possible A is intractable, we make the following approximation for P (A ) such that we only need to consider one particular A * : P (A ) = \u03b4(A = A * ) which returns 1 only for A * , otherwise 0. The exact definition of the heuristic will be described in Section 7, but in short, we equate A * with units that appear frequently with important reordering patterns in training data. Given an A * , we then introduce the edges of AG (L) into the equation as follow:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor Graph Model",
"sec_num": "2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "P (E, \u223c |A * , F ) = P (E, \u223c, L|A * , F )",
"eq_num": "(3)"
}
],
"section": "Anchor Graph Model",
"sec_num": "2"
},
{
"text": "Note that L is also a latent variable but its values are derived deterministically from (F, E, \u223c) and A * , thus no extra summation is present in Eq. 3. Then, we further simplify Eq. 3 by factorizing it with respect to each individual edges, as follow:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor Graph Model",
"sec_num": "2"
},
{
"text": "P (E, \u223c, L|A * , F ) \u2248 \u2200am,an\u2208A * m<n P (L m,n |a m , a n ) (4)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor Graph Model",
"sec_num": "2"
},
{
"text": "where L m,n \u2208 L corresponds to the label of an edge that links a m and a n . In principle, L m,n can take any arbitrary value. For addressing the reordering challenge, it should ideally correspond to some aspect of the reordering around a m and a n , for example, how the reordering around a m affects the reordering around a n . As mentioned earlier, we choose to associate L m,n with the dominance and the precedence relations between a m and a n , where the former looks at the relative positions of the two anchors when they are projected into a latent tree structure, while the latter looks at their relative positions when they are projected into the target sentence. We illustrate the two in Fig. 1 .",
"cite_spans": [],
"ref_spans": [
{
"start": 699,
"end": 705,
"text": "Fig. 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Anchor Graph Model",
"sec_num": "2"
},
{
"text": "Furthermore, we assume that dominance and precedence are independent and develop one model for each, resulting in the dominance and the orientation models, which we describe in Section 3 and 4 respectively. To make the model more compact, we introduce an additional parameter O that restricts the maximum order of AG as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor Graph Model",
"sec_num": "2"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "\u2248 O o=1 |A * |+o\u22121 i=0 P o (L i\u2212o,i |a i\u2212o , a i )",
"eq_num": "(5)"
}
],
"section": "Anchor Graph Model",
"sec_num": "2"
},
{
"text": "Thus, we only consider edges that link two anchors that are at most O \u2212 1 anchors apart. For O = 1, the AG model only considers relations between neighboring anchors. Following the standard practice in the n-gram language modeling, we append O number of pseudo anchors at the beginning and at the end of F , which represent the sentence delimiter markers. We do so in a monotone order. The illustration of the dominance and the precedence relations. The former looks at the anchors' projection on a derivation structure. The latter looks at the anchors' projection on the translated sentence.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor Graph Model",
"sec_num": "2"
},
{
"text": "This section describes our dominance model where we equate L m,n in Eq. 4 with dom(a m , a n ) that expresses to the dominance relation between a m and a n in a latent tree structure. Due to reordering, anchors can only appear in specific nodes. We first describe a novel formalism of Anchor-centric, Lexicalized Synchronous Grammar (AL-SG), used to induce the tree structure and then discuss the probabilistic formulation of the model. Just to be clear, we introduce AL-SG mainly to facilitate the computation of dom(a m , a n ). The actual translation model at decoding time remains either phrase-based, hierarchical phrase-based or syntax-based model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Dominance Model",
"sec_num": "3"
},
{
"text": "Given (F, E, \u223c) and A, Anchor-centric, Lexicalized Synchronous Grammar (AL-SG) produces a tree structure where the nodes are decorated with anchors-related information. As the name alludes, the core of AL-SG is anchor-centric constituents (ACC), which corresponds to nodes, composed from merging anchors with by either their left, their right neighboring constituents or both. More concretely, first of all, we consider a span on the source sentence F to be a constituent if it is consistent with the alignment (\u223c). Second of all, we can construct a larger constituent by merging smaller constituents given that the larger constituent is also consistent with the alignment. These two constraints are similar to the heuristic applied to extract hierarchical phrases (Chiang, 2005) .",
"cite_spans": [
{
"start": 765,
"end": 779,
"text": "(Chiang, 2005)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor-centric, Lexicalized Synchronous Grammar",
"sec_num": "3.1"
},
{
"text": "Then, specific to AL-SG, we consider an anchor a to lexicalize a constituent c, if: a) we can compose c from at most three smaller constituents: c L , a and c R where a is the anchor while c L ,c R are the (possibly empty) constituents immediately to the left and to the right of a; and b) we can create smaller anchorscentric constituents from concatenating a with c L and a with c R . If a can lexicalize c, then the node associated with c would be marked with a. In computing dom(a m , a n ), we look at the constituents that cover both anchors and check whether the anchors can lexicalized any of such constituents.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor-centric, Lexicalized Synchronous Grammar",
"sec_num": "3.1"
},
{
"text": "Now, we will describe AL-SG in a formal way. For simplicity, we use a simple grammar, called Inversion Transduction Grammar (ITG) (Wu, 1997) , although in practice, we handle a more powerful synchronous grammar. Hence, we proceed to describe Anchor-centric, Lexicalized ITG (AL-ITG).",
"cite_spans": [
{
"start": 130,
"end": 140,
"text": "(Wu, 1997)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor-centric, Lexicalized Synchronous Grammar",
"sec_num": "3.1"
},
{
"text": "An AL-ITG is a quadruple {\u03a3, A, V, R} where:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor-centric, Lexicalized Synchronous Grammar",
"sec_num": "3.1"
},
{
"text": "\u2022 \u03a3 = {(f /e)} is a set of terminal symbols, which represents all possible units defined over (F, E, \u223c) where each pair corresponds to a link in \u223c. We define \u223c at the most fine-grained level (i.e. word-level), as we insist on computing model score for each anchors even if they appear inside larger units. \u2022 A \u2208 \u03a3 is a set of anchors, which is a subset of the terminal symbols.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor-centric, Lexicalized Synchronous Grammar",
"sec_num": "3.1"
},
{
"text": "\u2022 V = {{P, X, Y } \u00d7 {A, \u2205}}",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor-centric, Lexicalized Synchronous Grammar",
"sec_num": "3.1"
},
{
"text": "is a set of (possibly lexicalized) nonterminal symbols. P represents the terminal symbols (\u03a3); while X and Y correspond to the spans that are created from merging two adjacent constituents. On the tar- get side, for X, the order of the two children follows the source order, while for Y , the order follows the inverse. Nonterminal symbols can be lexicalized with zero or more than one anchor. We represent a lexicalized constituent as a nonterminal symbol followed by a bracket which contains the lexicalizing anchors, e.g. P (H) where H is the anchors lexicalizing P . \u2022 R is a set of production rules which can be classified into the following categories: -Preterminal rules. We propagate the symbol if it corresponds to an anchor.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor-centric, Lexicalized Synchronous Grammar",
"sec_num": "3.1"
},
{
"text": "P (H = f /e) \u2192 f /e, if f /e \u2208 A * P (H = \u2205) \u2192 f /e, otherwise -Monotone production rules, which reorder the children in monotone order, denoted by square brackets (\"[\",\"]\").",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor-centric, Lexicalized Synchronous Grammar",
"sec_num": "3.1"
},
{
"text": "X(H 1 \u222a H 2 ) \u2192 [P (H 1 )P (H 2 )] X(H 1 \u222a H 2 ) \u2192 [X(H 1 )P (H 2 )] X(H 1 \u222a H 2 ) \u2192 [X(H 1 )X(H 2 )] X(H 1 ) \u2192 [X(H 1 )Y (H 2 )] X(H 2 ) \u2192 [Y (H 1 )P (H 2 )] X(H 2 ) \u2192 [Y (H 1 )X(H 2 )] X(\u2205) \u2192 [Y (H 1 )Y (H 2 )]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor-centric, Lexicalized Synchronous Grammar",
"sec_num": "3.1"
},
{
"text": "-Inverse production rules, which reorder the children in the inverse order, denoted by angle brackets (\" \",\" \").",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor-centric, Lexicalized Synchronous Grammar",
"sec_num": "3.1"
},
{
"text": "Y (H 1 \u222a H 2 ) \u2192 P (H 1 )P (H 2 ) Y (H 1 \u222a H 2 ) \u2192 Y (H 1 )P (H 2 ) Y (H 1 \u222a H 2 ) \u2192 Y (H 1 )Y (H 2 ) Y (H 1 ) \u2192 Y (H 1 )X(H 2 ) Y (H 2 ) \u2192 X(H 1 )P (H 2 ) Y (H 2 ) \u2192 X(H 1 )Y (H 2 ) Y (\u2205) \u2192 X(H 1 )X(H 2 )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Anchor-centric, Lexicalized Synchronous Grammar",
"sec_num": "3.1"
},
{
"text": "Like ITG, AL-ITG only permits two kind of reordering operations, namely monotone and inverse. To accommodate the lexicalization, we first assign a unique nonterminal symbol for each, i.e. X for monotone reordering and Y for inverse reordering. Then, we lexicalize Xs and Y s with anchors as long as they satisfy the constraint that the child shares the same label as the parent. This constraint guarantees that the constituents are valid ACCs. It also enables the anchors to lexicalize long constituents, although the terminal symbols are defined at word-level. Fig. 2 illustrates an example Chinese-to-English translation with a AL-ITG derivation when the grammar is applied in a left-to-right fashion. Admittedly, AL-ITG (or more generally AL-SG) is susceptible to spurious ambiguity as it produces multiple derivation trees for a given (F, E, \u223c). Fortunately, the value of dom(a m , a n ) is identical for all derivations, since the computation of dom(a m , a n ) relies only on whether a m and a n can lexicalize at least one constituent that covers both anchors. Hence, we only need to look at one derivation to compute dom(a m , a n ). Generalizing AL-ITG to a more powerful formalism is trivial; we just need to forbid the propagation for non-binarizeable production rules.",
"cite_spans": [],
"ref_spans": [
{
"start": 562,
"end": 568,
"text": "Fig. 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Anchor-centric, Lexicalized Synchronous Grammar",
"sec_num": "3.1"
},
{
"text": "We read-off the dominance relations dom(a m , a n ) from D obtained from the application of AL-SG to (F, E, \u223c). As lexicalization is a bottom-up process, for reading-off dom(a m , a n ), it is sufficient to look at the lowest common ancestor (LCA) of both anchors; if the anchors cannot lexicalize the LCA, they won't be able to lexicalize the constituents larger than LCA. To be more concrete, let's consider the D in Fig. 2 . In that D, the LCA of a m = yu 3 /with 10 and a n = de 7 /that 7 is Y 5 (7). Then, we check the anchors that can lexicalize the LCA. Let V (H) be the LCA, then dom(a m , a n ) \u2208",
"cite_spans": [],
"ref_spans": [
{
"start": 419,
"end": 425,
"text": "Fig. 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Probabilistic Model",
"sec_num": "3.2"
},
{
"text": "(LH) , if a m \u2208 H \u2227 a n \u2208 H (RH) , if a m \u2208 H \u2227 a n \u2208 H (BL) , if a m \u2208 H \u2227 a n \u2208 H (BD) , if a m \u2208 H \u2227 a n \u2208 H",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Probabilistic Model",
"sec_num": "3.2"
},
{
"text": "The value refers to cases where a m and a n can lexicalize V (H) and it is useful to model spans that share a simple, uniform reordering, i.e. allmonotone or all-inverse, while the value refers to the cases where a m and a n cannot lexicalize V (H) and it is useful to model spans that involve in a complex reordering. Meanwhile, the and refer to cases where only one anchor can lexicalize V (H), i.e. a m and a n respectively. These values are useful for modeling cases where the surroundings of the two anchors exhibit different kind of reordering pattern.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Probabilistic Model",
"sec_num": "3.2"
},
{
"text": "With such definition, the edge labels L in Fig. 2 are indicated in Table 1 . Note that in Table 1 , we don't specify the relations involving pseudo anchors, although they are crucial.",
"cite_spans": [],
"ref_spans": [
{
"start": 43,
"end": 49,
"text": "Fig. 2",
"ref_id": "FIGREF1"
},
{
"start": 67,
"end": 74,
"text": "Table 1",
"ref_id": null
},
{
"start": 90,
"end": 97,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Probabilistic Model",
"sec_num": "3.2"
},
{
"text": "The final probabilistic formulation of the dominance model is as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Probabilistic Model",
"sec_num": "3.2"
},
{
"text": "\u2248 O o=1 |A|+o\u22121 i=0 P domo (dom(a i\u2212o , a i )|a i\u2212o , a i ) (6)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Probabilistic Model",
"sec_num": "3.2"
},
{
"text": "As shown, we allocate a separate model P domo for each separate order (o) where each P domo will con-",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Probabilistic Model",
"sec_num": "3.2"
},
{
"text": "H H H H H n m 1 2 3 4 5 1 = (shi 2 /is 2 ) - - - - - 2 = (yu 3 /with 10 ) LH - - - - 3 = (you 5 /have 8 ) LH BD - - - 4 = (de 7 /that 7 )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Probabilistic Model",
"sec_num": "3.2"
},
{
"text": "LH RH RH --5 = (zhi 10 /of 4 ) LH RH RH BL - Table 1 : The dominance relations between pairs of anchors according to the derivation in Fig. 2 .",
"cite_spans": [],
"ref_spans": [
{
"start": 45,
"end": 52,
"text": "Table 1",
"ref_id": null
},
{
"start": 135,
"end": 141,
"text": "Fig. 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Probabilistic Model",
"sec_num": "3.2"
},
{
"text": "tribute as one additional feature in the log-linear model of the translation model. In allocating a separate model for each o, we conjecture that different pair of anchors contributes differently depending on how far the two anchors are.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Probabilistic Model",
"sec_num": "3.2"
},
{
"text": "In this section, we introduce the orientation model (ori) where we equate L m,n with the precedence relations between a pair of anchors. Instead of directly modeling the precedence between the two anchors, we approximate it by modeling the precedence of each anchor with its neighboring constituents. Formally, we approximate P (L m,n |a m , a n ) as",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orientation Model",
"sec_num": "4"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "P ori R (ori(a m , M R (a m ))|a m ) \u00d7 P ori L (ori(a n , M L (a n ))|a n )",
"eq_num": "(7)"
}
],
"section": "Orientation Model",
"sec_num": "4"
},
{
"text": "where M R (a m ) is the largest constituent to the right of the first anchor a m , M L (a n ) the largest constituent to the left of the second anchor a n , and ori() a function that maps the anchor and the neighboring constituent to a particular orientation. Plugging Eq. 7 into Eq. 5 results in the following approximation of P (\u0398|A):",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orientation Model",
"sec_num": "4"
},
{
"text": "C. |A|\u22121 i=0 {P ori L (ori(a i , M L (a i ))|a i )\u00d7 P ori R (ori(a i , M R (a i ))|a i )} O (8)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orientation Model",
"sec_num": "4"
},
{
"text": "where C is a constant term related to the pseudo anchors and O is the maximum order of the AG. In practice, we can safely ignore both C and O as they are constant for a given AG. As shown, the orientation model is simplified into a model that looks at the reordering of the anchors' neighboring constituents. The exact definition of M L and M R will be discussed in Section 5. Their orientation, i.e. ori L (C L , a) and ori R (C R , a) respectively, may take one of the following four values: (MA), (RA), (MG) and (RG). The first clause (monotone, reverse) indicates whether the target order follows the source order; the second (adjacent, gap) indicates whether the anchor and its neighboring constituent are adjacent or separated by an intervening when projected.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Orientation Model",
"sec_num": "4"
},
{
"text": "For each (F, E, \u223c), the training starts with the identification of the regions in the source sentences as anchors (A). For our Chinese-English experiments, we use a simple heuristic that equates anchors (A * ) with constituents whose corresponding word class belongs to function words-related classes, bearing a close resemblance to (Setiawan et al., 2007) . In total, we consider 21 part-of-speech tags; some of which are as follows: VC (copula), DEG, DEG, DER, DEV (de-related), PU (punctuation), AD (adjectives) and P (prepositions).",
"cite_spans": [
{
"start": 333,
"end": 356,
"text": "(Setiawan et al., 2007)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Parameter Estimation",
"sec_num": "5"
},
{
"text": "The parameter estimation first involves extracting two statistics from (F, E, \u223c), namely dom(a m , a n ) for the dominance model as well as ori(a, M L (a)) and ori(a, M R (a)) for the orientation model. Instead of developing a separate algorithm for each, we describe a unified way to extract these statistics via the largest neighboring constituents of the anchors, i.e. M L (a) and M R (a). This approach enables the dominance model to share the same residual state information as the orientation model. 3 Let a m be an anchor and M R (a m ) be its largest neighboring constituent to the right. Let a n be an anchor to the left of a m and M L (a n ) be a n 's largest neighboring constituent to the left. According to AL-SG, we say that a m dominates a n if ori(a m , M R (a m )) \u2208 {M A, RA} and a n \u2208 M R (a m ). By the same token, we say that a n dominates a m if ori(a n , M L (a n )) \u2208 {M A, RA} and a m \u2208 M L (a n ). The constraints on the orientation reflect the fact that in AL-SG, anchors can only be propagated through monotone or inverse production rules, which correspond to the M A and RA respectively. The fact that we are looking at the largest neighboring constituents guarantees that if the other anchor is outside that constituent, then that other anchor is never dominated.",
"cite_spans": [
{
"start": 506,
"end": 507,
"text": "3",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "More formally, given an aligned sentence pair \u0398 = (F, E, \u223c), let \u2206(\u0398) be all possible constituents that can be extracted from \u0398: 4",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "{(f j 2 j 1 /e i 2 i 1 ) : \u2200(j, i) \u2208\u223c: ((j 1 \u2264 j\u2264 j 2 ) \u2227 (i i \u2264 i\u2264 i 2 )) \u2228(\u00ac(j 1 \u2264 j\u2264 j 2 ) \u2227 \u00ac(i i \u2264 i\u2264 i 2 ))",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "Then, let the anchors A be a subset of \u2206(\u0398). Given A \u2282 \u2206(\u0398), let a = (f j 2 j 1 /e i 2 i 1 ) \u2208 A be a particular anchor. And, let C L (a) \u2282 \u2206(\u0398) be a's left neighbors and let C R (a) \u2282 \u2206(\u0398) be a's right neighbors, iff:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "\u2200C L = (f j 4 j 3 /e i 4 i 3 ) \u2208 C L (a) : j 4 + 1 = j 1 \u2200C R = (f j 6 j 5 /e i 6 i 5 ) \u2208 C R (a) : j 2 + 1 = j 5",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "Then, let M L (a) \u2208 C L (a) and M R (a) \u2208 C R (a) be the largest left and right neighbors according to:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "M L (a) = arg max (f j 4 j 3 /e i 4 i 3 )\u2208C L (a) (j 4 \u2212 j 3 ) M R (a) = arg max (f j 6 j 5 /e i 6 i 5 )\u2208C R (a) (j 6 \u2212 j 5 )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "Let M L = (f j 4 j 3 /e i 4 i 3 ) and M R = (f j 6 j 5 /e i 6 i 5 ). We then proceed to extract ori L (a, M L (a)) and ori R (a, M R (a)) respectively as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "\u2022 MA, if (i 4 + 1) = i 1 for ori L or if (i 2 + 1) = i 5 for ori R \u2022 RA, if (i 2 + 1) = i 3 for ori L or if (i 6 + 1) = i 1 for ori R \u2022 MG, if (i 4 + 1) < i 1 for ori L or if (i 2 + 1) < i 5 for ori R \u2022 RG, if (i 2 + 1) < i 3 for ori L or if (i 6 + 1) < i 1 for ori R .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "Then, we proceed to extract dom(a m , a n ). Given two anchors a m , a n where m < n, we define the dominance relation between a m and a n via M R (a m ) and M L (a n ). Let a m = (f j 2 j 1 /e i 2 i 1 ), M R (a m ) = (f j 4 j 3 /e i 4 i 3 ), a n = (f j 6 j 5 /e i 6 i 5 ) and M L (a n ) = (f j 8 j 7 /e i 8 i 7 ). Then, ldom(a m , a n ) is true only if (j 4 \u2265 j 6 ) and ori R (a m , M R (a m )) \u2208 {M A, RA}. Similarly, rdom(a m , a n ) is true only if (j 7 \u2264 j 1 ) and ori L (a n , M L (a n )) \u2208 {M A, RA}.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "Hence, dom(a m , a n ) is as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "\u2022 LH, if ldom(a m , a n ) \u2227 \u00acrdom(a m , a n )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "\u2022 RH, if \u00acldom(a m , a n ) \u2227 rdom(a m , a n )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "\u2022 BL, if ldom(a m , a n ) \u2227 rdom(a m , a n )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "\u2022 BD, if \u00acldom(a m , a n ) \u2227 \u00acrdom(a m , a n )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Extracting Events from (F, E, \u223c)",
"sec_num": "5.1"
},
{
"text": "After extracting events, we are now ready to train the models. To estimate them, we train a discriminative classifier for each model and use the normalized posteriors at decoding time as additional feature scores in SMT's log-linear framework. At a high level, we use a rich set of binary features ranging from lexical to part-of-speech (POS) and to syntactic features. Additionally, we augment the feature set with compound features, e.g. a conjunction of the source word of the left anchor and the source word of the right anchor. Although they increase the number of features significantly, we found that they are empirically beneficial.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameterization and Training",
"sec_num": "5.2"
},
{
"text": "Suppose",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameterization and Training",
"sec_num": "5.2"
},
{
"text": "a = (f j 2 j 1 /e i 2 i 1 ), M L (a) = (f j 4 j 3 /e i 4 i 3 ) and M R (a) = (f j 6",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameterization and Training",
"sec_num": "5.2"
},
{
"text": "j 5 /e i 6 i 5 ), then based on the context's location, the elementary features employed in our classifiers can be categorized into:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameterization and Training",
"sec_num": "5.2"
},
{
"text": "\u2022 anchor-related:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameterization and Training",
"sec_num": "5.2"
},
{
"text": "(the actual word of f j 2 j 1 ), (part-of-speech (POS) tag of ), ('s parent in the parse tree), (e i 2 i 1 's actual target word). \u2022 surrounding: (the previous word / f j 1 \u22121 j 1 \u22121 ), (the next word / f j 2 +1 j 2 +1 ), ('s POS tag), ('s POS tag), ('s parent), ('s parent).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameterization and Training",
"sec_num": "5.2"
},
{
"text": "\u2022 non-local: (the previous anchor's source word)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameterization and Training",
"sec_num": "5.2"
},
{
"text": ", (the next anchor's source word), ('s POS tag), ('s POS tag).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameterization and Training",
"sec_num": "5.2"
},
{
"text": "There is a separate set of elementary features for a m and a n and we come up with manual combination to construct compound features.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Parameterization and Training",
"sec_num": "5.2"
},
{
"text": "In training the models, we manually come up with around 30-50 types of features, which consists of a combination of elementary and compound features. Due to space constraints, we will describe the actual features that we use and the classification performance of our models elsewhere. In total, we generate around one hundred millions binary features from our training data that contains six million sentence pairs. To reduce the number of features, we employ the L1-regularization in training to enforce sparse solutions, using the off-the-shelf LIB-LINEAR toolkit (Fan et al., 2008) . After training, the number of features in our classifiers decreases to below 1 million features for each classifier.",
"cite_spans": [
{
"start": 566,
"end": 584,
"text": "(Fan et al., 2008)",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Parameterization and Training",
"sec_num": "5.2"
},
{
"text": "As mentioned earlier, we wish to avoid the spurious ambiguity issue where different derivations have radically different scores although they lead to the same reordering. This section describes our decoding algorithm that avoids spurious ambiguity issue by incrementally constructing M L s and M R s thus allowing the computation of the models over partial hypotheses.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "In our experiments, we integrate our dominance model as well as our orientation model into a syntaxbased SMT system that uses SCFG formalism. Integrating the models into syntax-based SMT systems is non-trivial, especially since the anchors often reside within translation rules and the model doesn't always decompose naturally with the hypothesis structure. To facilitate that, we need to first induce the necessary alignment for all translation units in the hypothesis.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "To describe the algorithm, let us consider a cheating exercise where we have to translate the Chinese sentence in Fig. 2 with the following set of hierarchical phrases:",
"cite_spans": [],
"ref_spans": [
{
"start": 114,
"end": 120,
"text": "Fig. 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "X a \u2192 Aozhou 1 shi 2 X 1 , Australia 1 is 2 X 1 X b \u2192 yu 3 Beihan 4 X 1 , X 1 with 3 North 4 Korea X c \u2192 you 5 bangjiao 6 , have 5 dipl. 6 rels. X d \u2192 X 1 de 7 shaoshu 8 guojia 9 zhi 10 yi 11 ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "one 11 of 10 the few 8 countries 9 that 7 X 1 As a case in point, let us consider D = X a \u227a X b \u227a X d \u227a X c , which will lead to the correct English Target string (w/ source index) Symbol(s) read Op.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "Stack(s) (1) X c have 5 dipl. 6 rels.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "[ ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "5][6] S,S,R X c :[5-6] (2) X d one 11 of 10 few 8 countries 9 [11][10] S,S,R [10-11] that 7 X c (3) [8][9] S,S,R,R [8-11] (4) [7] S [8-11][7] (5) X c :[5,6] S X d :[8-11][7][5,6] (6) X b X d with 3 North 4 Korea X d :[8-11][7][5,6] S [8-11][7][5,6] (7) [3][4] S,S,R,R X b :[8-11][7][3-6] (8) X a Australia 1 is 2 X b [1][2] S,S,R [1-2] (9) X b :[8-11][7][3,6] S,A X a :[1-2][8-11][7][3,6]",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "D = X a \u227a X b \u227a X d \u227a X c .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "Anchor is in bold. In column Op., S, R and A refer to shift, reduce and accept operation respectively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "translation as in Fig. 2 . Note that the translation rules contain internal word alignment, which we assume to have been previously inferred.",
"cite_spans": [],
"ref_spans": [
{
"start": 18,
"end": 24,
"text": "Fig. 2",
"ref_id": "FIGREF1"
}
],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "The algorithm bears a close resemblance to the shift-reduce algorithm found in phrase-based decoding (Galley and Manning, 2008; Feng et al., 2010; Cherry et al., 2012) . A stack is used to accumulate (partial) information about a, M L and M R for each a \u2208 A in the derivation. This algorithm takes an input stream and applies either the shift or the reduce operations starting from the beginning until the end of the stream. The shift operation advances the input stream by one symbol and push the symbol into the stack; while the reduce operation applies some rule to the top-most elements of the stack. The algorithm terminates at the end of the input stream where the resulting stack will be propagated to the parent for the later stage of decoding. In our case, the input stream is the target string of the rule and the symbol is the corresponding source index of the elements of the target string. The reduction rule looks at two indices and merge them if they are adjacent (i.e. has no intervening phrase). We forbid the application of the reduction rule to anchors. Table 2 shows the execution trace of the algorithm for the derivation described earlier. For conciseness, we assume that there is only one anchor and that is de 7 /that 7 .",
"cite_spans": [
{
"start": 101,
"end": 127,
"text": "(Galley and Manning, 2008;",
"ref_id": "BIBREF10"
},
{
"start": 128,
"end": 146,
"text": "Feng et al., 2010;",
"ref_id": "BIBREF9"
},
{
"start": 147,
"end": 167,
"text": "Cherry et al., 2012)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [
{
"start": 1073,
"end": 1080,
"text": "Table 2",
"ref_id": "TABREF0"
}
],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "As shown, the algorithm starts with an empty stack. It then projects the source index to the corresponding target word and then enumerates the target string in a left to right fashion. If it finds a target word with a source index, it applies the shift oper-ation, pushing the index to the stack. Unless the symbol corresponds to an anchor, it tries to apply the reduce operation. Line (4) indicates the special treatment to the anchor. If the symbol being read is a nonterminal, then we push the entire stack that corresponds to that nonterminal. For example, when the algorithm reads X d at line (6), it pushes the entire stack from line (5).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "As M L s and M R s are being incrementally constructed, we can immediately compute P domo (dom(a m , a n )|a m , a n ) as soon as a partial derivation covers both a m and a n .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "For example, we can compute P dom 1 (dom(you 5 /have 8 , de 7 /that 7 ) = ), P dom 1 (dom(de 7 /that 7 , zhi 10 /of 4 ) = ) and P dom 2 (dom(you 5 /have 8 , zhi 10 /of 4 ) = ) at partial hypothesis X d \u227a X c which corresponds to a constituent spanning from 5-11.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "6"
},
{
"text": "Our baseline systems is a state-of-the-art string-todependency system (Shen et al., 2008) . The system is trained on 10 million parallel sentences that are available to the Phase 1 of the DARPA BOLT Chinese-English MT task. The training corpora include a mixed genre of newswire, weblog, broadcast news, broadcast conversation, discussion forums and comes from various sources such as LDC, HK Law, HK Hansard and UN data.",
"cite_spans": [
{
"start": 70,
"end": 89,
"text": "(Shen et al., 2008)",
"ref_id": "BIBREF16"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "7"
},
{
"text": "In total, our baseline model employs more than 50 features, including from our proposed dominance and orientation models. In addition to the standard Table 3 : The NIST MT08 results on newswire (nw), weblog (wb) and combined genres. S2D is the baseline stringto-dependency system (line 1). Lines 2-7 shows the results of the dominance model with O = 1 \u2212 6. Line 8 shows result on adding ori to the baseline. Lines 9-13 shows the results of the orientation complemented with the dominance model with varying O. The best BLEU, TER and Comb on each genre of the first set are in italic while those of the second set are in bold. For BLEU, higher scores are better, while for TER and Comb, lower scores are better.",
"cite_spans": [],
"ref_spans": [
{
"start": 150,
"end": 157,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experiments",
"sec_num": "7"
},
{
"text": "features such as translation probabilities, we incorporate features that are found useful for developing a state-of-the-art baseline, such as the provenance features . We use a 6-gram language model, which was trained on 10 billion English words from multiple corpora, including the English side of our parallel corpus plus other corpora such as Gigaword (LDC2011T07) and Google News. We also train a class-based language model (Chen, 2009) on two million English sentences selected from the parallel corpus. As for our string-todependency system, we train 3-gram models for left and right dependencies and unigram for head using the target side of the parallel corpus. To train our models, we select a set of 5 million sentence pairs.",
"cite_spans": [
{
"start": 428,
"end": 440,
"text": "(Chen, 2009)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "7"
},
{
"text": "For the tuning and development sets, we set aside 1275 and 1239 sentences selected from LDC2010E30 corpus. We tune the feature weights with PRO (Hopkins and May, 2011) to minimize (TER-BLEU)/2 metric. As for the blind test set, we report the performance on the NIST MT08 evaluation set, which consists of 691 sentences from newswire and 666 sentences from weblog. We pick the weights that produce the highest development set scores to decode the test set.",
"cite_spans": [
{
"start": 144,
"end": 167,
"text": "(Hopkins and May, 2011)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "7"
},
{
"text": "We perform two sets of experiments. The first set looks at the contribution of the dominance model with varying values of o. The second one looks at the combination of the dominance model and the orientation model. Table 3 summarizes the experimental results on NIST MT08 sets, categorized by genres. We report the results on newswire genre in columns a-c, those on weblog genre in column d-f, and those on mixed genre in column g-i. The performance of our baseline string-to-dependency syntaxbased SMT is shown in the first line.",
"cite_spans": [],
"ref_spans": [
{
"start": 215,
"end": 222,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experiments",
"sec_num": "7"
},
{
"text": "Lines 2-7 in Table 3 show the results of our first set of experiments, starting from the result of dom 1 , which looks at only at pairs of adjacent anchors, to the result of dom 6 , which looks at pairs of anchors that are at most 5 anchors away. As shown in line 2, our dominance model provides a nice improvement of around 0.5 point over the baseline even if it only looks at restricted context. Increasing the order of our dominance model provides an additional gain. However, the gain is more pronounced in the weblog genre (up to around 1 BLEU point) than in the newswire genre. We conjecture that this may be the artifact of our tune set, which comes from the weblog genre. We stop at dom 6 because we observe that the weight of the feature score that corresponds to the maximum order (o = 6) has a negative sign, which often indicates a high correlation between the new features and existing ones.",
"cite_spans": [],
"ref_spans": [
{
"start": 13,
"end": 20,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experiments",
"sec_num": "7"
},
{
"text": "Lines 8-13 in Table 3 shows the results of our second set of experiments. Line 8 shows the result of adding the orientation model (ori) to the baseline system. As shown, integrating ori shows a significant gain. On top of which, we then integrate dom 1 to dom 5 . We see a very encouraging result as adding the dominance model increases the performance further, consistently over different value of o. This suggests that the dominance model is complementary to the orientation model. Our best result provides more than 1 BP improvement and 1 TER reduction consistently over different genres. We see this result as confirming our intuition that the global contextual information provided by our AG model can significantly improve the performance of SMT even in a state-of-the-art system.",
"cite_spans": [],
"ref_spans": [
{
"start": 14,
"end": 21,
"text": "Table 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experiments",
"sec_num": "7"
},
{
"text": "Our work intersects with existing work in many different respects. In this section, we mainly focus on work related to introducing higher-order contextual information to reordering model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "8"
},
{
"text": "In providing global contextual information, our work is related to a large amount of literature. To name a few, Zens and Ney (2006) improves the lexicalized reordering model of Tillman (2004) by incorporating part-of-speech information. Chang et al. (2009) incorporates contexts from syntactic parse tree. Bach et al. (2009) exploits the dependency information and Xiong et al. (2012) uses the predicateargument structure. Vaswani et al. (2011) introduces rule markov models for a forest-to-string model in which the number of possible derivations is restricted. More recently, Durrani et al. (2013) and Zhang et al. (2013) cast reordering process as a Markov process. Similar to these models, our proposed model also provide context dependencies to the application of translation rules, however, as they focus on minimal translation units (MTU) where we focus on a selected set of translation units. (Banchs et al., 2005 ) introduces a bigram model for monotone phrasebased system, but their definition of translation units is suitable only for language pairs with limited reordering, such as translating Spanish to English.",
"cite_spans": [
{
"start": 112,
"end": 131,
"text": "Zens and Ney (2006)",
"ref_id": "BIBREF21"
},
{
"start": 177,
"end": 191,
"text": "Tillman (2004)",
"ref_id": "BIBREF17"
},
{
"start": 237,
"end": 256,
"text": "Chang et al. (2009)",
"ref_id": "BIBREF2"
},
{
"start": 306,
"end": 324,
"text": "Bach et al. (2009)",
"ref_id": "BIBREF0"
},
{
"start": 365,
"end": 384,
"text": "Xiong et al. (2012)",
"ref_id": "BIBREF20"
},
{
"start": 423,
"end": 444,
"text": "Vaswani et al. (2011)",
"ref_id": "BIBREF18"
},
{
"start": 578,
"end": 599,
"text": "Durrani et al. (2013)",
"ref_id": "BIBREF7"
},
{
"start": 604,
"end": 623,
"text": "Zhang et al. (2013)",
"ref_id": "BIBREF22"
},
{
"start": 901,
"end": 921,
"text": "(Banchs et al., 2005",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "8"
},
{
"text": "In equating anchors with the function word class, our work is closely related to the function wordcentered model of Setiawan et al. (2007) , especially the orientation model. Our dominance model is closely related to the reordering model of Setiawan et al. (2009) , except that they only look at pair of adjacent anchors, forming a chain structure instead of a graph like in our dominance model. Furthermore, we provide a discriminative treatment to the model to include a richer set of features including syntactic features. This work can be seen as modeling the identity of the neighboring of the anchors, similar to (Setiawan et al., 2013) . However, instead of looking at the words at the borders, we look at whether the neighboring constituents contain other anchors.",
"cite_spans": [
{
"start": 116,
"end": 138,
"text": "Setiawan et al. (2007)",
"ref_id": "BIBREF13"
},
{
"start": 241,
"end": 263,
"text": "Setiawan et al. (2009)",
"ref_id": "BIBREF14"
},
{
"start": 619,
"end": 642,
"text": "(Setiawan et al., 2013)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "8"
},
{
"text": "We propose the \"Anchor Graph\" (AG) model to encode global contextual information. A selected set of translation units, which we call anchors, serves as the vertices of AG. And as the edges, we model two types of relations, namely the dominance and the precedence relations, where the former looks at the positions of the anchors in the derivation structure, while the latter looks at the positions of the anchors in the surface structure, resulting into two probabilistic models over edge labels. As the models look at the pairs of anchors that go beyond multiple translation units, our AG model provides global contextual information.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "9"
},
{
"text": "Our AG model embodies (admittedly crudely) some basic principles of sentence organization, namely categorization (in categorizing units into anchors and non-anchors), linear order (in modeling the precedence of anchors) and constituency structure (in modeling the dominance between anchors). We are encouraged by the facts that we learn these principles in an unsupervised way and that we can achieve a significant improvement over a strong baseline in a large-scale Chinese-to-English translation task. In the future, we hope to continue this line of research, perhaps by learning to identify anchors automatically from training data or by using our models to induce derivations directly from unaligned sentence pair.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "9"
},
{
"text": "The analogy in an n-gram language model is the first n \u2212 1 words of the hypothesis that have incomplete history.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "We represent a constituent as a source and target phrase pair (f j 2 j 1 /e i 2 i 1 ) where the subscript and the superscript indicate the starting and the ending indices as such f j 2 j 1 denotes a source phrase that spans from j1 to j2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We would like to acknowledge the support of DARPA under Grant HR0011-12-C-0015 for funding part of this work. The views, opinions, and/or findings contained in this article/presentation are those of the author/presenter and should not be interpreted as representing the official views or policies, either expressed or implied, of the DARPA.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Source-side dependency tree reordering models with subtree movements and constraints",
"authors": [
{
"first": "Nguyen",
"middle": [],
"last": "Bach",
"suffix": ""
},
{
"first": "Qin",
"middle": [],
"last": "Gao",
"suffix": ""
},
{
"first": "Stephan",
"middle": [],
"last": "Vogel",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the Twelfth Machine Translation Summit (MTSummit-XII)",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nguyen Bach, Qin Gao, and Stephan Vogel. 2009. Source-side dependency tree reordering models with subtree movements and constraints. In Proceedings of the Twelfth Machine Translation Summit (MTSummit- XII), Ottawa, Canada, August. International Associa- tion for Machine Translation.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Statistical machine translation of Euparl data by using bilingual n-grams",
"authors": [
{
"first": "Rafael",
"middle": [
"E"
],
"last": "Banchs",
"suffix": ""
},
{
"first": "Josep",
"middle": [
"M"
],
"last": "Crego",
"suffix": ""
},
{
"first": "Adri\u00e0",
"middle": [],
"last": "De Gispert",
"suffix": ""
},
{
"first": "Patrik",
"middle": [],
"last": "Lambert",
"suffix": ""
},
{
"first": "Jos\u00e9",
"middle": [
"B"
],
"last": "Mari\u00f1o",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the ACL Workshop on Building and Using Parallel Texts",
"volume": "",
"issue": "",
"pages": "133--136",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rafael E. Banchs, Josep M. Crego, Adri\u00e0 de Gispert, Pa- trik Lambert, and Jos\u00e9 B. Mari\u00f1o. 2005. Statisti- cal machine translation of Euparl data by using bilin- gual n-grams. In Proceedings of the ACL Workshop on Building and Using Parallel Texts, pages 133-136, Ann Arbor, Michigan, June. Association for Compu- tational Linguistics.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Discriminative reordering with Chinese grammatical relations features",
"authors": [
{
"first": "Pi-Chuan",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Huihsin",
"middle": [],
"last": "Tseng",
"suffix": ""
},
{
"first": "Dan",
"middle": [],
"last": "Jurafsky",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the Third Workshop on Syntax and Structure in Statistical Translation",
"volume": "",
"issue": "",
"pages": "51--59",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pi-Chuan Chang, Huihsin Tseng, Dan Jurafsky, and Christopher D. Manning. 2009. Discriminative re- ordering with Chinese grammatical relations features. In Proceedings of the Third Workshop on Syntax and Structure in Statistical Translation (SSST-3) at NAACL HLT 2009, pages 51-59, Boulder, Colorado, June. As- sociation for Computational Linguistics.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Shrinking exponential language models",
"authors": [
{
"first": "Stanley",
"middle": [],
"last": "Chen",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of Human Language Technologies: The 2009 Annual Conference of the North American Chapter of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "468--476",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stanley Chen. 2009. Shrinking exponential language models. In Proceedings of Human Language Tech- nologies: The 2009 Annual Conference of the North American Chapter of the Association for Computa- tional Linguistics, pages 468-476, Boulder, Colorado, June. Association for Computational Linguistics.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "On hierarchical re-ordering and permutation parsing for phrase-based decoding",
"authors": [
{
"first": "Colin",
"middle": [],
"last": "Cherry",
"suffix": ""
},
{
"first": "Robert",
"middle": [
"C"
],
"last": "Moore",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Quirk",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the Seventh Workshop on Statistical Machine Translation",
"volume": "",
"issue": "",
"pages": "200--209",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Colin Cherry, Robert C. Moore, and Chris Quirk. 2012. On hierarchical re-ordering and permutation parsing for phrase-based decoding. In Proceedings of the Seventh Workshop on Statistical Machine Translation, pages 200-209, Montr\u00e9al, Canada, June. Association for Computational Linguistics.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Two easy improvements to lexical weighting",
"authors": [
{
"first": "David",
"middle": [],
"last": "Chiang",
"suffix": ""
},
{
"first": "Steve",
"middle": [],
"last": "Deneefe",
"suffix": ""
},
{
"first": "Michael",
"middle": [],
"last": "Pust",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "455--460",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Chiang, Steve DeNeefe, and Michael Pust. 2011. Two easy improvements to lexical weighting. In Pro- ceedings of the 49th Annual Meeting of the Associa- tion for Computational Linguistics: Human Language Technologies, pages 455-460, Portland, Oregon, USA, June. Association for Computational Linguistics.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "A hierarchical phrase-based model for statistical machine translation",
"authors": [
{
"first": "David",
"middle": [],
"last": "Chiang",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the 43rd Annual Meeting of the Association for Computational Linguistics (ACL'05)",
"volume": "",
"issue": "",
"pages": "263--270",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Chiang. 2005. A hierarchical phrase-based model for statistical machine translation. In Proceedings of the 43rd Annual Meeting of the Association for Com- putational Linguistics (ACL'05), pages 263-270, Ann Arbor, Michigan, June. Association for Computational Linguistics.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Model with minimal translation units, but decode with phrases",
"authors": [
{
"first": "Nadir",
"middle": [],
"last": "Durrani",
"suffix": ""
},
{
"first": "Alexander",
"middle": [],
"last": "Fraser",
"suffix": ""
},
{
"first": "Helmut",
"middle": [],
"last": "Schmid",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "1--11",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nadir Durrani, Alexander Fraser, and Helmut Schmid. 2013. Model with minimal translation units, but de- code with phrases. In Proceedings of the 2013 Con- ference of the North American Chapter of the Associa- tion for Computational Linguistics: Human Language Technologies, pages 1-11, Atlanta, Georgia, June. As- sociation for Computational Linguistics.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "LIBLINEAR: A library for large linear classification",
"authors": [
{
"first": "Kai-Wei",
"middle": [],
"last": "Rong-En Fan",
"suffix": ""
},
{
"first": "Cho-Jui",
"middle": [],
"last": "Chang",
"suffix": ""
},
{
"first": "Xiang-Rui",
"middle": [],
"last": "Hsieh",
"suffix": ""
},
{
"first": "Chih-Jen",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 2008,
"venue": "Journal of Machine Learning Research",
"volume": "9",
"issue": "",
"pages": "1871--1874",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rong-En Fan, Kai-Wei Chang, Cho-Jui Hsieh, Xiang-Rui Wang, and Chih-Jen Lin. 2008. LIBLINEAR: A li- brary for large linear classification. Journal of Ma- chine Learning Research, 9:1871-1874.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "An efficient shift-reduce decoding algorithm for phrasedbased machine translation",
"authors": [
{
"first": "Yang",
"middle": [],
"last": "Feng",
"suffix": ""
},
{
"first": "Haitao",
"middle": [],
"last": "Mi",
"suffix": ""
},
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Qun",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2010,
"venue": "Coling 2010: Posters",
"volume": "",
"issue": "",
"pages": "285--293",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yang Feng, Haitao Mi, Yang Liu, and Qun Liu. 2010. An efficient shift-reduce decoding algorithm for phrased- based machine translation. In Coling 2010: Posters, pages 285-293, Beijing, China, August. Coling 2010 Organizing Committee.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "A simple and effective hierarchical phrase reordering model",
"authors": [
{
"first": "Michel",
"middle": [],
"last": "Galley",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "848--856",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michel Galley and Christopher D. Manning. 2008. A simple and effective hierarchical phrase reordering model. In Proceedings of the 2008 Conference on Empirical Methods in Natural Language Processing, pages 848-856, Honolulu, Hawaii, October. Associa- tion for Computational Linguistics.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Association for Computational Linguistics",
"authors": [
{
"first": "Mark",
"middle": [],
"last": "Hopkins",
"suffix": ""
},
{
"first": "Jonathan",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 2011 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1352--1362",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mark Hopkins and Jonathan May. 2011. Tuning as rank- ing. In Proceedings of the 2011 Conference on Empir- ical Methods in Natural Language Processing, pages 1352-1362, Edinburgh, Scotland, UK., July. Associa- tion for Computational Linguistics.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Moses: Open source toolkit for statistical machine translation",
"authors": [
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "Hieu",
"middle": [],
"last": "Hoang",
"suffix": ""
},
{
"first": "Alexandra",
"middle": [],
"last": "Birch",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Callison-Burch",
"suffix": ""
},
{
"first": "Marcello",
"middle": [],
"last": "Federico",
"suffix": ""
},
{
"first": "Nicola",
"middle": [],
"last": "Bertoldi",
"suffix": ""
},
{
"first": "Brooke",
"middle": [],
"last": "Cowan",
"suffix": ""
},
{
"first": "Wade",
"middle": [],
"last": "Shen",
"suffix": ""
}
],
"year": 2007,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Philipp Koehn, Hieu Hoang, Alexandra Birch, Chris Callison-Burch, Marcello Federico, Nicola Bertoldi, Brooke Cowan, Wade Shen, Christine Moran, Richard Zens, Chris Dyer, Ondrej Bojar, Alexandra Con- stantin, and Evan Herbst. 2007. Moses: Open source toolkit for statistical machine translation, June.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Ordering phrases with function words",
"authors": [
{
"first": "Hendra",
"middle": [],
"last": "Setiawan",
"suffix": ""
},
{
"first": "Min-Yen",
"middle": [],
"last": "Kan",
"suffix": ""
},
{
"first": "Haizhou",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2007,
"venue": "Proceedings of the 45th Annual Meeting of the Association of Computational Linguistics",
"volume": "",
"issue": "",
"pages": "712--719",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hendra Setiawan, Min-Yen Kan, and Haizhou Li. 2007. Ordering phrases with function words. In Proceed- ings of the 45th Annual Meeting of the Association of Computational Linguistics, pages 712-719, Prague, Czech Republic, June. Association for Computational Linguistics.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Topological ordering of function words in hierarchical phrase-based translation",
"authors": [
{
"first": "Hendra",
"middle": [],
"last": "Setiawan",
"suffix": ""
},
{
"first": "Min",
"middle": [
"Yen"
],
"last": "Kan",
"suffix": ""
},
{
"first": "Haizhou",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Philip",
"middle": [],
"last": "Resnik",
"suffix": ""
}
],
"year": 2009,
"venue": "Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language Processing of the AFNLP",
"volume": "",
"issue": "",
"pages": "324--332",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hendra Setiawan, Min Yen Kan, Haizhou Li, and Philip Resnik. 2009. Topological ordering of function words in hierarchical phrase-based translation. In Proceed- ings of the Joint Conference of the 47th Annual Meet- ing of the ACL and the 4th International Joint Confer- ence on Natural Language Processing of the AFNLP, pages 324-332, Suntec, Singapore, August. Associa- tion for Computational Linguistics.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Two-neighbor orientation model with cross-boundary global contexts",
"authors": [
{
"first": "Hendra",
"middle": [],
"last": "Setiawan",
"suffix": ""
},
{
"first": "Bowen",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Bing",
"middle": [],
"last": "Xiang",
"suffix": ""
},
{
"first": "Libin",
"middle": [],
"last": "Shen",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 51st Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "1264--1274",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hendra Setiawan, Bowen Zhou, Bing Xiang, and Libin Shen. 2013. Two-neighbor orientation model with cross-boundary global contexts. In Proceedings of the 51st Annual Meeting of the Association for Compu- tational Linguistics (Volume 1: Long Papers), pages 1264-1274, Sofia, Bulgaria, August. Association for Computational Linguistics.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "A new string-to-dependency machine translation algorithm with a target dependency language model",
"authors": [
{
"first": "Libin",
"middle": [],
"last": "Shen",
"suffix": ""
},
{
"first": "Jinxi",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Ralph",
"middle": [],
"last": "Weischedel",
"suffix": ""
}
],
"year": 2008,
"venue": "Proceedings of ACL-08: HLT",
"volume": "",
"issue": "",
"pages": "577--585",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Libin Shen, Jinxi Xu, and Ralph Weischedel. 2008. A new string-to-dependency machine translation algo- rithm with a target dependency language model. In Proceedings of ACL-08: HLT, pages 577-585, Colum- bus, Ohio, June. Association for Computational Lin- guistics.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "A unigram orientation model for statistical machine translation",
"authors": [
{
"first": "Christoph",
"middle": [],
"last": "Tillman",
"suffix": ""
}
],
"year": 2004,
"venue": "HLT-NAACL 2004: Short Papers",
"volume": "",
"issue": "",
"pages": "101--104",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Christoph Tillman. 2004. A unigram orientation model for statistical machine translation. In HLT-NAACL 2004: Short Papers, pages 101-104, Boston, Mas- sachusetts, USA, May 2 -May 7. Association for Computational Linguistics.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Rule markov models for fast tree-tostring translation",
"authors": [
{
"first": "Ashish",
"middle": [],
"last": "Vaswani",
"suffix": ""
},
{
"first": "Haitao",
"middle": [],
"last": "Mi",
"suffix": ""
},
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Chiang",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the 49th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "856--864",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ashish Vaswani, Haitao Mi, Liang Huang, and David Chiang. 2011. Rule markov models for fast tree-to- string translation. In Proceedings of the 49th Annual Meeting of the Association for Computational Linguis- tics: Human Language Technologies, pages 856-864, Portland, Oregon, USA, June. Association for Compu- tational Linguistics.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "Stochastic inversion transduction grammars and bilingual parsing of parallel corpora",
"authors": [
{
"first": "Dekai",
"middle": [],
"last": "Wu",
"suffix": ""
}
],
"year": 1997,
"venue": "Computational Linguistics",
"volume": "23",
"issue": "3",
"pages": "377--404",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dekai Wu. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics, 23(3):377-404, Sep.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Modeling the translation of predicate-argument structure for smt",
"authors": [
{
"first": "Deyi",
"middle": [],
"last": "Xiong",
"suffix": ""
},
{
"first": "Min",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Haizhou",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2012,
"venue": "Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics",
"volume": "1",
"issue": "",
"pages": "902--911",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Deyi Xiong, Min Zhang, and Haizhou Li. 2012. Model- ing the translation of predicate-argument structure for smt. In Proceedings of the 50th Annual Meeting of the Association for Computational Linguistics (Volume 1: Long Papers), pages 902-911, Jeju Island, Korea, July. Association for Computational Linguistics.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "Discriminative reordering models for statistical machine translation",
"authors": [
{
"first": "Richard",
"middle": [],
"last": "Zens",
"suffix": ""
},
{
"first": "Hermann",
"middle": [],
"last": "Ney",
"suffix": ""
}
],
"year": 2006,
"venue": "Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics (HLT-NAACL): Proceedings of the Workshop on Statistical Machine Translation",
"volume": "",
"issue": "",
"pages": "55--63",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Richard Zens and Hermann Ney. 2006. Discrimina- tive reordering models for statistical machine trans- lation. In Human Language Technology Conference of the North American Chapter of the Association for Computational Linguistics (HLT-NAACL): Proceed- ings of the Workshop on Statistical Machine Transla- tion, pages 55-63, New York City, NY, June. Associa- tion for Computational Linguistics.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Beyond left-to-right: Multiple decomposition structures for smt",
"authors": [
{
"first": "Hui",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Kristina",
"middle": [],
"last": "Toutanova",
"suffix": ""
},
{
"first": "Chris",
"middle": [],
"last": "Quirk",
"suffix": ""
},
{
"first": "Jianfeng",
"middle": [],
"last": "Gao",
"suffix": ""
}
],
"year": 2013,
"venue": "Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "12--21",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hui Zhang, Kristina Toutanova, Chris Quirk, and Jian- feng Gao. 2013. Beyond left-to-right: Multiple de- composition structures for smt. In Proceedings of the 2013 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, pages 12-21, Atlanta, Geor- gia, June. Association for Computational Linguistics.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "Figure 1: The illustration of the dominance and the precedence relations. The former looks at the anchors' projection on a derivation structure. The latter looks at the anchors' projection on the translated sentence.",
"uris": null,
"type_str": "figure",
"num": null
},
"FIGREF1": {
"text": "An illustration of an aligned Chinese-English sentence pair with one possible AL-ITG derivation obtained by applying the grammar in a left-to-right fashion. Circles represent alignment points. Black circle represents the anchor; boxes represent the anchor's neighbors. In the derivation tree, the anchors are represented by their position and in bold. For succinctness, we omit the preterminal rules in the tree.",
"uris": null,
"type_str": "figure",
"num": null
},
"TABREF0": {
"html": null,
"type_str": "table",
"content": "<table/>",
"text": "The application of the shift-reduce parsing algorithm, which corresponds to the following derivation",
"num": null
}
}
}
} |