File size: 63,528 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 | {
"paper_id": "P03-1011",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T09:14:09.706701Z"
},
"title": "Loosely Tree-Based Alignment for Machine Translation",
"authors": [
{
"first": "Daniel",
"middle": [],
"last": "Gildea",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "University of Pennsylvania",
"location": {}
},
"email": "dgildea@cis.upenn.edu"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We augment a model of translation based on reordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computational complexity polynomial in the sentence length. This is done by adding a new subtree cloning operation to either tree-to-string or tree-to-tree alignment algorithms.",
"pdf_parse": {
"paper_id": "P03-1011",
"_pdf_hash": "",
"abstract": [
{
"text": "We augment a model of translation based on reordering nodes in syntactic trees in order to allow alignments not conforming to the original tree structure, while keeping computational complexity polynomial in the sentence length. This is done by adding a new subtree cloning operation to either tree-to-string or tree-to-tree alignment algorithms.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Systems for automatic translation between languages have been divided into transfer-based approaches, which rely on interpreting the source string into an abstract semantic representation from which text is generated in the target language, and statistical approaches, pioneered by Brown et al. (1990) , which estimate parameters for a model of word-to-word correspondences and word re-orderings directly from large corpora of parallel bilingual text. Only recently have hybrid approaches begun to emerge, which apply probabilistic models to a structured representation of the source text. Wu (1997) showed that restricting word-level alignments between sentence pairs to observe syntactic bracketing constraints significantly reduces the complexity of the alignment problem and allows a polynomial-time solution. Alshawi et al. (2000) also induce parallel tree structures from unbracketed parallel text, modeling the generation of each node's children with a finite-state transducer. Yamada and Knight (2001) present an algorithm for estimating probabilistic parameters for a similar model which represents translation as a sequence of re-ordering operations over children of nodes in a syntactic tree, using automatic parser output for the initial tree structures. The use of explicit syntactic information for the target language in this model has led to excellent translation results (Yamada and Knight, 2002) , and raises the prospect of training a statistical system using syntactic information for both sides of the parallel corpus.",
"cite_spans": [
{
"start": 282,
"end": 301,
"text": "Brown et al. (1990)",
"ref_id": "BIBREF2"
},
{
"start": 590,
"end": 599,
"text": "Wu (1997)",
"ref_id": "BIBREF12"
},
{
"start": 814,
"end": 835,
"text": "Alshawi et al. (2000)",
"ref_id": "BIBREF0"
},
{
"start": 985,
"end": 1009,
"text": "Yamada and Knight (2001)",
"ref_id": "BIBREF13"
},
{
"start": 1388,
"end": 1413,
"text": "(Yamada and Knight, 2002)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Tree-to-tree alignment techniques such as probabilistic tree substitution grammars (Haji\u010d et al., 2002) can be trained on parse trees from parallel treebanks. However, real bitexts generally do not exhibit parse-tree isomorphism, whether because of systematic differences between how languages express a concept syntactically (Dorr, 1994) , or simply because of relatively free translations in the training material.",
"cite_spans": [
{
"start": 83,
"end": 103,
"text": "(Haji\u010d et al., 2002)",
"ref_id": "BIBREF7"
},
{
"start": 326,
"end": 338,
"text": "(Dorr, 1994)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In this paper, we introduce \"loosely\" tree-based alignment techniques to address this problem. We present analogous extensions for both tree-to-string and tree-to-tree models that allow alignments not obeying the constraints of the original syntactic tree (or tree pair), although such alignments are dispreferred because they incur a cost in probability. This is achieved by introducing a clone operation, which copies an entire subtree of the source language syntactic structure, moving it anywhere in the target language sentence. Careful parameterization of the probability model allows it to be estimated at no additional cost in computational complexity. We expect our relatively unconstrained clone operation to allow for various types of structural divergence by providing a sort of hybrid between tree-based and unstructured, IBM-style models.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We first present the tree-to-string model, followed by the tree-to-tree model, before moving on to alignment results for a parallel syntactically annotated Korean-English corpus, measured in terms of alignment perplexities on held-out test data, and agreement with human-annotated word-level alignments.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "We begin by summarizing the model of Yamada and Knight (2001) , which can be thought of as representing translation as an Alexander Calder mobile. If we follow the process of an English sentence's transformation into French, the English sentence is first given a syntactic tree representation by a statistical parser (Collins, 1999) . As the first step in the translation process, the children of each node in the tree can be re-ordered. For any node with m children, m! re-orderings are possible, each of which is assigned a probability P order conditioned on the syntactic categories of the parent node and its children. As the second step, French words can be inserted at each node of the parse tree. Insertions are modeled in two steps, the first predicting whether an insertion to the left, an insertion to the right, or no insertion takes place with probability P ins , conditioned on the syntactic category of the node and that of its parent. The second step is the choice of the inserted word P t (f |NULL), which is predicted without any conditioning information. The final step, a French translation of each original English word, at the leaves of the tree, is chosen according to a distribution P t (f |e). The French word is predicted conditioned only on the English word, and each English word can generate at most one French word, or can generate a NULL symbol, representing deletion. Given the original tree, the re-ordering, insertion, and translation probabilities at each node are independent of the choices at any other node. These independence relations are analogous to those of a stochastic context-free grammar, and allow for efficient parameter estimation by an inside-outside Expectation Maximization (EM) algorithm. This algorithm has computational complexity O(|T |N m+2 ), where m is the maximum number of children of any node in the input tree T , and N the length of the input string. By storing partially completed arcs in the chart and interleaving the inner two loops, complexity of O(|T |n 3 m!2 m ) can be achieved. Thus, while the algorithm is exponential in m, the fan-out of the grammar, it is polynomial in the size of the input string. Assuming |T | = O(n), the algorithm is O(n 4 ).",
"cite_spans": [
{
"start": 37,
"end": 61,
"text": "Yamada and Knight (2001)",
"ref_id": "BIBREF13"
},
{
"start": 317,
"end": 332,
"text": "(Collins, 1999)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Tree-to-String Model",
"sec_num": "2"
},
{
"text": "The model's efficiency, however, comes at a cost. Not only are many independence assumptions made, but many alignments between source and target sentences simply cannot be represented. As a minimal example, take the tree:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Tree-to-String Model",
"sec_num": "2"
},
{
"text": "A B X Y Z",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Tree-to-String Model",
"sec_num": "2"
},
{
"text": "Of the six possible re-orderings of the three terminals, the two which would involve crossing the bracketing of the original tree (XZY and YZX) are not allowed. While this constraint gives us a way of using syntactic information in translation, it may in many cases be too rigid. In part to deal with this problem, Yamada and Knight (2001) flatten the trees in a pre-processing step by collapsing nodes with the same lexical head-word. This allows, for example, an English subject-verb-object (SVO) structure, which is analyzed as having a VP node spanning the verb and object, to be re-ordered as VSO in a language such as Arabic. Larger syntactic divergences between the two trees may require further relaxation of this constraint, and in practice we expect such divergences to be frequent. For example, a nominal modifier in one language may show up as an adverbial in the other, or, due to choices such as which information is represented by a main verb, the syntactic correspondence between the two sentences may break down completely.",
"cite_spans": [
{
"start": 315,
"end": 339,
"text": "Yamada and Knight (2001)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Tree-to-String Model",
"sec_num": "2"
},
{
"text": "In order to provide some flexibility, we modify the model in order to allow for a copy of a (translated) subtree from the English sentences to occur, with some cost, at any point in the resulting French sentence. For example, in the case of the input tree",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tree-to-String Clone Operation",
"sec_num": "2.1"
},
{
"text": "A B X Y Z",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tree-to-String Clone Operation",
"sec_num": "2.1"
},
{
"text": "a clone operation making a copy of node 3 as a new child of B would produce the tree:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tree-to-String Clone Operation",
"sec_num": "2.1"
},
{
"text": "A B X Z Y Z",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tree-to-String Clone Operation",
"sec_num": "2.1"
},
{
"text": "This operation, combined with the deletion of the original node Z, produces the alignment (XZY) that was disallowed by the original tree reordering model. Figure 1 shows an example from our Korean-English corpus where the clone operation allows the model to handle a case of wh-movement in the English sentence that could not be realized by any reordering of subtrees of the Korean parse. The probability of adding a clone of original node \u03b5 i as a child of node \u03b5 j is calculated in two steps: first, the choice of whether to insert a clone under \u03b5 j , with probability P ins (clone|\u03b5 j ), and the choice of which original node to copy, with probability",
"cite_spans": [],
"ref_spans": [
{
"start": 155,
"end": 163,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Tree-to-String Clone Operation",
"sec_num": "2.1"
},
{
"text": "P clone (\u03b5 i |clone = 1) = P makeclone (\u03b5 i ) k P makeclone (\u03b5 k )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tree-to-String Clone Operation",
"sec_num": "2.1"
},
{
"text": "where P makeclone is the probability of an original node producing a copy. In our implementation, for simplicity, P ins (clone) is a single number, estimated by the EM algorithm but not conditioned on the parent node \u03b5 j , and P makeclone is a constant, meaning that the node to be copied is chosen from all the nodes in the original tree with uniform probability.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tree-to-String Clone Operation",
"sec_num": "2.1"
},
{
"text": "It is important to note that P makeclone is not dependent on whether a clone of the node in question has already been made, and thus a node may be \"reused\" any number of times. This independence assumption is crucial to the computational tractability of the algorithm, as the model can be estimated using the dynamic programming method above, keeping counts for the expected number of times each node has been cloned, at no increase in computational complexity. Without such an assumption, the parameter estimation becomes a problem of parsing with crossing dependencies, which is exponential in the length of the input string (Barton, 1985) .",
"cite_spans": [
{
"start": 627,
"end": 641,
"text": "(Barton, 1985)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Tree-to-String Clone Operation",
"sec_num": "2.1"
},
{
"text": "The tree-to-tree alignment model has tree transformation operations similar to those of the tree-tostring model described above. However, the transformed tree must not only match the surface string of the target language, but also the tree structure assigned to the string by the treebank annotators. In order to provide enough flexibility to make this possible, additional tree transformation operations allow a single node in the source tree to produce two nodes in the target tree, or two nodes in the source tree to be grouped together and produce a single node in the target tree. The model can be thought of as a synchronous tree substitution grammar, with probabilities parameterized to generate the target tree conditioned on the structure of the source tree.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Tree-to-Tree Model",
"sec_num": "3"
},
{
"text": "The probability P (T b |T a ) of transforming the source tree T a into target tree T b is modeled in a sequence of steps proceeding from the root of the target tree down. At each level of the tree:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Tree-to-Tree Model",
"sec_num": "3"
},
{
"text": "1. At most one of the current node's children is grouped with the current node in a single elementary tree, with probability P elem (t a |\u03b5 a \u21d2 children(\u03b5 a )), conditioned on the current node \u03b5 a and its children (ie the CFG production expanding \u03b5 a ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Tree-to-Tree Model",
"sec_num": "3"
},
{
"text": "2. An alignment of the children of the current elementary tree is chosen, with probability P align (\u03b1|\u03b5 a \u21d2 children(t a )). This alignment operation is similar to the re-order operation in the tree-to-string model, with the extension that 1) the alignment \u03b1 can include insertions and deletions of individual children, as nodes in either the source or target may not correspond to anything on the other side, and 2) in the case where two nodes have been grouped into t a , their children are re-ordered together in one step.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Tree-to-Tree Model",
"sec_num": "3"
},
{
"text": "In the final step of the process, as in the tree-tostring model, lexical items at the leaves of the tree are translated into the target language according to a distribution P t (f |e).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Tree-to-Tree Model",
"sec_num": "3"
},
{
"text": "Allowing non-1-to-1 correspondences between nodes in the two trees is necessary to handle the fact that the depth of corresponding words in the two trees often differs. A further consequence of allowing elementary trees of size one or two is that some reorderings not allowed when reordering the children of each individual node separately are now possible. For example, with our simple tree A B X Y Z if nodes A and B are considered as one elementary tree, with probability P elem (t a |A \u21d2 BZ), their collective children will be reordered with probability",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Tree-to-Tree Model",
"sec_num": "3"
},
{
"text": "P align ({(1, 1)(2, 3)(3, 2)}|A \u21d2 XYZ) A X Z Y",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Tree-to-Tree Model",
"sec_num": "3"
},
{
"text": "giving the desired word ordering XZY. However, computational complexity as well as data sparsity prevent us from considering arbitrarily large elementary trees, and the number of nodes considered at once still limits the possible alignments. For example, with our maximum of two nodes, no transformation of the tree",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Tree-to-Tree Model",
"sec_num": "3"
},
{
"text": "A B W X C Y Z",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Tree-to-Tree Model",
"sec_num": "3"
},
{
"text": "is capable of generating the alignment WYXZ. In order to generate the complete target tree, one more step is necessary to choose the structure on the target side, specifically whether the elementary tree has one or two nodes, what labels the nodes have, and, if there are two nodes, whether each child attaches to the first or the second. Because we are ultimately interested in predicting the correct target string, regardless of its structure, we do not assign probabilities to these steps. The nonterminals on the target side are ignored entirely, and while the alignment algorithm considers possible pairs of nodes as elementary trees on the target side during training, the generative probability model should be thought of as only generating single nodes on the target side. Thus, the alignment algorithm is constrained by the bracketing on the target side, but does not generate the entire target tree structure. While the probability model for tree transformation operates from the top of the tree down, probability estimation for aligning two trees takes place by iterating through pairs of nodes from each tree in bottom-up order, as sketched below: The outer two loops, iterating over nodes in each tree, require O(|T | 2 ). Because we restrict our elementary trees to include at most one child of the root node on either side, choosing elementary trees for a node pair is O(m 2 ), where m refers to the maximum number of children of a node. Computing the alignment between the 2m children of the elementary tree on either side requires choosing which subset of source nodes to delete, O(2 2m ), which subset of target nodes to insert (or clone), O(2 2m ), and how to reorder the remaining nodes from source to target tree, O((2m)!). Thus overall complexity of the algorithm is O(|T | 2 m 2 4 2m (2m)!), quadratic in the size of the input sentences, but exponential in the fan-out of the grammar.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Tree-to-Tree Model",
"sec_num": "3"
},
{
"text": "Allowing m-to-n matching of up to two nodes on either side of the parallel treebank allows for limited non-isomorphism between the trees, as in Haji\u010d et al. (2002) . However, even given this flexibility, requiring alignments to match two input trees rather than one often makes tree-to-tree alignment more constrained than tree-to-string alignment. For example, even alignments with no change in word order may not be possible if the structures of the two trees are radically mismatched. This leads us to think it may be helpful to allow departures from Tree-to-String Tree-to-Tree elementary tree grouping P elem (t a |\u03b5 a \u21d2 children(\u03b5 a )) re-order P order (\u03c1|\u03b5 \u21d2 children(\u03b5)) P align (\u03b1|\u03b5 a \u21d2 children(t a )) insertion P ins (left, right, none|\u03b5) \u03b1 can include \"insertion\" symbol lexical translation P t (f |e) P t (f |e) with cloning P ins (clone|\u03b5) \u03b1 can include \"clone\" symbol P makeclone (\u03b5) P makeclone (\u03b5) For this reason, we introduce a clone operation, which allows a copy of a node from the source tree to be made anywhere in the target tree. After the clone operation takes place, the transformation of source into target tree takes place using the tree decomposition and subtree alignment operations as before. The basic algorithm of the previous section remains unchanged, with the exception that the alignments \u03b1 between children of two elementary trees can now include cloned, as well as inserted, nodes on the target side. Given that \u03b1 specifies a new cloned node as a child of \u03b5 j , the choice of which node to clone is made as in the tree-to-string model:",
"cite_spans": [
{
"start": 144,
"end": 163,
"text": "Haji\u010d et al. (2002)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Tree-to-Tree Clone Operation",
"sec_num": "3.1"
},
{
"text": "P clone (\u03b5 i |clone \u2208 \u03b1) = P makeclone (\u03b5 i )",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tree-to-Tree Clone Operation",
"sec_num": "3.1"
},
{
"text": "k P makeclone (\u03b5 k ) Because a node from the source tree is cloned with equal probability regardless of whether it has already been \"used\" or not, the probability of a clone operation can be computed under the same dynamic programming assumptions as the basic tree-to-tree model. As with the tree-to-string cloning operation, this independence assumption is essential to keep the complexity polynomial in the size of the input sentences.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Tree-to-Tree Clone Operation",
"sec_num": "3.1"
},
{
"text": "For reference, the parameterization of all four models is summarized in Table 1 .",
"cite_spans": [],
"ref_spans": [
{
"start": 72,
"end": 79,
"text": "Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "Tree-to-Tree Clone Operation",
"sec_num": "3.1"
},
{
"text": "For our experiments, we used a parallel Korean-English corpus from the military domain (Han et al., 2001 ). Syntactic trees have been annotated by hand for both the Korean and English sentences; in this paper we will be using only the Korean trees, modeling their transformation into the English text. The corpus contains 5083 sentences, of which we used 4982 as training data, holding out 101 sentences for evaluation. The average Korean sentence length was 13 words. Korean is an agglutinative language, and words often contain sequences of meaning-bearing suffixes. For the purposes of our model, we represented the syntax trees using a fairly aggressive tokenization, breaking multimorphemic words into separate leaves of the tree. This gave an average of 21 tokens for the Korean sentences. The average English sentence length was 16. The maximum number of children of a node in the Korean trees was 23 (this corresponds to a comma-separated list of items). 77% of the Korean trees had no more than four children at any node, 92% had no more than five children, and 96% no more than six children. The vocabulary size (number of unique types) was 4700 words in English, and 3279 in Koreanbefore splitting multi-morphemic words, the Korean vocabulary size was 10059. For reasons of computation speed, trees with more than 5 children were excluded from the experiments described below.",
"cite_spans": [
{
"start": 87,
"end": 104,
"text": "(Han et al., 2001",
"ref_id": "BIBREF8"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Data",
"sec_num": "4"
},
{
"text": "We evaluate our translation models both in terms agreement with human-annotated word-level alignments between the sentence pairs. For scoring the viterbi alignments of each system against goldstandard annotated alignments, we use the alignment error rate (AER) of Och and Ney (2000) where A is the set of word pairs aligned by the automatic system, and G the set aligned in the gold standard. We provide a comparison of the tree-based models with the sequence of successively more complex models of Brown et al. (1993) . Results are shown in Table 2 . The error rates shown in Table 2 represent the minimum over training iterations; training was stopped for each model when error began to increase.",
"cite_spans": [
{
"start": 264,
"end": 282,
"text": "Och and Ney (2000)",
"ref_id": "BIBREF10"
},
{
"start": 499,
"end": 518,
"text": "Brown et al. (1993)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [
{
"start": 542,
"end": 549,
"text": "Table 2",
"ref_id": null
},
{
"start": 577,
"end": 584,
"text": "Table 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Experiments",
"sec_num": "5"
},
{
"text": "IBM Models 1, 2, and 3 refer to Brown et al. (1993) . \"Tree-to-String\" is the model of Yamada and Knight (2001) , and \"Tree-to-String, Clone\" allows the node cloning operation of Section 2.1. \"Tree-to-Tree\" indicates the model of Section 3, while \"Tree-to-Tree, Clone\" adds the node cloning operation of Section 3.1. Model 2 is initialized from the parameters of Model 1, and Model 3 is initialized from Model 2. The lexical translation probabilities P t (f |e) for each of our tree-based models are initialized from Model 1, and the node re-ordering probabilities are initialized uniformly. Figure 1 shows the viterbi alignment produced by the \"Tree-to-String, Clone\" system on one sentence from our test set.",
"cite_spans": [
{
"start": 45,
"end": 51,
"text": "(1993)",
"ref_id": null
},
{
"start": 87,
"end": 111,
"text": "Yamada and Knight (2001)",
"ref_id": "BIBREF13"
}
],
"ref_spans": [
{
"start": 592,
"end": 600,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Experiments",
"sec_num": "5"
},
{
"text": "We found better agreement with the human alignments when fixing P ins (left) in the Tree-to-String model to a constant rather than letting it be determined through the EM training. While the model learned by EM tends to overestimate the total number of aligned word pairs, fixing a higher probability for insertions results in fewer total aligned pairs and therefore a better trade-off between precision and recall. As seen for other tasks (Carroll and Charniak, 1992; Merialdo, 1994) , the likelihood criterion used in EM training may not be optimal when evaluating a system against human labeling. The approach of optimizing a small number of metaparameters has been applied to machine translation by Och and Ney (2002) . It is likely that the IBM models could similarly be optimized to minimize alignment error -an open question is whether the optimization with respect to alignment error will correspond to optimization for translation accuracy.",
"cite_spans": [
{
"start": 440,
"end": 468,
"text": "(Carroll and Charniak, 1992;",
"ref_id": "BIBREF4"
},
{
"start": 469,
"end": 484,
"text": "Merialdo, 1994)",
"ref_id": "BIBREF9"
},
{
"start": 703,
"end": 721,
"text": "Och and Ney (2002)",
"ref_id": "BIBREF11"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "5"
},
{
"text": "Within the strict EM framework, we found roughly equivalent performance between the IBM models and the two tree-based models when making use of the cloning operation. For both the tree-tostring and tree-to-tree models, the cloning operation improved results, indicating that adding the flexibility to handle structural divergence is important when using syntax-based models. The improvement was particularly significant for the tree-to-tree model, because using syntactic trees on both sides of the translation pair, while desirable as an additional source of information, severely constrains possible alignments unless the cloning operation is allowed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "5"
},
{
"text": "The tree-to-tree model has better theoretical complexity than the tree-to-string model, being quadratic rather than quartic in sentence length, and we found this to be a significant advantage in practice. This improvement in speed allows longer sentences and more data to be used in training syntax-based models. We found that when training on sentences of up 60 words, the tree-to-tree alignment was 20 times faster than tree-to-string alignment. For reasons of speed, Yamada and Knight (2002) limited training to sentences of length 30, and were able to use only one fifth of the available Chinese-English parallel corpus.",
"cite_spans": [
{
"start": 470,
"end": 494,
"text": "Yamada and Knight (2002)",
"ref_id": "BIBREF14"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "5"
},
{
"text": "Our loosely tree-based alignment techniques allow statistical models of machine translation to make use of syntactic information while retaining the flexibility to handle cases of non-isomorphic source and target trees. This is achieved with a clone operation parameterized in such a way that alignment probabilities can be computed with no increase in asymptotic computational complexity.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "6"
},
{
"text": "We present versions of this technique both for tree-to-string models, making use of parse trees for one of the two languages, and tree-to-tree models, which make use of parallel parse trees. Results in terms of alignment error rate indicate that the clone operation results in better alignments in both cases. On our Korean-English corpus, we found roughly equivalent performance for the unstructured IBM models, and the both the tree-to-string and tree-totree models when using cloning. To our knowledge these are the first results in the literature for tree-to-tree statistical alignment. While we did not see a benefit in alignment error from using syntactic trees in both languages, there is a significant practical benefit in computational efficiency. We remain hopeful that two trees can provide more information than one, and feel that extensions to the \"loosely\" tree-based approach are likely to demonstrate this using larger corpora.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "6"
},
{
"text": "Another important question we plan to pursue is the degree to which these results will be borne out with larger corpora, and how the models may be refined as more training data is available. As one example, our tree representation is unlexicalized, but we expect conditioning the model on more lexical information to improve results, whether this is done by percolating lexical heads through the existing trees or by switching to a strict dependency representation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "6"
},
{
"text": "WhileOch and Ney (2000) differentiate between sure and possible hand-annotated alignments, our gold standard alignments come in only one variety.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Learning dependency translation models as collections of finite state head transducers. Computational Linguistics",
"authors": [
{
"first": "Hiyan",
"middle": [],
"last": "Alshawi",
"suffix": ""
},
{
"first": "Srinivas",
"middle": [],
"last": "Bangalore",
"suffix": ""
},
{
"first": "Shona",
"middle": [],
"last": "Douglas",
"suffix": ""
}
],
"year": 2000,
"venue": "",
"volume": "26",
"issue": "",
"pages": "45--60",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Hiyan Alshawi, Srinivas Bangalore, and Shona Douglas. 2000. Learning dependency translation models as col- lections of finite state head transducers. Computa- tional Linguistics, 26(1):45-60.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "On the complexity of ID/LP parsing",
"authors": [
{
"first": "G",
"middle": [
"Edward"
],
"last": "Barton",
"suffix": ""
},
{
"first": "Jr",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 1985,
"venue": "Computational Linguistics",
"volume": "11",
"issue": "4",
"pages": "205--218",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "G. Edward Barton, Jr. 1985. On the complexity of ID/LP parsing. Computational Linguistics, 11(4):205-218.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "A statistical approach to machine translation",
"authors": [
{
"first": "F",
"middle": [],
"last": "Peter",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Brown",
"suffix": ""
},
{
"first": "Stephen",
"middle": [
"A Della"
],
"last": "Cocke",
"suffix": ""
},
{
"first": "Vincent",
"middle": [
"J Della"
],
"last": "Pietra",
"suffix": ""
},
{
"first": "Frederick",
"middle": [],
"last": "Pietra",
"suffix": ""
},
{
"first": "John",
"middle": [
"D"
],
"last": "Jelinek",
"suffix": ""
},
{
"first": "Robert",
"middle": [
"L"
],
"last": "Lafferty",
"suffix": ""
},
{
"first": "Paul",
"middle": [
"S"
],
"last": "Mercer",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Roossin",
"suffix": ""
}
],
"year": 1990,
"venue": "Computational Linguistics",
"volume": "16",
"issue": "2",
"pages": "79--85",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peter F. Brown, John Cocke, Stephen A. Della Pietra, Vincent J. Della Pietra, Frederick Jelinek, John D. Laf- ferty, Robert L. Mercer, and Paul S. Roossin. 1990. A statistical approach to machine translation. Computa- tional Linguistics, 16(2):79-85, June.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "The mathematics of statistical machine translation: Parameter estimation",
"authors": [
{
"first": "F",
"middle": [],
"last": "Peter",
"suffix": ""
},
{
"first": "Stephen",
"middle": [
"A Della"
],
"last": "Brown",
"suffix": ""
},
{
"first": "Vincent",
"middle": [
"J"
],
"last": "Pietra",
"suffix": ""
},
{
"first": "Robert",
"middle": [
"L"
],
"last": "Della Pietra",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Mercer",
"suffix": ""
}
],
"year": 1993,
"venue": "Computational Linguistics",
"volume": "19",
"issue": "2",
"pages": "263--311",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Peter F. Brown, Stephen A. Della Pietra, Vincent J. Della Pietra, and Robert L. Mercer. 1993. The mathematics of statistical machine translation: Parameter estima- tion. Computational Linguistics, 19(2):263-311.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Two experiments on learning probabilistic dependency grammars from corpora",
"authors": [
{
"first": "Glenn",
"middle": [],
"last": "Carroll",
"suffix": ""
},
{
"first": "Eugene",
"middle": [],
"last": "Charniak",
"suffix": ""
}
],
"year": 1992,
"venue": "Workshop Notes for Statistically-Based NLP Techniques",
"volume": "",
"issue": "",
"pages": "1--13",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Glenn Carroll and Eugene Charniak. 1992. Two experi- ments on learning probabilistic dependency grammars from corpora. In Workshop Notes for Statistically- Based NLP Techniques, pages 1-13. AAAI.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Head-driven Statistical Models for Natural Language Parsing",
"authors": [
{
"first": "Michael John",
"middle": [],
"last": "",
"suffix": ""
},
{
"first": "Collins",
"middle": [],
"last": "",
"suffix": ""
}
],
"year": 1999,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Michael John Collins. 1999. Head-driven Statistical Models for Natural Language Parsing. Ph.D. thesis, University of Pennsylvania, Philadelphia.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Machine translation divergences: A formal description and proposed solution",
"authors": [
{
"first": "Bonnie",
"middle": [
"J"
],
"last": "Dorr",
"suffix": ""
}
],
"year": 1994,
"venue": "Computational Linguistics",
"volume": "20",
"issue": "4",
"pages": "597--633",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bonnie J. Dorr. 1994. Machine translation divergences: A formal description and proposed solution. Compu- tational Linguistics, 20(4):597-633.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Natural language generation in the context of machine translation",
"authors": [
{
"first": "Jan",
"middle": [],
"last": "Haji\u010d",
"suffix": ""
},
{
"first": "Bonnie",
"middle": [],
"last": "Martin\u010dmejrek",
"suffix": ""
},
{
"first": "Yuan",
"middle": [],
"last": "Dorr",
"suffix": ""
},
{
"first": "Jason",
"middle": [],
"last": "Ding",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Eisner",
"suffix": ""
},
{
"first": "Terry",
"middle": [],
"last": "Gildea",
"suffix": ""
},
{
"first": "Kristen",
"middle": [],
"last": "Koo",
"suffix": ""
},
{
"first": "Gerald",
"middle": [],
"last": "Parton",
"suffix": ""
},
{
"first": "Dragomir",
"middle": [],
"last": "Penn",
"suffix": ""
},
{
"first": "Owen",
"middle": [],
"last": "Radev",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Rambow",
"suffix": ""
}
],
"year": 2002,
"venue": "Center for Language and Speech Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jan Haji\u010d, Martin\u010cmejrek, Bonnie Dorr, Yuan Ding, Ja- son Eisner, Daniel Gildea, Terry Koo, Kristen Parton, Gerald Penn, Dragomir Radev, and Owen Rambow. 2002. Natural language generation in the context of machine translation. Technical report, Center for Lan- guage and Speech Processing, Johns Hopkins Univer- sity, Baltimore. Summer Workshop Final Report.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Bracketing guidelines for Penn Korean treebank",
"authors": [
{
"first": "Chung-Hye",
"middle": [],
"last": "Han",
"suffix": ""
},
{
"first": "Na-Rae",
"middle": [],
"last": "Han",
"suffix": ""
},
{
"first": "Eon-Suk",
"middle": [],
"last": "Ko",
"suffix": ""
}
],
"year": 2001,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chung-hye Han, Na-Rae Han, and Eon-Suk Ko. 2001. Bracketing guidelines for Penn Korean treebank. Technical Report IRCS-01-010, IRCS, University of Pennsylvania.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Tagging English text with a probabilistic model",
"authors": [
{
"first": "Bernard",
"middle": [],
"last": "Merialdo",
"suffix": ""
}
],
"year": 1994,
"venue": "Computational Linguistics",
"volume": "20",
"issue": "2",
"pages": "155--172",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bernard Merialdo. 1994. Tagging English text with a probabilistic model. Computational Linguistics, 20(2):155-172.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Improved statistical alignment models",
"authors": [
{
"first": "Josef",
"middle": [],
"last": "Franz",
"suffix": ""
},
{
"first": "Hermann",
"middle": [],
"last": "Och",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ney",
"suffix": ""
}
],
"year": 2000,
"venue": "Proceedings of ACL-00",
"volume": "",
"issue": "",
"pages": "440--447",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Franz Josef Och and Hermann Ney. 2000. Improved statistical alignment models. In Proceedings of ACL- 00, pages 440-447, Hong Kong, October.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Discriminative training and maximum entropy models for statistical machine translation",
"authors": [
{
"first": "Josef",
"middle": [],
"last": "Franz",
"suffix": ""
},
{
"first": "Hermann",
"middle": [],
"last": "Och",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Ney",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of ACL-02",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Franz Josef Och and Hermann Ney. 2002. Discrimina- tive training and maximum entropy models for statis- tical machine translation. In Proceedings of ACL-02, Philadelphia, PA.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"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": "3--403",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dekai Wu. 1997. Stochastic inversion transduction grammars and bilingual parsing of parallel corpora. Computational Linguistics, 23(3):3-403.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "A syntax-based statistical translation model",
"authors": [
{
"first": "Kenji",
"middle": [],
"last": "Yamada",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
}
],
"year": 2001,
"venue": "Proceedings of ACL-01",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kenji Yamada and Kevin Knight. 2001. A syntax-based statistical translation model. In Proceedings of ACL- 01, Toulouse, France.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "A decoder for syntax-based statistical MT",
"authors": [
{
"first": "Kenji",
"middle": [],
"last": "Yamada",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of ACL-02",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kenji Yamada and Kevin Knight. 2002. A decoder for syntax-based statistical MT. In Proceedings of ACL- 02, Philadelphia, PA.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"type_str": "figure",
"uris": null,
"text": "Original Korean parse tree, above, and transformed tree after reordering of children, subtree cloning (indicated by the arrow), and word translation. After the insertion operation (not shown), the tree's English yield is: How many pairs of gloves is each of you issued in winter?"
},
"FIGREF1": {
"num": null,
"type_str": "figure",
"uris": null,
"text": "for all nodes \u03b5a in source tree Ta in bottom-up order do for all elementary trees ta rooted in \u03b5a do for all nodes \u03b5 b in target tree T b in bottom-up order do for all elementary trees t b rooted in \u03b5 b do for all alignments \u03b1 of the children of ta and t b do \u03b2(\u03b5a, \u03b5 b ) += P elem (ta|\u03b5a)P align (\u03b1|\u03b5i) (i,j)\u2208\u03b1 \u03b2(\u03b5i, \u03b5j)"
},
"TABREF0": {
"type_str": "table",
"num": null,
"text": "\u03c1 of the children \u03b51...\u03b5m of \u03b5i do for all partitions of span k, l into k1, l1...km, lm do \u03b2(\u03b5i, k, l)+= P order (\u03c1|\u03b5i)",
"content": "<table><tr><td>original tree in a bottom-up manner:</td></tr><tr><td>for all nodes \u03b5i in input tree T do</td></tr><tr><td>for all k, l such that 1 < k < l < N m j=1 \u03b2(\u03b5j, kj, lj)</td></tr><tr><td>end for</td></tr><tr><td>end for</td></tr><tr><td>end for</td></tr><tr><td>end for</td></tr><tr><td>The</td></tr><tr><td>computation of inside probabilities \u03b2, outlined</td></tr><tr><td>below, considers possible reordering of nodes in the</td></tr></table>",
"html": null
},
"TABREF1": {
"type_str": "table",
"num": null,
"text": "",
"content": "<table><tr><td>: Model parameterization</td></tr></table>",
"html": null
}
}
}
} |