File size: 95,034 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 | {
"paper_id": "P09-1020",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:54:23.742045Z"
},
"title": "Forest-based Tree Sequence to String Translation Model",
"authors": [
{
"first": "Hui",
"middle": [],
"last": "Zhang",
"suffix": "",
"affiliation": {},
"email": "mzhang@i2r.a-star.edu.sg"
},
{
"first": "Min",
"middle": [],
"last": "Zhang",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Haizhou",
"middle": [],
"last": "Li",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Aiti",
"middle": [],
"last": "Aw",
"suffix": "",
"affiliation": {},
"email": ""
},
{
"first": "Chew",
"middle": [
"Lim"
],
"last": "Tan",
"suffix": "",
"affiliation": {},
"email": ""
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "This paper proposes a forest-based tree sequence to string translation model for syntaxbased statistical machine translation, which automatically learns tree sequence to string translation rules from word-aligned sourceside-parsed bilingual texts. The proposed model leverages on the strengths of both tree sequence-based and forest-based translation models. Therefore, it can not only utilize forest structure that compactly encodes exponential number of parse trees but also capture nonsyntactic translation equivalences with linguistically structured information through tree sequence. This makes our model potentially more robust to parse errors and structure divergence. Experimental results on the NIST MT-2003 Chinese-English translation task show that our method statistically significantly outperforms the four baseline systems.",
"pdf_parse": {
"paper_id": "P09-1020",
"_pdf_hash": "",
"abstract": [
{
"text": "This paper proposes a forest-based tree sequence to string translation model for syntaxbased statistical machine translation, which automatically learns tree sequence to string translation rules from word-aligned sourceside-parsed bilingual texts. The proposed model leverages on the strengths of both tree sequence-based and forest-based translation models. Therefore, it can not only utilize forest structure that compactly encodes exponential number of parse trees but also capture nonsyntactic translation equivalences with linguistically structured information through tree sequence. This makes our model potentially more robust to parse errors and structure divergence. Experimental results on the NIST MT-2003 Chinese-English translation task show that our method statistically significantly outperforms the four baseline systems.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Recently syntax-based statistical machine translation (SMT) methods have achieved very promising results and attracted more and more interests in the SMT research community. Fundamentally, syntax-based SMT views translation as a structural transformation process. Therefore, structure divergence and parse errors are two of the major issues that may largely compromise the performance of syntax-based SMT (Zhang et al., 2008a; .",
"cite_spans": [
{
"start": 405,
"end": 426,
"text": "(Zhang et al., 2008a;",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Many solutions have been proposed to address the above two issues. Among these advances, forest-based modeling and tree sequence-based modeling (Liu et al., 2007; Zhang et al., 2008a) are two interesting modeling methods with promising results reported. Forest-based modeling aims to improve translation accuracy through digging the potential better parses from n-bests (i.e. forest) while tree sequence-based modeling aims to model non-syntactic translations with structured syntactic knowledge. In nature, the two methods would be complementary to each other since they manage to solve the negative impacts of monolingual parse errors and cross-lingual structure divergence on translation results from different viewpoints. Therefore, one natural way is to combine the strengths of the two modeling methods for better performance of syntax-based SMT. However, there are many challenges in combining the two methods into a single model from both theoretical and implementation engineering viewpoints. In theory, one may worry about whether the advantage of tree sequence has already been covered by forest because forest encodes implicitly a huge number of parse trees and these parse trees may generate many different phrases and structure segmentations given a source sentence. In system implementation, the exponential combinations of tree sequences with forest structures make the rule extraction and decoding tasks much more complicated than that of the two individual methods.",
"cite_spans": [
{
"start": 144,
"end": 162,
"text": "(Liu et al., 2007;",
"ref_id": "BIBREF12"
},
{
"start": 163,
"end": 183,
"text": "Zhang et al., 2008a)",
"ref_id": "BIBREF21"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper, we propose a forest-based tree sequence to string model, which is designed to integrate the strengths of the forest-based and the tree sequence-based modeling methods. We present our solutions that are able to extract translation rules and decode translation results for our model very efficiently. A general, configurable platform was designed for our model. With this platform, we can easily implement our method and many previous syntax-based methods by simple parameter setting. We evaluate our method on the NIST MT-2003 Chinese-English translation tasks. Experimental results show that our method significantly outperforms the two individual methods and other baseline methods. Our study shows that the proposed method is able to effectively combine the strengths of the forest-based and tree sequence-based methods, and thus having great potential to address the issues of parse errors and non-syntactic transla-tions resulting from structure divergence. It also indicates that tree sequence and forest play different roles and make contributions to our model in different ways.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The remainder of the paper is organized as follows. Section 2 describes related work while section 3 defines our translation model. In section 4 and section 5, the key rule extraction and decoding algorithms are elaborated. Experimental results are reported in section 6 and the paper is concluded in section 7.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "As discussed in section 1, two of the major challenges to syntax-based SMT are structure divergence and parse errors. Many techniques have been proposed to address the structure divergence issue while only fewer studies are reported in addressing the parse errors in the SMT research community.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "2"
},
{
"text": "To address structure divergence issue, many researchers (Eisner, 2003; Zhang et al., 2007) propose using the Synchronous Tree Substitution Grammar (STSG) grammar in syntax-based SMT since the STSG uses larger tree fragment as translation unit. Although promising results have been reported, STSG only uses one single subtree as translation unit which is still committed to the syntax strictly. Motivated by the fact that non-syntactic phrases make non-trivial contribution to phrase-based SMT, the tree sequencebased translation model is proposed (Liu et al., 2007; Zhang et al., 2008a ) that uses tree sequence as the basic translation unit, rather than using single sub-tree as in the STSG. Here, a tree sequence refers to a sequence of consecutive sub-trees that are embedded in a full parse tree. For any given phrase in a sentence, there is at least one tree sequence covering it. Thus the tree sequence-based model has great potential to address the structure divergence issue by using tree sequence-based non-syntactic translation rules. Liu et al. (2007) propose the tree sequence concept and design a tree sequence to string translation model. Zhang et al. (2008a) propose a tree sequence-based tree to tree translation model and Zhang et al. (2008b) demonstrate that the tree sequence-based modelling method can well address the structure divergence issue for syntaxbased SMT.",
"cite_spans": [
{
"start": 56,
"end": 70,
"text": "(Eisner, 2003;",
"ref_id": "BIBREF1"
},
{
"start": 71,
"end": 90,
"text": "Zhang et al., 2007)",
"ref_id": "BIBREF20"
},
{
"start": 547,
"end": 565,
"text": "(Liu et al., 2007;",
"ref_id": "BIBREF12"
},
{
"start": 566,
"end": 585,
"text": "Zhang et al., 2008a",
"ref_id": "BIBREF21"
},
{
"start": 1045,
"end": 1062,
"text": "Liu et al. (2007)",
"ref_id": "BIBREF12"
},
{
"start": 1153,
"end": 1173,
"text": "Zhang et al. (2008a)",
"ref_id": "BIBREF21"
},
{
"start": 1239,
"end": 1259,
"text": "Zhang et al. (2008b)",
"ref_id": "BIBREF22"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "2"
},
{
"text": "To overcome the parse errors for SMT, propose a forest-based translation method that uses forest instead of one best tree as translation input, where a forest is a compact representation of exponentially number of n-best parse trees. propose a forest-based rule extraction algorithm, which learn tree to string rules from source forest and target string. By using forest in rule extraction and decoding, their methods are able to well address the parse error issue.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "2"
},
{
"text": "From the above discussion, we can see that traditional tree sequence-based method uses single tree as translation input while the forestbased model uses single sub-tree as the basic translation unit that can only learn tree-to-string (Galley et al. 2004; Liu et al., 2006) rules. Therefore, the two methods display different strengths, and which would be complementary to each other. To integrate their strengths, in this paper, we propose a forest-based tree sequence to string translation model.",
"cite_spans": [
{
"start": 234,
"end": 254,
"text": "(Galley et al. 2004;",
"ref_id": "BIBREF2"
},
{
"start": 255,
"end": 272,
"text": "Liu et al., 2006)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related work",
"sec_num": "2"
},
{
"text": "In this section, we first explain what a packed forest is and then define the concept of the tree sequence in the context of forest followed by the discussion on our proposed model.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Forest-based tree sequence to string model",
"sec_num": "3"
},
{
"text": "A packed forest (forest in short) is a special kind of hyper-graph (Klein and Manning, 2001; Huang and Chiang, 2005) , which is used to represent all derivations (i.e. parse trees) for a given sentence under a context free grammar (CFG). A forest F is defined as a triple , , , where is non-terminal node set, is hyper-edge set and is leaf node set (i.e. all sentence words). A forest F satisfies the following two conditions:",
"cite_spans": [
{
"start": 67,
"end": 92,
"text": "(Klein and Manning, 2001;",
"ref_id": "BIBREF8"
},
{
"start": 93,
"end": 116,
"text": "Huang and Chiang, 2005)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Packed Forest",
"sec_num": "3.1"
},
{
"text": "1) Each node in should cover a phrase, which is a continuous word sub-sequence in .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Packed Forest",
"sec_num": "3.1"
},
{
"text": "2) Each hyper-edge in is defined as \u2026 \u2026 , , , where \u2026 \u2026 covers a sequence of continuous and non-overlap phrases, is the father node of the children sequence \u2026 \u2026 . The phrase covered by is just the sum of all the phrases covered by each child node .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Packed Forest",
"sec_num": "3.1"
},
{
"text": "We here introduce another concept that is used in our subsequent discussions. A complete forest CF is a general forest with one additional condition that there is only one root node N in CF, i.e., all nodes except the root N in a CF must have at least one father node. Fig. 1 is a complete forest while Fig. 7 is a non-complete forest due to the virtual node \"VV+VV\" introduced in Fig. 7. Fig. 2 is a hyperedge (IP => NP VP) of Fig. 1 , where NP covers the phrase \"Xinhuashe\", VP covers the phrase \"shengming youguan guiding\" and IP covers the entire sentence. In Fig.1 , only root IP has no father node, so it is a complete forest. The two parse trees T1 and T2 encoded in Fig. 1 are shown separately in Fig. 3 and Fig. 4 1 .",
"cite_spans": [],
"ref_spans": [
{
"start": 269,
"end": 275,
"text": "Fig. 1",
"ref_id": "FIGREF0"
},
{
"start": 303,
"end": 309,
"text": "Fig. 7",
"ref_id": "FIGREF2"
},
{
"start": 381,
"end": 395,
"text": "Fig. 7. Fig. 2",
"ref_id": "FIGREF2"
},
{
"start": 428,
"end": 434,
"text": "Fig. 1",
"ref_id": "FIGREF0"
},
{
"start": 564,
"end": 569,
"text": "Fig.1",
"ref_id": "FIGREF0"
},
{
"start": 674,
"end": 680,
"text": "Fig. 1",
"ref_id": "FIGREF0"
},
{
"start": 705,
"end": 711,
"text": "Fig. 3",
"ref_id": null
},
{
"start": 716,
"end": 722,
"text": "Fig. 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Packed Forest",
"sec_num": "3.1"
},
{
"text": "Different parse tree represents different derivations and explanations for a given sentence. For example, for the same input sentence in Fig. 1 , T1 interprets it as \"XNA (Xinhua News Agency) declares some regulations.\" while T2 interprets it as \"XNA declaration is related to some regulations.\". ",
"cite_spans": [],
"ref_spans": [
{
"start": 137,
"end": 144,
"text": "Fig. 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Packed Forest",
"sec_num": "3.1"
},
{
"text": "Similar to the definition of tree sequence used in a single parse tree defined in Liu et al. (2007) and Zhang et al. (2008a) , a tree sequence in a forest also refers to an ordered sub-tree sequence that covers a continuous phrase without overlapping. However, the major difference between them lies in that the sub-trees of a tree sequence in forest may belongs to different single parse trees while, in a single parse tree-based model, all the sub-trees in a tree sequence are committed to the same parse tree. The forest-based tree sequence enables our model to have the potential of exploring additional parse trees that may be wrongly pruned out by the parser and thus are not encoded in the forest. This is because that a tree sequence in a forest allows its sub-trees coming from different parse trees, where these sub-trees may not be merged finally to form a complete parse tree in the forest. Take the forest in Fig. 1 as an example, where ((VV shengming) (JJ youguan)) is a tree sequence that all sub-trees appear in T1 while ((VV shengming) (VV youguan)) is a tree sequence whose sub-trees do not belong to any single tree in the forest. But, indeed the two subtrees (VV shengming) and (VV youguan) can be merged together and further lead to a complete single parse tree which may offer a correct interpretation to the input sentence (as shown in Fig. 5 ). In addition, please note that, on the other hand, more parse trees may introduce more noisy structures. In this paper, we leave this problem to our model and let the model decide which substructures are noisy features. Figure 5 . A parse tree that was wrongly pruned out Figure 6 . A tree sequence to string rule A tree-sequence to string translation rule in a forest is a triple <L, R, A>, where L is the tree sequence in source language, R is the string containing words and variables in target language, and A is the alignment between the leaf nodes of L and R. This definition is similar to that of (Liu et al. 2007 , Zhang et al. 2008a ) except our treesequence is defined in forest. The shaded area of Fig. 6 exemplifies a tree sequence to string translation rule in the forest.",
"cite_spans": [
{
"start": 82,
"end": 99,
"text": "Liu et al. (2007)",
"ref_id": "BIBREF12"
},
{
"start": 104,
"end": 124,
"text": "Zhang et al. (2008a)",
"ref_id": "BIBREF21"
},
{
"start": 1973,
"end": 1989,
"text": "(Liu et al. 2007",
"ref_id": "BIBREF12"
},
{
"start": 1990,
"end": 2010,
"text": ", Zhang et al. 2008a",
"ref_id": "BIBREF21"
}
],
"ref_spans": [
{
"start": 922,
"end": 928,
"text": "Fig. 1",
"ref_id": "FIGREF0"
},
{
"start": 1359,
"end": 1366,
"text": "Fig. 5",
"ref_id": null
},
{
"start": 1589,
"end": 1597,
"text": "Figure 5",
"ref_id": null
},
{
"start": 1641,
"end": 1649,
"text": "Figure 6",
"ref_id": null
},
{
"start": 2078,
"end": 2084,
"text": "Fig. 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Tree sequence in packed forest",
"sec_num": "3.2"
},
{
"text": "Given a source forest F and target translation T S as well as word alignment A, our translation model is formulated as:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Forest-based tree-sequence to string translation model",
"sec_num": "3.3"
},
{
"text": "Pr , , \u2211 \u220f , , ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Forest-based tree-sequence to string translation model",
"sec_num": "3.3"
},
{
"text": "By the above Eq., translation becomes a tree sequence structure to string mapping issue. Given the F, T S and A, there are multiple derivations that could map F to T S under the constraint A. The mapping probability Pr , , in our study is obtained by summing over the probabilities of all derivations \u0398. The probability of each derivation is given as the product of the probabilities of all the rules ( ) i p r used in the derivation (here we assume that each rule is applied independently in a derivation).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Forest-based tree-sequence to string translation model",
"sec_num": "3.3"
},
{
"text": "Our model is implemented under log-linear framework (Och and Ney, 2002) . We use seven basic features that are analogous to the commonly used features in phrase-based systems (Koehn, 2003) : 1) bidirectional rule mapping probabilities, 2) bidirectional lexical rule translation probabilities, 3) target language model, 4) number of rules used and 5) number of target words. In addition, we define two new features: 1) number of leaf nodes in auxiliary rules (the auxiliary rule will be explained later in this paper) and 2) product of the probabilities of all hyper-edges of the tree sequences in forest.",
"cite_spans": [
{
"start": 52,
"end": 71,
"text": "(Och and Ney, 2002)",
"ref_id": "BIBREF15"
},
{
"start": 175,
"end": 188,
"text": "(Koehn, 2003)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Forest-based tree-sequence to string translation model",
"sec_num": "3.3"
},
{
"text": "This section discusses how to extract our translation rules given a triple , , . As we know, the traditional tree-to-string rules can be easily extracted from , , using the algorithm of 2 . We would like to leverage on their algorithm in our study. Unfortunately, their algorithm is not directly applicable to our problem because tree rules have only one root while tree sequence rules have multiple roots. This makes the tree sequence rule extraction very complex due to its interaction with forest structure. To address this issue, we introduce the concepts of virtual node and virtual hyperedge to convert a complete parse forest to a non-complete forest which is designed to encode all the tree sequences that we want. Therefore, by doing so, the tree sequence rules can be extracted from a forest in the following two steps:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4"
},
{
"text": "1) Convert the complete parse forest into a non-complete forest in order to cover those tree sequences that cannot be covered by a single tree node.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4"
},
{
"text": "2) Employ the forest-based tree rule extraction algorithm to extract our rules from the non-complete forest.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4"
},
{
"text": "To facilitate our discussion, here we introduce two notations:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4"
},
{
"text": "\u2022 Alignable: A consecutive source phrase is an alignable phrase if and only if it can be aligned with at least one consecutive target phrase under the word-alignment constraint. The covered source span is called alignable span. \u2022 Node sequence: a sequence of nodes (either leaf or internal nodes) in a forest covering a consecutive span. Algorithm 1 illustrates the first step of our rule extraction algorithm, which is a CKY-style Dynamic Programming (DP) algorithm to add virtual nodes into forest. It includes the following steps: 1) We traverse the forest to visit each span in bottom-up fashion (line 1-2), 1.1) for each span [u,v] that is covered by single tree nodes 3 , we put these tree nodes into the set NSS (u,v) and go back to step 1 (line 4-6). 1.2) otherwise we concatenate the tree sequences of sub-spans to generate the set of tree sequences covering the current larger span (line 8-13). Then, we prune the set of node sequences (line 14). If this span is alignable, we create virtual father nodes and corresponding virtual hyper-edges to link the node sequences with the virtual father nodes (line 15-20).",
"cite_spans": [
{
"start": 631,
"end": 636,
"text": "[u,v]",
"ref_id": null
},
{
"start": 719,
"end": 724,
"text": "(u,v)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4"
},
{
"text": "2) Finally we obtain a forest with each alignable span covered by either original tree nodes or the newly-created tree sequence virtual nodes. Theoretically, there is exponential number of node sequences in a forest. Take Fig. 7 as an example. The NSS of span [1,2] only contains \"NP\" since it is alignable and covered by the single tree node NP. However, span [2,3] cannot be covered by any single tree node, so we have to create the NSS of span [2, 3] by concatenating the NSSs of span [2, 2] and span [3, 3] . Since NSS of span [2,2] contains 4 element {\"NN\", \"NP\", \"VV\", \"VP\"} and NSS of span [3, 3] also contains 4 element {\"VV\", \"VP\", \"JJ\", \"ADJP\"}, NSS of span [2,3] contains 16=4*4 elements. To make the NSS manageable, we prune it with the following thresholds:",
"cite_spans": [
{
"start": 447,
"end": 450,
"text": "[2,",
"ref_id": null
},
{
"start": 451,
"end": 453,
"text": "3]",
"ref_id": null
},
{
"start": 488,
"end": 491,
"text": "[2,",
"ref_id": null
},
{
"start": 492,
"end": 494,
"text": "2]",
"ref_id": null
},
{
"start": 504,
"end": 507,
"text": "[3,",
"ref_id": null
},
{
"start": 508,
"end": 510,
"text": "3]",
"ref_id": null
}
],
"ref_spans": [
{
"start": 222,
"end": 228,
"text": "Fig. 7",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Training",
"sec_num": "4"
},
{
"text": "\u2022 each node sequence should contain less than n nodes \u2022 each node sequence set should contain less than m node sequences \u2022 sort node sequences according to their lengths and only keep the k shortest ones Each virtual node is simply labeled by the concatenation of all its children's labels as shown in Fig. 7 Algorithm 1 outputs a non-complete forest CF with each alignable span covered by either tree nodes or virtual nodes. Then we can easily ex-tract our rules from the CF using the tree rule extraction algorithm .",
"cite_spans": [],
"ref_spans": [
{
"start": 302,
"end": 308,
"text": "Fig. 7",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Training",
"sec_num": "4"
},
{
"text": "Finally, to calculate rule feature probabilities for our model, we need to calculate the fractional counts (it is a kind of probability defined in of each translation rule in a parse forest. In the tree case, we can use the inside-outside-based methods to do it. In the tree sequence case, since the previous method cannot be used directly, we provide another solution by making an independent assumption that each tree in a tree sequence is independent to each other. With this assumption, the fractional counts of both tree and tree sequence can be calculated as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4"
},
{
"text": "where is the fractional counts to be calculated for rule r, a frag is either lhs(r) (excluding virtual nodes and virtual hyper-edges) or any tree node in a forest, TOP is the root of the forest, . and .) are the outside and inside probabilities of nodes,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4"
},
{
"text": ". returns the root nodes of a tree sequence fragment,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4"
},
{
"text": ". returns the leaf nodes of a tree sequence fragment, is the hyper-edge probability. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Training",
"sec_num": "4"
},
{
"text": "We benefit from the same strategy as used in our rule extraction algorithm in designing our decoding algorithm, recasting the forest-based tree sequence-to-string decoding problem as a forestbased tree-to-string decoding problem. Our decoding algorithm consists of four steps: 1) Convert the complete parse forest to a noncomplete one by introducing virtual nodes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "2) Convert the non-complete parse forest into a translation forest 4 by using the translation rules and the pattern-matching algorithm presented in .",
"cite_spans": [
{
"start": 67,
"end": 68,
"text": "4",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "3) Prune out redundant nodes and add auxiliary hyper-edge into the translation forest for those nodes that have either no child or no father. By this step, the translation forest becomes a complete forest. 4) Decode the translation forest using our translation model and a dynamic search algorithm.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "The process of step 1 is similar to Algorithm 1 except no alignment constraint used here. This may generate a large number of additional virtual nodes; however, all redundant nodes will be filtered out in step 3. In step 2, we employ the treeto-string pattern match algorithm to convert a parse forest to a translation forest. In step 3, all those nodes not covered by any translation rules are removed. In addition, please note that the translation forest is already not a complete forest due to the virtual nodes and the pruning of rule-unmatchable nodes. We, therefore, propose Algorithm 2 to add auxiliary hyper-edges to make the translation forest complete.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "In Algorithm 2, we travel the forest in bottomup fashion (line 4-5). For each span, we do: 1) generate all the NSS for this span (line 7-12) 2) filter the NSS to a manageable size (line 13) 3) add auxiliary hyper-edges for the current span (line 15-19) if it can be covered by at least one single tree node, otherwise go to step 1 . This is the key step in our Algorithm 2. For each tree node and each node sequences covering the same span (stored in the current NSS), if the tree node has no children or at least one node in the node sequence has no father, we add an auxiliary hyper-edge to connect the tree node as father node with the node sequence as children. Since Algorithm 2 is DP-based and traverses the forest in a bottom-up way, all the nodes in a node sequence should already have children node after the lower level process in a small span. Finally, we re-build the NSS of current span for upper level NSS combination use (line 20-22).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "In Fig. 8 , the hyper-edge \"IP=>NP VV+VV NP\" is an auxiliary hyper-edge introduced by Algorithm 2. By Algorithm 2, we convert the translation forest into a complete translation forest. We then use a bottom-up node-based search algorithm to do decoding on the complete translation forest. We also use Cube Pruning algorithm (Huang and Chiang 2007) to speed up the translation process. Figure 8 . Auxiliary hyper-edge in a translation forest Algorithm 2. add auxiliary hyper-edges into mt forest F Input: mt forest F Output: complete forest F with auxiliary hyper-edges",
"cite_spans": [
{
"start": 323,
"end": 346,
"text": "(Huang and Chiang 2007)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [
{
"start": 3,
"end": 9,
"text": "Fig. 8",
"ref_id": null
},
{
"start": 384,
"end": 392,
"text": "Figure 8",
"ref_id": null
}
],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "1. for i := 1 to L do 2. for each node n of span [i, i] do 3. add n into NSS(i, i) 4. for length := 1 to L -1 do 5.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "for start := 1 to L -length do 6. stop := start + length 7.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "for pivot := start to stop-1 do 8.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "for each ns1 in NSS (start, pivot) do 9.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "for each ns2 in NSS (pivot+1,stop) do 10.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "create 1 2 11.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "if ns is not in NSS(start, stop) then 12.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "add ns into NSS (start, stop) 13.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "do pruning on NSS(start, stop) 14.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "if there is tree node cover span [start, stop] 6 Experiment",
"cite_spans": [
{
"start": 33,
"end": 46,
"text": "[start, stop]",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Decoding",
"sec_num": "5"
},
{
"text": "We evaluate our method on Chinese-English translation task. We use the FBIS corpus as training set, the NIST MT-2002 test set as development (dev) set and the NIST MT-2003 test set as test set. We train Charniak's parser (Charniak 2000) on CTB5 to do Chinese parsing, and modify it to output packed forest. We tune the parser on section 301-325 and test it on section 271-300. The F-measure on all sentences is 80.85%. A 3-gram language model is trained on the Xin-hua portion of the English Gigaword3 corpus and the target side of the FBIS corpus using the SRILM Toolkits (Stolcke, 2002) with modified Kneser-Ney smoothing (Kenser and Ney, 1995) . GIZA++ (Och and Ney, 2003) and the heuristics \"grow-diag-final-and\" are used to generate m-ton word alignments. For the MER training (Och, 2003) , Koehn's MER trainer (Koehn, 2007) is modified for our system. For significance test, we use Zhang et al.'s implementation (Zhang et al, 2004) . Our evaluation metrics is casesensitive BLEU-4 (Papineni et al., 2002) . For parse forest pruning , we utilize the Margin-based pruning algorithm presented in (Huang, 2008) . Different from that use a static pruning threshold, our threshold is sentence-depended. For each sentence, we compute the Margin between the n-th best and the top 1 parse tree, then use the Margin-based pruning algorithm presented in (Huang, 2008) to do pruning. By doing so, we can guarantee to use at least all the top n best parse trees in the forest. However, please note that even after pruning there is still exponential number of additional trees embedded in the forest because of the sharing structure of forest. Other parameters are set as follows: maximum number of roots in a tree sequence is 3, maximum height of a translation rule is 3, maximum number of leaf nodes is 7, maximum number of node sequences on each span is 10, and maximum number of rules extracted from one node is 10000.",
"cite_spans": [
{
"start": 221,
"end": 236,
"text": "(Charniak 2000)",
"ref_id": "BIBREF0"
},
{
"start": 573,
"end": 588,
"text": "(Stolcke, 2002)",
"ref_id": "BIBREF19"
},
{
"start": 624,
"end": 646,
"text": "(Kenser and Ney, 1995)",
"ref_id": "BIBREF7"
},
{
"start": 656,
"end": 675,
"text": "(Och and Ney, 2003)",
"ref_id": "BIBREF17"
},
{
"start": 782,
"end": 793,
"text": "(Och, 2003)",
"ref_id": "BIBREF16"
},
{
"start": 796,
"end": 829,
"text": "Koehn's MER trainer (Koehn, 2007)",
"ref_id": null
},
{
"start": 918,
"end": 937,
"text": "(Zhang et al, 2004)",
"ref_id": "BIBREF23"
},
{
"start": 987,
"end": 1010,
"text": "(Papineni et al., 2002)",
"ref_id": "BIBREF18"
},
{
"start": 1099,
"end": 1112,
"text": "(Huang, 2008)",
"ref_id": "BIBREF3"
},
{
"start": 1349,
"end": 1362,
"text": "(Huang, 2008)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Settings",
"sec_num": "6.1"
},
{
"text": "We implement our proposed methods as a general, configurable platform for syntax-based SMT study. Based on this platform, we are able to easily implement most of the state-of-the-art syntax-based x-to-string SMT methods via simple parameter setting. For training, we set forest pruning threshold to 1 best for tree-based methods and 100 best for forest-based methods. For decoding, we set: 1) TT2S: tree-based tree-to-string model by setting the forest pruning threshold to 1 best and the number of sub-trees in a tree sequence to 1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Results",
"sec_num": "6.2"
},
{
"text": "2) TTS2S: tree-based tree-sequence to string system by setting the forest pruning threshold to 1 best and the maximum number of sub-trees in a tree sequence to 3.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Results",
"sec_num": "6.2"
},
{
"text": "3) FT2S: forest-based tree-to-string system by setting the forest pruning threshold to 500 best, the number of sub-trees in a tree sequence to 1. 4) FTS2S: forest-based tree-sequence to string system by setting the forest pruning threshold to 500 best and the maximum number of sub-trees in a tree sequence to 3. We use the first three syntax-based systems (TT2S, TTS2S, FT2S) and Moses (Koehn et al., 2007) , the state-of-the-art phrase-based system, as our baseline systems. Table 1 compares the performance of the five methods, all of which are fine-tuned. It shows that: 1) FTS2S significantly outperforms (p<0.05) FT2S. This shows that tree sequence is very useful to forest-based model. Although a forest can cover much more phrases than a single tree does, there are still many non-syntactic phrases that cannot be captured by a forest due to structure divergence issue. On the other hand, tree sequence is a good solution to non-syntactic translation equivalence modeling. This is mainly because tree sequence rules are only sensitive to word alignment while tree rules, even extracted from a forest (like in FT2S), are also limited by syntax according to grammar parsing rules.",
"cite_spans": [
{
"start": 387,
"end": 407,
"text": "(Koehn et al., 2007)",
"ref_id": "BIBREF10"
}
],
"ref_spans": [
{
"start": 477,
"end": 484,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experimental Results",
"sec_num": "6.2"
},
{
"text": "2) FTS2S shows significant performance improvement (p<0.05) over TTS2S due to the contribution of forest. This is mainly due to the fact that forest can offer very large number of parse trees for rule extraction and decoder.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Model",
"sec_num": null
},
{
"text": "3) Our model statistically significantly outperforms all the baselines system. This clearly demonstrates the effectiveness of our proposed model for syntax-based SMT. It also shows that the forest-based method and tree sequence-based method are complementary to each other and our proposed method is able to effectively integrate their strengths. 4) All the four syntax-based systems show better performance than Moses and three of them significantly outperforms (p<0.05) Moses. This suggests that syntax is very useful to SMT and translation can be viewed as a structure mapping issue as done in the four syntax-based systems. Table 2 and Table 3 report the distribution of different kinds of translation rules in our model (training forest pruning threshold is set to 100 best) and in our decoding (decoding forest pruning threshold is set to 500 best) for one best translation generation. From the two tables, we can find that: Table 3 . # of rules used to generate one-best translation result in testing 1) In Table 2 , the number of tree sequence rules is much larger than that of tree rules although our rule extraction algorithm only extracts those tree sequence rules over the spans that tree rules cannot cover. This suggests that the non-syntactic structure mapping is still a big challenge to syntax-based SMT.",
"cite_spans": [],
"ref_spans": [
{
"start": 628,
"end": 635,
"text": "Table 2",
"ref_id": null
},
{
"start": 640,
"end": 647,
"text": "Table 3",
"ref_id": null
},
{
"start": 931,
"end": 938,
"text": "Table 3",
"ref_id": null
},
{
"start": 1014,
"end": 1021,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Model",
"sec_num": null
},
{
"text": "2) Table 3 shows that the tree sequence rules is around 9% of the tree rules when generating the one-best translation. This suggests that around 9% of translation equivalences in the test set can be better modeled by tree sequence to string rules than by tree to string rules. The 9% tree sequence rules contribute 1.17 BLEU score improvement (28.83-27.66 in Table 1 ) to FTS2S over FT2S.",
"cite_spans": [],
"ref_spans": [
{
"start": 3,
"end": 10,
"text": "Table 3",
"ref_id": null
},
{
"start": 359,
"end": 366,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Model",
"sec_num": null
},
{
"text": "3) In Table 3 , the fully-lexicalized rules are the major part (around 60%), followed by the partially-lexicalized (around 35%) and unlexicalized (around 15%). However, in Table 2 , partially-lexicalized rules extracted from training corpus are the major part (more than 70%). This suggests that most partially-lexicalized rules are less effective in our model. This clearly directs our future work in model optimization. Table 4 . Impact of the forest pruning Forest pruning is a key step for forest-based method. Table 4 reports the performance of the two forest-based models using different values of the forest pruning threshold for decoding. It shows that: 1) FTS2S significantly outperforms (p<0.05) FT2S consistently in all test cases. This again demonstrates the effectiveness of our proposed model. Even if in the 5000 Best case, tree sequence is still able to contribute 1.1 BLEU score improvement (28.89-27.79) . It indicates the advantage of tree sequence cannot be covered by forest even if we utilize a very large forest.",
"cite_spans": [
{
"start": 908,
"end": 921,
"text": "(28.89-27.79)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 6,
"end": 13,
"text": "Table 3",
"ref_id": null
},
{
"start": 172,
"end": 179,
"text": "Table 2",
"ref_id": null
},
{
"start": 422,
"end": 429,
"text": "Table 4",
"ref_id": null
},
{
"start": 515,
"end": 522,
"text": "Table 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Model",
"sec_num": null
},
{
"text": "N",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "BLEU (%)",
"sec_num": null
},
{
"text": "2) The BLEU scores are very similar to each other when we increase the forest pruning threshold. Moreover, in one case the performance even drops. This suggests that although more parse trees in a forest can offer more structure information, they may also introduce more noise that may confuse the decoder.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "BLEU (%)",
"sec_num": null
},
{
"text": "In this paper, we propose a forest-based treesequence to string translation model to combine the strengths of forest-based methods and treesequence based methods. This enables our model to have the great potential to address the issues of structure divergence and parse errors for syntax-based SMT. We convert our forest-based tree sequence rule extraction and decoding issues to tree-based by introducing virtual nodes, virtual hyper-edges and auxiliary rules (hyper-edges). In our system implementation, we design a general and configurable platform for our method, based on which we can easily realize many previous syntax-based methods. Finally, we examine our methods on the FBIS corpus and the NIST MT-2003 Chinese-English translation task. Experimental results show that our model greatly outperforms the four baseline systems. Our study demonstrates that forest-based method and tree sequence-based method are complementary to each other and our proposed method is able to effectively combine the strengths of the two individual methods for syntax-based SMT.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "7"
},
{
"text": "Please note that a single tree (as T1 and T2 shown inFig. 3andFig. 4) is represented by edges instead of hyper-edges. A hyper-edge is a group of edges satisfying the 2 nd condition as shown in the forest definition.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "extend the tree-based rule extraction algorithm(Galley et al., 2004) to forest-based by introducing non-deterministic mechanism. Their algorithm consists of two steps, minimal rule extraction and composed rule generation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "Note that in a forest, there would be multiple single tree nodes covering the same span as shownFig.1.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "The concept of translation forest is proposed in. It is a forest that consists of only the hyperedges induced from translation rules.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We would like to thank Huang Yun for preparing the pictures in this paper; Run Yan for providing the java version modified MERT program and discussion on the details of MOSES; Mi Haitao for his help and discussion on re-implementing the FT2S model; Sun Jun and Xiong Deyi for their valuable suggestions.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgement",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "A maximum-entropy inspired parser",
"authors": [
{
"first": "Eugene",
"middle": [],
"last": "Charniak",
"suffix": ""
}
],
"year": 2000,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Eugene Charniak. 2000. A maximum-entropy inspired parser. NAACL-00.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Learning non-isomorphic tree mappings for MT. ACL-03 (companion volume)",
"authors": [
{
"first": "Jason",
"middle": [],
"last": "Eisner",
"suffix": ""
}
],
"year": 2003,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jason Eisner. 2003. Learning non-isomorphic tree mappings for MT. ACL-03 (companion volume).",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "What's in a translation rule?",
"authors": [
{
"first": "Michel",
"middle": [],
"last": "Galley",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Hopkins",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Marcu",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michel Galley, Mark Hopkins, Kevin Knight and Da- niel Marcu. 2004. What's in a translation rule? HLT-NAACL-04. 273-280.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Forest Reranking: Discriminative Parsing with Non-Local Features. ACL-HLT-08",
"authors": [
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "586--594",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liang Huang. 2008. Forest Reranking: Discriminative Parsing with Non-Local Features. ACL-HLT-08. 586-594",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Better k-best Parsing. IWPT-05",
"authors": [
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Chiang",
"suffix": ""
}
],
"year": 2005,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liang Huang and David Chiang. 2005. Better k-best Parsing. IWPT-05.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Forest rescoring: Faster decoding with integrated language models",
"authors": [
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "David",
"middle": [],
"last": "Chiang",
"suffix": ""
}
],
"year": 2007,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liang Huang and David Chiang. 2007. Forest rescor- ing: Faster decoding with integrated language models. ACL-07. 144-151",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Statistical Syntax-Directed Translation with Extended Domain of Locality",
"authors": [
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
},
{
"first": "Aravind",
"middle": [],
"last": "Joshi",
"suffix": ""
}
],
"year": 2006,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Liang Huang, Kevin Knight and Aravind Joshi. 2006. Statistical Syntax-Directed Translation with Ex- tended Domain of Locality. AMTA-06. (poster)",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Improved backing-off for M-gram language modeling. ICASSP-95",
"authors": [
{
"first": "Reinhard",
"middle": [],
"last": "Kenser",
"suffix": ""
},
{
"first": "Hermann",
"middle": [],
"last": "Ney",
"suffix": ""
}
],
"year": 1995,
"venue": "",
"volume": "",
"issue": "",
"pages": "181--184",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Reinhard Kenser and Hermann Ney. 1995. Improved backing-off for M-gram language modeling. ICASSP-95. 181-184",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Parsing and Hypergraphs. IWPT",
"authors": [
{
"first": "Dan",
"middle": [],
"last": "Klein",
"suffix": ""
},
{
"first": "Christopher",
"middle": [
"D"
],
"last": "Manning",
"suffix": ""
}
],
"year": 2001,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dan Klein and Christopher D. Manning. 2001. Pars- ing and Hypergraphs. IWPT-2001.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Statistical phrase-based translation",
"authors": [
{
"first": "F",
"middle": [
"J"
],
"last": "Philipp Koehn",
"suffix": ""
},
{
"first": "D",
"middle": [],
"last": "Och",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Marcu",
"suffix": ""
}
],
"year": 2003,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Philipp Koehn, F. J. Och and D. Marcu. 2003. Statis- tical phrase-based translation. HLT-NAACL-03. 127-133.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"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 Bertol- di, Brooke Cowan, Wade Shen, Christine Moran, Richard Zens, Chris Dyer, Ondrej Bojar, Alexandra Constantin and Evan Herbst. 2007. Moses: Open Source Toolkit for Statistical Machine Translation. ACL-07. 177-180. (poster)",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Tree-to-String Alignment Template for Statistical Machine Translation",
"authors": [
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Qun",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Shouxun",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 2006,
"venue": "COLING-ACL-06",
"volume": "",
"issue": "",
"pages": "609--616",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yang Liu, Qun Liu and Shouxun Lin. 2006. Tree-to- String Alignment Template for Statistical Machine Translation. COLING-ACL-06. 609-616.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Forest-to-String Statistical Translation Rules",
"authors": [
{
"first": "Yang",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Yun",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Qun",
"middle": [],
"last": "Liu",
"suffix": ""
},
{
"first": "Shouxun",
"middle": [],
"last": "Lin",
"suffix": ""
}
],
"year": 2007,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yang Liu, Yun Huang, Qun Liu and Shouxun Lin. 2007. Forest-to-String Statistical Translation Rules. ACL-07. 704-711.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Forestbased translation",
"authors": [
{
"first": "Haitao",
"middle": [],
"last": "Mi",
"suffix": ""
},
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Qun",
"middle": [],
"last": "Liu",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Haitao Mi, Liang Huang, and Qun Liu. 2008. Forest- based translation. ACL-HLT-08. 192-199.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Forest-based Translation Rule Extraction",
"authors": [
{
"first": "Haitao",
"middle": [],
"last": "Mi",
"suffix": ""
},
{
"first": "Liang",
"middle": [],
"last": "Huang",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "206--214",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Haitao Mi and Liang Huang. 2008. Forest-based Translation Rule Extraction. EMNLP-08. 206-214.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Discriminative training and maximum entropy models for statistical machine translation",
"authors": [
{
"first": "J",
"middle": [],
"last": "Franz",
"suffix": ""
},
{
"first": "Hermann",
"middle": [],
"last": "Och",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ney",
"suffix": ""
}
],
"year": 2002,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Franz J. Och and Hermann Ney. 2002. Discriminative training and maximum entropy models for statis- tical machine translation. ACL-02. 295-302.",
"links": null
},
"BIBREF16": {
"ref_id": "b16",
"title": "Minimum error rate training in statistical machine translation",
"authors": [
{
"first": "Franz",
"middle": [
"J"
],
"last": "Och",
"suffix": ""
}
],
"year": 2003,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Franz J. Och. 2003. Minimum error rate training in statistical machine translation. ACL-03. 160-167.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "A Systematic Comparison of Various Statistical Alignment Models",
"authors": [
{
"first": "Josef",
"middle": [],
"last": "Franz",
"suffix": ""
},
{
"first": "Hermann",
"middle": [],
"last": "Och",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ney",
"suffix": ""
}
],
"year": 2003,
"venue": "Computational Linguistics",
"volume": "29",
"issue": "1",
"pages": "19--51",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Franz Josef Och and Hermann Ney. 2003. A Syste- matic Comparison of Various Statistical Alignment Models. Computational Linguistics. 29(1) 19-51.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "BLEU: a method for automatic evaluation of machine translation",
"authors": [
{
"first": "Kishore",
"middle": [],
"last": "Papineni",
"suffix": ""
},
{
"first": "Salim",
"middle": [],
"last": "Roukos",
"suffix": ""
},
{
"first": "Toddward",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "Wei-Jing",
"middle": [],
"last": "Zhu",
"suffix": ""
}
],
"year": 2002,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kishore Papineni, Salim Roukos, ToddWard and Wei-Jing Zhu. 2002. BLEU: a method for automat- ic evaluation of machine translation. ACL-02. 311- 318.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "SRILM -an extensible language modeling toolkit. ICSLP-02",
"authors": [
{
"first": "Andreas",
"middle": [],
"last": "Stolcke",
"suffix": ""
}
],
"year": 2002,
"venue": "",
"volume": "",
"issue": "",
"pages": "901--904",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Andreas Stolcke. 2002. SRILM -an extensible lan- guage modeling toolkit. ICSLP-02. 901-904.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "A Tree-to-Tree Alignment-based Model for Statistical Machine Translation",
"authors": [
{
"first": "Min",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Hongfei",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Ai",
"middle": [
"Ti"
],
"last": "Aw",
"suffix": ""
},
{
"first": "Jun",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Sheng",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Chew",
"middle": [],
"last": "Lim Tan",
"suffix": ""
}
],
"year": 2007,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Min Zhang, Hongfei Jiang, Ai Ti Aw, Jun Sun, Sheng Li and Chew Lim Tan. 2007. A Tree-to-Tree Alignment-based Model for Statistical Machine Translation. MT-Summit-07. 535-542.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "A Tree Sequence Alignment-based Tree-to-Tree Translation Model",
"authors": [
{
"first": "Min",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Hongfei",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Aiti",
"middle": [],
"last": "Aw",
"suffix": ""
},
{
"first": "Haizhou",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Sheng",
"middle": [],
"last": "Chew Lim Tan",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Min Zhang, Hongfei Jiang, Aiti Aw, Haizhou Li, Chew Lim Tan, Sheng Li. 2008a. A Tree Sequence Alignment-based Tree-to-Tree Translation Model. ACL-HLT-08. 559-567.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Grammar Comparison Study for Translational Equivalence Modeling and Statistical Machine Translation",
"authors": [
{
"first": "Min",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Hongfei",
"middle": [],
"last": "Jiang",
"suffix": ""
},
{
"first": "Haizhou",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Aiti",
"middle": [],
"last": "Aw",
"suffix": ""
},
{
"first": "Sheng",
"middle": [],
"last": "Li",
"suffix": ""
}
],
"year": 2008,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Min Zhang, Hongfei Jiang, Haizhou Li, Aiti Aw, Sheng Li. 2008b. Grammar Comparison Study for Translational Equivalence Modeling and Statistic- al Machine Translation. COLING-08. 1097-1104.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "terpreting BLEU/NIST scores: How much improvement do we need to have a better system? LREC-04",
"authors": [
{
"first": "Ying",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Stephan",
"middle": [],
"last": "Vogel",
"suffix": ""
},
{
"first": "Alex",
"middle": [],
"last": "Waibel",
"suffix": ""
}
],
"year": 2004,
"venue": "",
"volume": "",
"issue": "",
"pages": "2051--2054",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ying Zhang, Stephan Vogel, Alex Waibel. 2004. In- terpreting BLEU/NIST scores: How much im- provement do we need to have a better system? LREC-04. 2051-2054.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "A packed forest for sentence \"\u65b0\u534e\u793e /Xinhuashe \u58f0 \u660e /shengming \u6709 \u5173 /youguan \u89c4 \u5b9a /guiding\"Figure 2. A hyper-edge used inFig. 1"
},
"FIGREF1": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "Figure 3. Tree 1 (T1) Figure 4. Tree 2 (T2)"
},
"FIGREF2": {
"uris": null,
"type_str": "figure",
"num": null,
"text": "A virtual node in forest"
},
"TABREF0": {
"content": "<table><tr><td colspan=\"3\">Algorithm 1. add virtual nodes into forest</td><td/></tr><tr><td colspan=\"2\">Input: packed forest F, alignment A</td><td/><td/></tr><tr><td colspan=\"2\">Notation:</td><td/><td/></tr><tr><td/><td>L: length of source sentence</td><td/><td/></tr><tr><td/><td colspan=\"3\">NSS(u,v): the set of node sequences covering span [u,v]</td></tr><tr><td/><td colspan=\"3\">VN(ns): virtual father node for node sequence ns.</td></tr><tr><td colspan=\"3\">Output: modified forest F with virtual nodes</td><td/></tr><tr><td colspan=\"2\">1. for length := 0 to L -1 do</td><td/><td/></tr><tr><td>2.</td><td>for start := 1 to L -length do</td><td/><td/></tr><tr><td>3.</td><td>stop := start + length</td><td/><td/></tr><tr><td>4.</td><td colspan=\"3\">if span[start, stop] covered by tree nodes then</td></tr><tr><td>5.</td><td colspan=\"3\">for each node n of span [start, stop] do</td></tr><tr><td>6.</td><td colspan=\"2\">add n into NSS(start, stop)</td><td/></tr><tr><td>7.</td><td>else</td><td/><td/></tr><tr><td>8.</td><td colspan=\"2\">for pivot := start to stop -1</td><td/></tr><tr><td>9.</td><td colspan=\"3\">for each ns1 in NSS(start, pivot) do</td></tr><tr><td>10.</td><td colspan=\"3\">for each ns2 in NSS(pivot+1, stop) do</td></tr><tr><td>11.</td><td>create</td><td>1</td><td>2</td></tr><tr><td>12.</td><td colspan=\"3\">if ns is not in NSS(start, stop) then</td></tr><tr><td>13.</td><td colspan=\"3\">add ns into NSS(start, stop)</td></tr><tr><td>14.</td><td colspan=\"2\">do pruning on NSS(start, stop)</td><td/></tr><tr><td>15.</td><td colspan=\"3\">if the span[start, stop] is alignable then</td></tr><tr><td>16.</td><td colspan=\"3\">for each ns of NSS(start, stop) do</td></tr><tr><td>17.</td><td colspan=\"3\">if node VN(ns) is not in F then</td></tr><tr><td>18.</td><td colspan=\"3\">add node VN(ns) into F</td></tr><tr><td>19.</td><td colspan=\"2\">add a hyper-edge h into F,</td><td/></tr><tr><td>20.</td><td/><td/><td/></tr></table>",
"html": null,
"text": ".",
"type_str": "table",
"num": null
}
}
}
} |