File size: 77,053 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 | {
"paper_id": "C02-1011",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T12:19:17.825297Z"
},
"title": "Base Noun Phrase Translation Using Web Data and the EM Algorithm",
"authors": [
{
"first": "Yunbo",
"middle": [],
"last": "Cao",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Microsoft Research Asia",
"location": {}
},
"email": ""
},
{
"first": "Hang",
"middle": [],
"last": "Li",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Microsoft Research Asia",
"location": {}
},
"email": "hangli@microsoft.com"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We consider here the problem of Base Noun Phrase translation. We propose a new method to perform the task. For a given Base NP, we first search its translation candidates from the web. We next determine the possible translation(s) from among the candidates using one of the two methods that we have developed. In one method, we employ an ensemble of Na\u00efve Bayesian Classifiers constructed with the EM Algorithm. In the other method, we use TF-IDF vectors also constructed with the EM Algorithm. Experimental results indicate that the coverage and accuracy of our method are significantly better than those of the baseline methods relying on existing technologies.",
"pdf_parse": {
"paper_id": "C02-1011",
"_pdf_hash": "",
"abstract": [
{
"text": "We consider here the problem of Base Noun Phrase translation. We propose a new method to perform the task. For a given Base NP, we first search its translation candidates from the web. We next determine the possible translation(s) from among the candidates using one of the two methods that we have developed. In one method, we employ an ensemble of Na\u00efve Bayesian Classifiers constructed with the EM Algorithm. In the other method, we use TF-IDF vectors also constructed with the EM Algorithm. Experimental results indicate that the coverage and accuracy of our method are significantly better than those of the baseline methods relying on existing technologies.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "We address here the problem of Base NP translation, in which for a given Base Noun Phrase in a source language (e.g., 'information age' in English), we are to find out its possible translation(s) in a target language (e.g., ' \u066b ' in Chinese). We define a Base NP as a simple and non-recursive noun phrase. In many cases, Base NPs represent holistic and non-divisible concepts, and thus accurate translation of them from one language to another is extremely important in applications like machine translation, cross language information retrieval, and foreign language writing assistance.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "In this paper, we propose a new method for Base NP translation, which contains two steps: (1) translation candidate collection, and (2) translation selection. In translation candidate collection, for a given Base NP in the source language, we look for its translation candidates in the target language. To do so, we use a word-to-word translation dictionary and corpus data in the target language on the web. In translation selection, we determine the possible translation(s) from among the candidates. We use non-parallel corpus data in the two languages on the web and employ one of the two methods which we have developed. In the first method, we view the problem as that of classification and employ an ensemble of Na\u00efve Bayesian Classifiers constructed with the EM Algorithm. We will use 'EM-NBC-Ensemble' to denote this method, hereafter. In the second method, we view the problem as that of calculating similarities between context vectors and use TF-IDF vectors also constructed with the EM Algorithm. We will use 'EM-TF-IDF' to denote this method.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "Experimental results indicate that our method is very effective, and the coverage and top 3 accuracy of translation at the final stage are 91.4% and 79.8%, respectively. The results are significantly better than those of the baseline methods relying on existing technologies. The higher performance of our method can be attributed to the enormity of the web data used and the employment of the EM Algorithm.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1."
},
{
"text": "A straightforward approach to word or phrase translation is to perform the task by using parallel bilingual corpora (e.g., Brown et al, 1993) . Parallel corpora are, however, difficult to obtain in practice.",
"cite_spans": [
{
"start": 123,
"end": 141,
"text": "Brown et al, 1993)",
"ref_id": "BIBREF1"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Translation with Non-parallel Corpora",
"sec_num": "2.1"
},
{
"text": "To deal with this difficulty, a number of methods have been proposed, which make use of relatively easily obtainable non-parallel corpora (e.g., Fung and Yee, 1998; Rapp, 1999; Diab and Finch, 2000) . Within these methods, it is usually assumed that a number of translation candidates for a word or phrase are given (or can be easily collected) and the problem is focused on translation selection.",
"cite_spans": [
{
"start": 145,
"end": 164,
"text": "Fung and Yee, 1998;",
"ref_id": "BIBREF5"
},
{
"start": 165,
"end": 176,
"text": "Rapp, 1999;",
"ref_id": "BIBREF12"
},
{
"start": 177,
"end": 198,
"text": "Diab and Finch, 2000)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Translation with Non-parallel Corpora",
"sec_num": "2.1"
},
{
"text": "All of the proposed methods manage to find out the translation(s) of a given word or phrase, on the basis of the linguistic phenomenon that the contexts of a translation tend to be similar to the contexts of the given word or phrase. Fung and Yee (1998) , for example, proposed to represent the contexts of a word or phrase with a real-valued vector (e.g., a TF-IDF vector), in which one element corresponds to one word in the contexts. In translation selection, they select the translation candidates whose context vectors are the closest to that of the given word or phrase.",
"cite_spans": [
{
"start": 234,
"end": 253,
"text": "Fung and Yee (1998)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Translation with Non-parallel Corpora",
"sec_num": "2.1"
},
{
"text": "Since the context vector of the word or phrase to be translated corresponds to words in the source language, while the context vector of a translation candidate corresponds to words in the target language, and further the words in the source language and those in the target language have a many-to-many relationship (i.e., translation ambiguities), it is necessary to accurately transform the context vector in the source language to a context vector in the target language before distance calculation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Translation with Non-parallel Corpora",
"sec_num": "2.1"
},
{
"text": "The vector-transformation problem was not, however, well-resolved previously. Fung and Yee assumed that in a specific domain there is only one-to-one mapping relationship between words in the two languages. The assumption is reasonable in a specific domain, but is too strict in the general domain, in which we presume to perform translation here. A straightforward extension of Fung and Yee's assumption to the general domain is to restrict the many-to-many relationship to that of many-to-one mapping (or one-to-one mapping). This approach, however, has a drawback of losing information in vector transformation, as will be described.",
"cite_spans": [
{
"start": 78,
"end": 86,
"text": "Fung and",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Translation with Non-parallel Corpora",
"sec_num": "2.1"
},
{
"text": "For other methods using non-parallel corpora, see also (Tanaka and Iwasaki, 1996; Kikui, 1999, Koehn and Kevin 2000; Sumita 2000; Nakagawa 2001; Gao et al, 2001 ).",
"cite_spans": [
{
"start": 55,
"end": 81,
"text": "(Tanaka and Iwasaki, 1996;",
"ref_id": "BIBREF14"
},
{
"start": 82,
"end": 104,
"text": "Kikui, 1999, Koehn and",
"ref_id": null
},
{
"start": 105,
"end": 116,
"text": "Kevin 2000;",
"ref_id": null
},
{
"start": 117,
"end": 129,
"text": "Sumita 2000;",
"ref_id": "BIBREF13"
},
{
"start": 130,
"end": 144,
"text": "Nakagawa 2001;",
"ref_id": "BIBREF10"
},
{
"start": 145,
"end": 160,
"text": "Gao et al, 2001",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Translation with Non-parallel Corpora",
"sec_num": "2.1"
},
{
"text": "Web is an extremely rich source of data for natural language processing, not only in terms of data size but also in terms of data type (e.g., multilingual data, link data). Recently, a new trend arises in natural language processing, which tries to bring some new breakthroughs to the field by effectively using web data (e.g., Brill et al, 2001 ). Nagata et al (2001) , for example, proposed to collect partial parallel corpus data on the web to create a translation dictionary. They observed that there are many partial parallel corpora between English and Japanese on the web, and most typically English translations of Japanese terms (words or phrases) are parenthesized and inserted immediately after the Japanese terms in documents written in Japanese.",
"cite_spans": [
{
"start": 328,
"end": 345,
"text": "Brill et al, 2001",
"ref_id": "BIBREF0"
},
{
"start": 349,
"end": 368,
"text": "Nagata et al (2001)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Translation Using Web Data",
"sec_num": "2.2"
},
{
"text": "Our method for Base NP translation comprises of two steps: translation candidate collection and translation selection. In translation candidate collection, we look for translation candidates of a given Base NP. In translation selection, we find out possible translation(s) from the translation candidates.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Base Noun Phrase Translation",
"sec_num": "3."
},
{
"text": "In this paper, we confine ourselves to translation of noun-noun pairs from English to Chinese; our method, however, can be extended to translations of other types of Base NPs between other language pairs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Base Noun Phrase Translation",
"sec_num": "3."
},
{
"text": "We use heuristics for translation candidate collection. Figure 1 illustrates the process of collecting Chinese translation candidates for an English Base NP 'information age' with the heuristics. ",
"cite_spans": [],
"ref_spans": [
{
"start": 56,
"end": 64,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Translation Candidate Collection",
"sec_num": "3.1"
},
{
"text": "We view the translation selection problem as that of classification and employ EM-NBC-Ensemble to perform the task. For the ease of explanation, we first describe the algorithm of using only EM-NBC and next extend it to that of using EM-NBC-Ensemble.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Translation Selection --EM-NBC-Ensemble",
"sec_num": "3.2"
},
{
"text": "Let \u1ebd denote the Base NP to be translated and C the set of its translation candidates (phrases). Suppose that . Let e represent a random variable on E and c a random variable on C. Figure 2 describes the algorithm. ",
"cite_spans": [],
"ref_spans": [
{
"start": 181,
"end": 189,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Basic Algorithm",
"sec_num": null
},
{
"text": "k C = | | .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Algorithm",
"sec_num": null
},
{
"text": "Input: \u1ebd , C , contexts containing \u1ebd , contexts containing all C c\u2208 ; 1. create a frequency vector )), ( , ), ( ), ( ( 2 1 m e f e f e f L ) , , 1 ( , m i E e i L = \u2208 using contexts containing \u1ebd ; transforming the vector into )), ( , ), ( ), ( ( 2 1 n E E E c f c f c f L ) , , 1 ( , n i C c i L = \u2208 ,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Algorithm",
"sec_num": null
},
{
"text": ")), ( , ), ( ), ( ( 2 1 n c f c f c f L ) , , 1 ( , n i C c i L = \u2208 using contexts containing c ; normalize the frequency vector , yielding ) , , 1 ( , )), | ( , ), | ( ), | ( ( 2 1 n i C c c c P c c P c c P i n L L = \u2208 ;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Algorithm",
"sec_num": null
},
{
"text": "calculate the posterior probability",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Algorithm",
"sec_num": null
},
{
"text": ") | ( D c P with EM-NBC (generally EM-NBC-Ensemble), where ) , , 1 ( , )), ( , ), ( ), ( ( 2 1 n i C c c f c f c f i n E E E L L = \u2208 = D 3. Sort C c\u2208 in descending order of ) | ( D c P ;",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Algorithm",
"sec_num": null
},
{
"text": "Output: the top sorted results",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Algorithm",
"sec_num": null
},
{
"text": "As input data, we use 'contexts' in English which contain the phrase to be translated. We also use contexts in Chinese which contain the translation candidates.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Context Information",
"sec_num": null
},
{
"text": "Here, a context containing a phrase is defined as the surrounding words within a window of a predetermined size, which window covers the phrase. We can easily obtain the data by searching for them on the web. Actually, the contexts containing the candidates are obtained at the same time when we conduct translation candidate collection (Step 4 in Figure 1 ).",
"cite_spans": [],
"ref_spans": [
{
"start": 348,
"end": 356,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Context Information",
"sec_num": null
},
{
"text": "We define a relation between E and C as C E R \u00d7 \u2286",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM Algorithm",
"sec_num": null
},
{
"text": ", which represents the links in a translation dictionary. We further define } ) , 1We estimate the parameters of the distribution by using the Expectation and Maximization (EM) Algorithm (Dempster et al., 1977) .",
"cite_spans": [
{
"start": 187,
"end": 210,
"text": "(Dempster et al., 1977)",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "EM Algorithm",
"sec_num": null
},
{
"text": "( | { R c",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM Algorithm",
"sec_num": null
},
{
"text": "Initially, we set for all C c \u2208 Next, we estimate the parameters by iteratively updating them, until they converge (cf., Figure 3) . Finally, we calculate ) (c f E for all C c \u2208 as:",
"cite_spans": [],
"ref_spans": [
{
"start": 121,
"end": 130,
"text": "Figure 3)",
"ref_id": null
}
],
"eq_spans": [],
"section": "EM Algorithm",
"sec_num": null
},
{
"text": "| | 1 ) ( C c P = , \uf8f4 \uf8f3 \uf8f4 \uf8f2 \uf8f1 \u0393 \u2209 \u0393 \u2208 \u0393 =",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM Algorithm",
"sec_num": null
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "\u2211 \u2208 = E e E e f c P c f ) ( ) ( ) (",
"eq_num": "(2)"
}
],
"section": "EM Algorithm",
"sec_num": null
},
{
"text": "In this way, we can transform the frequency vector in English",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM Algorithm",
"sec_num": null
},
{
"text": ")) ( ),.., ( ), ( ( 2 1 m e f e f e f into a vector in Chinese )) ( ),.., ( ), ( ( 2 1 n E E E c f c f c f = D .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM Algorithm",
"sec_num": null
},
{
"text": "Step 2, we approximately estimate the prior probability ) (c P by using the document frequencies of the translation candidates. The data are obtained when we conduct candidate collection (Step 4 in Figure 1 ). ",
"cite_spans": [],
"ref_spans": [
{
"start": 198,
"end": 206,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "Prior Probability Estimation At",
"sec_num": null
},
{
"text": ") | ( ) ( ) | ( ) ( ) | ( ) | ( ) ( ) ( Step M ) | ( ) ( ) | ( ) ( ) | (",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Prior Probability Estimation At",
"sec_num": null
},
{
"text": "Step E Figure 3 . EM Algorithm",
"cite_spans": [],
"ref_spans": [
{
"start": 7,
"end": 15,
"text": "Figure 3",
"ref_id": null
}
],
"eq_spans": [],
"section": "Prior Probability Estimation At",
"sec_num": null
},
{
"text": "Step 2, we use an EM-based Na\u00efve Bayesian Classifier (EM-NBC) to select the candidates c whose posterior probabilities are the largest:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM-NBC At",
"sec_num": null
},
{
"text": "\uf8f7 \uf8f8 \uf8f6 \uf8ec \uf8ed \uf8eb + = \u2211 \u2208 \u2208 \u2208 ) | ( log ) ( ) ( log max arg ) | ( max arg~~c c P c f c P c P C c E C c C c D (3)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM-NBC At",
"sec_num": null
},
{
"text": "Equation 3is based on Bayes' rule and the assumption that the data in D are independently generated from",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM-NBC At",
"sec_num": null
},
{
"text": "C c c c P \u2208 ), | ( .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM-NBC At",
"sec_num": null
},
{
"text": "In our implementation, we use an equivalent",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM-NBC At",
"sec_num": null
},
{
"text": "\uf8f7 \uf8f8 \uf8f6 \uf8ec \uf8ed \uf8eb \u2212 \u2212 \u2211 \u2208 \u2208 ) | ( log ) ( ) ( log min arg~c c P c f c P C c E C c \u03b1 (4) where 1 \u2265 \u03b1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM-NBC At",
"sec_num": null
},
{
"text": "is an additional parameter used to emphasize the prior information. If we ignore the first term in Equation 4, then the use of one EM-NBC turns out to select the candidate whose frequency vector is the closest to the transformed vector D in terms of KL divergence (cf., Cover and Tomas 1991) .",
"cite_spans": [
{
"start": 270,
"end": 291,
"text": "Cover and Tomas 1991)",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "EM-NBC At",
"sec_num": null
},
{
"text": "To further improve performance, we use an ensemble (i.e., a linear combination) of EM-NBCs (EM-NBC-Ensemble), while the classifiers are constructed on the basis of the data in different contexts with different window sizes. More specifically, we calculate",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM-NBC-Ensemble",
"sec_num": null
},
{
"text": "where s) , 1, (i , L = i D",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM-NBC-Ensemble",
"sec_num": null
},
{
"text": "denotes the data in different contexts.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "EM-NBC-Ensemble",
"sec_num": null
},
{
"text": "We view the translation selection problem as that of calculating similarities between context vectors and use as context vectors TF-IDF vectors constructed with the EM Algorithm. Figure 4 describes the algorithm in which we use the same notations as those in EM-NBC-Ensemble.",
"cite_spans": [],
"ref_spans": [
{
"start": 179,
"end": 187,
"text": "Figure 4",
"ref_id": "FIGREF5"
}
],
"eq_spans": [],
"section": "Translation Selection --EM-TF-IDF",
"sec_num": "3.3"
},
{
"text": "The ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Translation Selection --EM-TF-IDF",
"sec_num": "3.3"
},
{
"text": ")), c ( f , ), c ( f ), c ( f ( n E E E L ) , , 1 ( , n i C c i L = \u2208",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Translation Selection --EM-TF-IDF",
"sec_num": "3.3"
},
{
"text": ", using a translation dictionary and the EM algorithm; create a TF-IDF vector",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Translation Selection --EM-TF-IDF",
"sec_num": "3.3"
},
{
"text": "1 1 )), c idf( )) c ( f , ), c idf( ) c ( f ( n n E E L = A ) , , 1 ( , n i C c i L = \u2208 2. for each ( C c\u2208 ){ create a frequency vector )), ( , ), ( ), ( ( 2 1 n c f c f c f L ) , , 1 ( , n i C c i L = \u2208",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Translation Selection --EM-TF-IDF",
"sec_num": "3.3"
},
{
"text": "using contexts containing c ; create a TF-IDF vector ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Translation Selection --EM-TF-IDF",
"sec_num": "3.3"
},
{
"text": "1 1 )) c idf( )) c ( f , ), c idf( ) c ( f ( n n L = B ) , , 1 ( , n i C c i L = \u2208 ; calculate ) , cos( ) c tfidf( B A = ; } 3. Sort",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Translation Selection --EM-TF-IDF",
"sec_num": "3.3"
},
{
"text": "The uses of EM-NBC-Ensemble and EM-TF-IDF can be viewed as extensions of existing methods for word or phrase translation using non-parallel corpora. Particularly, the use of the EM Algorithm can help to accurately transform a frequency vector from one language to another. Suppose that we are to determine if ' \u066b ' is a translation of 'information age' (actually it is). The frequency vectors of context words for 'information age' and ' \u066b ' are given in A and D in Figure 5 , respectively. If for each English word we only retain the link connecting to the Chinese translation with the largest frequency (a link represented as a solid line) to establish a many-to-one mapping and transform vector A from English to Chinese, we obtain vector B. It turns out, however, that vector B is quite different from vector D, although they should be similar to each other. We will refer to this method as 'Major Translation' hereafter.",
"cite_spans": [],
"ref_spans": [
{
"start": 466,
"end": 474,
"text": "Figure 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Advantage of Using EM Algorithm",
"sec_num": "3.4"
},
{
"text": "With EM, vector A in Figure 5 is transformed into vector C, which is much closer to vector D, as expected. Specifically, EM can split the frequency of a word in English and distribute them into its translations in Chinese in a theoretically sound way (cf., the distributed frequencies of 'internet'). Note that if we assume a many-to-one (or one-to-one) mapping",
"cite_spans": [],
"ref_spans": [
{
"start": 21,
"end": 29,
"text": "Figure 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Advantage of Using EM Algorithm",
"sec_num": "3.4"
},
{
"text": "\u2211 = = s i i c P s c P 1 ) | ( 1 ) | ( D D (5)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Advantage of Using EM Algorithm",
"sec_num": "3.4"
},
{
"text": "relationship, then the use of EM turns out to be equivalent to that of Major Translation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Advantage of Using EM Algorithm",
"sec_num": "3.4"
},
{
"text": "In order to further boost the performance of translation, we propose to also use the translation method proposed in Nagata et al. Specifically, we combine our method with that of Nagata et al by using a back-off strategy. Figure 6 illustrates the process of collecting Chinese translation candidates for an English Base NP 'information asymmetry' with Nagata et al's method.",
"cite_spans": [],
"ref_spans": [
{
"start": 222,
"end": 230,
"text": "Figure 6",
"ref_id": null
}
],
"eq_spans": [],
"section": "Combination",
"sec_num": "3.5"
},
{
"text": "In the combination of the two methods, we first use Nagata et al's method to perform translation; if we cannot find translations, we next use our method. We will denote this strategy 'Back-off'.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Combination",
"sec_num": "3.5"
},
{
"text": "We conducted experiments on translation of the Base NPs from English to Chinese.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Results",
"sec_num": "4."
},
{
"text": "We extracted Base NPs (noun-noun pairs) from the Encarta 1 English corpus using the tool developed by Xun et al (2000) . There were about 1 http://encarta.msn.com/Default.asp 3000 Base NPs extracted. In the experiments, we used the HIT English-Chinese word translation dictionary 2 . The dictionary contains about 76000 Chinese words, 60000 English words, and 118000 translation links. As a web search engine, we used Google (http://www.google.com).",
"cite_spans": [
{
"start": 102,
"end": 118,
"text": "Xun et al (2000)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Results",
"sec_num": "4."
},
{
"text": "Five translation experts evaluated the translation results by judging whether or not they were acceptable. The evaluations reported below are all based on their judgements.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Results",
"sec_num": "4."
},
{
"text": "In the experiment, we randomly selected 1000 Base NPs from the 3000 Base NPs. We next used our method to perform translation on the 1000 phrases. In translation selection, we employed EM-NBC-Ensemble and EM-TF-IDF. Table 1 shows the results in terms of coverage and top n accuracy. Here, coverage is defined as the percentage of phrases which have translations selected, while top n accuracy is defined as the percentage of phrases whose selected top n translations include correct translations.",
"cite_spans": [],
"ref_spans": [
{
"start": 215,
"end": 222,
"text": "Table 1",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "Basic Experiment",
"sec_num": "4.1"
},
{
"text": "For EM-NBC-Ensemble, we set the \u03b1 ! in (4) to be 5 on the basis of our preliminary experimental results. For EM-TF-IDF, we used the non-web data described in Section 4.4 to estimate idf values of words. We used contexts with window sizes of \u00b11, \u00b13, \u00b15, \u00b17, \u00b19, \u00b111. ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Experiment",
"sec_num": "4.1"
},
{
"text": "\u02e4 \u00c5 P # \u202b\u0716\u202c # < \u0c67 # ( \u02f7 . 0 - \u07a8 \u01a2 . \u202b\u074d\u202c \u10de # \u202b\u0716\u202c - \u066b \u03b3 \u02f7 . 0 . 0 ) p \u066b",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Experiment",
"sec_num": "4.1"
},
{
"text": "information asymmetry 3. Find the most frequently occurring Chinese phrases immediately before the brackets containing the English Base NP, using a suffix tree; 4. Output the Chinese phrases and their document frequencies: Figure 7 . Translation results Figure 7 shows the results of EM-NBC-Ensemble and EM-TF-IDF, in which for EM-NBC-Ensemble 'window size' denotes that of the largest within an ensemble. Table 1 summarizes the best results for each of them.",
"cite_spans": [],
"ref_spans": [
{
"start": 223,
"end": 231,
"text": "Figure 7",
"ref_id": null
},
{
"start": 254,
"end": 263,
"text": "Figure 7",
"ref_id": null
},
{
"start": 407,
"end": 414,
"text": "Table 1",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "Basic Experiment",
"sec_num": "4.1"
},
{
"text": "\u066b 5 \u066b 5 Figure 6. Nagata et al's method Z L Q G R Z V L ] H 7 R S D F F X U D F \\ ( 0 1 % & ( Q V",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Experiment",
"sec_num": "4.1"
},
{
"text": "'Prior' and 'MT-TF-IDF' are actually baseline methods relying on the existing technologies. In Prior, we select candidates whose prior probabilities are the largest, equivalently, document frequencies obtained in translation candidate collection are the largest. In MT-TF-IDF, we use TF-IDF vectors transformed with Major Translation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Experiment",
"sec_num": "4.1"
},
{
"text": "Our experimental results indicate that both EM-NBC-Ensemble and EM-TF-IDF significantly outperform Prior and MT-TF-IDF, when appropriate window sizes are chosen. The p-values of the sign tests are 0.00056 and 0.00133 for EM-NBC-Ensemble, 0.00002 and 0.00901 for EM-TF-IDF, respectively.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Experiment",
"sec_num": "4.1"
},
{
"text": "We next removed each of the key components of EM-NBC-Ensemble and used the remaining components as a variant of it to perform translation selection. The key components are (1) distance calculation by KL divergence (2) EM, (3) prior probability, and (4) ensemble. The variants, thus, respectively make use of (1) the baseline method 'Prior', (2) an ensemble of Na\u00efve Bayesian Classifiers based on Major Translation (MT-NBC-Ensemble), (3) an ensemble of EM-based KL divergence calculations (EM-KL-Ensemble), and (4) EM-NBC. Figure 7 and Table 1 show the results. We see that EM-NBC-Ensemble outperforms all of the variants, indicating that all the components within EM-NBC-Ensemble play positive roles.",
"cite_spans": [],
"ref_spans": [
{
"start": 522,
"end": 530,
"text": "Figure 7",
"ref_id": null
},
{
"start": 535,
"end": 542,
"text": "Table 1",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "Basic Experiment",
"sec_num": "4.1"
},
{
"text": "We removed each of the key components of EM-TF-IDF and used the remaining components as a variant of it to perform translation selection. The key components are (1) idf value and (2) EM.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Basic Experiment",
"sec_num": "4.1"
},
{
"text": "The variants, thus, respectively make use of (1) EM-based frequency vectors (EM-TF), (2) the baseline method MT-TF-IDF. Figure 7 and Table 1 show the results. We see that EM-TF-IDF outperforms both variants, indicating that all of the components within EM-TF-IDF are needed.",
"cite_spans": [],
"ref_spans": [
{
"start": 120,
"end": 128,
"text": "Figure 7",
"ref_id": null
},
{
"start": 133,
"end": 141,
"text": "Table 1",
"ref_id": "TABREF4"
}
],
"eq_spans": [],
"section": "Basic Experiment",
"sec_num": "4.1"
},
{
"text": "Comparing the results between MT-NBC-Ensemble and EM-NBC-Ensemble and the results between MT-TF-IDF and EM-TF-IDF, we see that the uses of the EM Algorithm can indeed help to improve translation accuracies. Table 2 shows translations of five Base NPs as output by EM-NBC-Ensemble, in which the translations marked with * were judged incorrect by human experts. We analyzed the reasons for incorrect translations and found that the incorrect translations were due to: (1) no existence of dictionary entry (19%), (2) non-compositional translation (13%), (3) ranking error (68%). We next used Nagata et al's method to perform translation. From Table 3 , we can see that the accuracy of Nagata et al's method is higher than that of our method, but the coverage of it is lower.",
"cite_spans": [],
"ref_spans": [
{
"start": 207,
"end": 214,
"text": "Table 2",
"ref_id": "TABREF7"
},
{
"start": 641,
"end": 648,
"text": "Table 3",
"ref_id": "TABREF8"
}
],
"eq_spans": [],
"section": "Basic Experiment",
"sec_num": "4.1"
},
{
"text": "The results indicate that our proposed Back-off strategy for translation is justifiable.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Our Method vs. Nagata et al's Method",
"sec_num": "4.2"
},
{
"text": "In the experiment, we tested the Back-off strategy, Table 4 shows the results. The Back-off strategy helps to further improve the results whether EM-NBC-Ensemble or EM-TF-IDF is used.",
"cite_spans": [],
"ref_spans": [
{
"start": 52,
"end": 59,
"text": "Table 4",
"ref_id": "TABREF9"
}
],
"eq_spans": [],
"section": "Combination",
"sec_num": "4.3"
},
{
"text": "To test the effectiveness of the use of web data, we conducted another experiment in which we performed translation by using non-web data. The data comprised of the Wall Street Journal corpus in English (1987 -1992 and the People's Daily corpus in Chinese (1982 -1998 . We followed the Back-off strategy as in Section 4.3 to translate the 1000 Base NPs. The results in Table 5 show that the use of web data can yield better results than non-use of it, although the sizes of the non-web data we used were considerably large in practice. For Nagata et al's method, we found that it was almost impossible to find partial-parallel corpora in the non-web data.",
"cite_spans": [
{
"start": 195,
"end": 208,
"text": "English (1987",
"ref_id": null
},
{
"start": 209,
"end": 214,
"text": "-1992",
"ref_id": null
},
{
"start": 248,
"end": 261,
"text": "Chinese (1982",
"ref_id": null
},
{
"start": 262,
"end": 267,
"text": "-1998",
"ref_id": "BIBREF5"
}
],
"ref_spans": [
{
"start": 369,
"end": 376,
"text": "Table 5",
"ref_id": "TABREF10"
}
],
"eq_spans": [],
"section": "Web Data vs. Non-web Data",
"sec_num": "4.4"
},
{
"text": "This paper has proposed a new and effective method for Base NP translation by using web data and the EM Algorithm. Experimental results show that it outperforms the baseline methods based on existing techniques, mainly due to the employment of EM. Experimental results also show that the use of web data is more effective than non-use of it.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "5."
},
{
"text": "Future work includes further applying the proposed method to the translation of other types of Base NPs and between other language pairs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "5."
}
],
"back_matter": [
{
"text": "We thank Ming Zhou, Chang-Ning Huang, Jianfeng Gao, and Ashley Chang for many helpful discussions on this research project. We also acknowledge Shenjie Li for help with program coding.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgements",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Data-Intensive Question Answering",
"authors": [
{
"first": "E",
"middle": [],
"last": "Brill",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Lin",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Banko",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Dumais",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Ng",
"suffix": ""
}
],
"year": 2001,
"venue": "Proc. of TREC",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Brill E., Lin J., Banko M., Dumais S. and Ng A. (2001) Data-Intensive Question Answering. In Proc. of TREC '2001.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "The mathematics of Statistical Machine Translation: Parameter Estimation",
"authors": [
{
"first": "P",
"middle": [
"F"
],
"last": "Brown",
"suffix": ""
},
{
"first": "S",
"middle": [
"A"
],
"last": "Della Pietra",
"suffix": ""
},
{
"first": "Della",
"middle": [],
"last": "Pietra",
"suffix": ""
},
{
"first": "V",
"middle": [
"J"
],
"last": "Mercer",
"suffix": ""
},
{
"first": "R",
"middle": [
"L"
],
"last": "",
"suffix": ""
}
],
"year": 1993,
"venue": "Computational Linguistics",
"volume": "19",
"issue": "2",
"pages": "263--274",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Brown P.F., Della Pietra, S.A., Della Pietra V.J., and Mercer, R.L. (1993) The mathematics of Statistical Machine Translation: Parameter Estimation. Computational Linguistics 19(2), pp.263--11.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Elements of Information Theory",
"authors": [
{
"first": "T",
"middle": [],
"last": "Cover",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Thomas",
"suffix": ""
}
],
"year": 1991,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Cover T. and Thomas J. (1991) Elements of Information Theory, Wiley.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Maximum likelihood from incomplete data via the EM algorithm",
"authors": [
{
"first": "A",
"middle": [
"P"
],
"last": "Dempster",
"suffix": ""
},
{
"first": "N",
"middle": [
"M"
],
"last": "Laird",
"suffix": ""
},
{
"first": "D",
"middle": [
"B"
],
"last": "Rubin",
"suffix": ""
}
],
"year": 1977,
"venue": "J. Roy. Stat. Soc. B",
"volume": "39",
"issue": "",
"pages": "1--38",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dempster A. P, Laird N. M. and Rubin D. B. (1977) Maximum likelihood from incomplete data via the EM algorithm. J. Roy. Stat. Soc. B 39:1--38.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "A statistical word-level translation model for comparable corpora",
"authors": [
{
"first": "M",
"middle": [],
"last": "Diab",
"suffix": ""
},
{
"first": "S",
"middle": [],
"last": "Finch",
"suffix": ""
}
],
"year": 2000,
"venue": "Proc. of RIAO",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Diab M. and Finch S. (2000) A statistical word-level translation model for comparable corpora. In Proc. of RIAO.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "An IR approach for translation new words from nonparallel, comparable texts",
"authors": [
{
"first": "P",
"middle": [],
"last": "Fung",
"suffix": ""
},
{
"first": "L",
"middle": [
"Y"
],
"last": "Yee",
"suffix": ""
}
],
"year": 1998,
"venue": "Proc. of COLING-ACL '1998",
"volume": "",
"issue": "",
"pages": "414--434",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fung P. and Yee L.Y. (1998) An IR approach for translation new words from nonparallel, comparable texts. In Proc. of COLING-ACL '1998, pp 414--20.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "Improving Query Translation for Cross-Language Information Retrieval Using Statistical Models",
"authors": [
{
"first": "J",
"middle": [
"F"
],
"last": "Gao",
"suffix": ""
},
{
"first": "J",
"middle": [
"Y"
],
"last": "Nie",
"suffix": ""
},
{
"first": "E",
"middle": [
"D"
],
"last": "Xun",
"suffix": ""
},
{
"first": "J",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "C",
"middle": [
"N"
],
"last": "Huang",
"suffix": ""
}
],
"year": 2001,
"venue": "Proc. of SIGIR",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Gao J. F., Nie J. Y., Xun E. D., Zhang J., Zhou M. and Huang C. N. (2001) Improving Query Translation for Cross-Language Information Retrieval Using Statistical Models. In Proc. of SIGIR '2001.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Resolving translation ambiguity using non-parallel bilingual corpora",
"authors": [
{
"first": "G",
"middle": [],
"last": "Kikui",
"suffix": ""
}
],
"year": 1999,
"venue": "Proc. of ACL '1999 Workshop",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kikui G. (1999) Resolving translation ambiguity using non-parallel bilingual corpora. In Proc. of ACL '1999 Workshop, Unsupervised Learning in NLP.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Estimating word translation probabilities from unrelated monolingual corpora using the EM algorithm",
"authors": [
{
"first": "P",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "K",
"middle": [],
"last": "Knight",
"suffix": ""
}
],
"year": 2000,
"venue": "Proc. of AAAI",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Koehn P. and Knight K.(2000) Estimating word translation probabilities from unrelated monolingual corpora using the EM algorithm. In Proc. of AAAI '2000.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Using the Web as a bilingual dictionary",
"authors": [
{
"first": "M",
"middle": [],
"last": "Nagata",
"suffix": ""
},
{
"first": "T",
"middle": [],
"last": "Saito",
"suffix": ""
},
{
"first": "K. ; Dd-Mt",
"middle": [],
"last": "Suzuki",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Workshop",
"suffix": ""
}
],
"year": 2001,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nagata M., Saito T., and Suzuki K. (2001) Using the Web as a bilingual dictionary. In Proc. of ACL'2001 DD-MT Workshop.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Disambiguation of single noun translations extracted from bilingual comparable corpora",
"authors": [
{
"first": "H",
"middle": [],
"last": "Nakagawa",
"suffix": ""
}
],
"year": 2001,
"venue": "",
"volume": "7",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Nakagawa H. (2001) Disambiguation of single noun translations extracted from bilingual comparable corpora. In Terminology 7:1.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "A Simple Approach to Building Ensembles of Na\u00efve Bayesian Classifiers for Word Sense Disambiguation",
"authors": [
{
"first": "T",
"middle": [],
"last": "Pederson",
"suffix": ""
}
],
"year": 2000,
"venue": "Proc. of NAACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Pederson T.(2000) A Simple Approach to Building Ensembles of Na\u00efve Bayesian Classifiers for Word Sense Disambiguation. In Proc. of NAACL '2000.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Automatic identification of word translations from unrelated English and German corpora",
"authors": [
{
"first": "R",
"middle": [],
"last": "Rapp",
"suffix": ""
}
],
"year": 1999,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Rapp R. (1999) Automatic identification of word translations from unrelated English and German corpora. In Proc. of ACL'1999.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Lexical transfer using a vector-space model",
"authors": [
{
"first": "E",
"middle": [],
"last": "Sumita",
"suffix": ""
}
],
"year": 2000,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Sumita E.(2000) Lexical transfer using a vector-space model. In Proc. of ACL '2000.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Extraction of Lexical Translation from non-aligned corpora",
"authors": [
{
"first": "K",
"middle": [],
"last": "Tanaka",
"suffix": ""
},
{
"first": "H",
"middle": [],
"last": "Iwasaki",
"suffix": ""
}
],
"year": 1996,
"venue": "Proc. of COLING",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tanaka K. and Iwasaki H. (1996) Extraction of Lexical Translation from non-aligned corpora. In Proc. of COLING '1996",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Unified Statistical Model for the Identification of English BaseNP",
"authors": [
{
"first": "E",
"middle": [
"D"
],
"last": "Xun",
"suffix": ""
},
{
"first": "C",
"middle": [
"N"
],
"last": "Huang",
"suffix": ""
},
{
"first": "M",
"middle": [],
"last": "Zhou",
"suffix": ""
}
],
"year": 2000,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Xun E.D., Huang C.N. and Zhou M. (2000) A Unified Statistical Model for the Identification of English BaseNP. In Proc. of ACL '2000.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"type_str": "figure",
"uris": null,
"text": "Translation candidate collection"
},
"FIGREF5": {
"num": null,
"type_str": "figure",
"uris": null,
"text": "Algorithm of EM-TF-IDF"
},
"TABREF1": {
"html": null,
"num": null,
"text": "Let c represent a random variable on C . Let E denote a set of words in English, and C a set of words in Chinese.",
"content": "<table><tr><td>Suppose that</td><td>|</td><td>E</td><td>|</td><td>=</td><td>m</td><td>and</td><td>|</td><td>C</td><td>|</td><td>=</td><td>n</td></tr></table>",
"type_str": "table"
},
"TABREF3": {
"html": null,
"num": null,
"text": ": \u1ebd , C , contexts containing \u1ebd , contexts containing all",
"content": "<table><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>c\u2208</td><td>C</td><td>,</td><td>idf(</td><td>c</td><td>),</td><td>c</td><td>C \u2208 ;</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>1. create a frequency vector</td><td>(</td><td>f</td><td>( e 1</td><td>),</td><td>f</td><td>( e 2</td><td>),</td><td>, L</td><td>f</td><td>( e m</td><td>)),</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>e i</td><td>\u2208</td><td>E</td><td>,</td><td>( i</td><td>=</td><td>, 1</td><td>, L</td><td>) m</td><td>using contexts containing \u1ebd ;</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td>transforming the vector into</td><td>1</td><td>2</td></tr><tr><td/><td colspan=\"15\">idf value of a Chinese word c is calculated</td></tr><tr><td colspan=\"6\">in advance and as</td><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td/><td>idf</td><td>(</td><td>c</td><td>)</td><td>=</td><td>\u2212</td><td>log(</td><td>df</td><td>(</td><td>c</td><td>)</td><td>/</td><td>F</td><td>)</td><td>(6)</td></tr><tr><td>where</td><td colspan=\"15\">) df( denotes the document frequency of c</td></tr><tr><td colspan=\"15\">c and F the total document frequency.</td></tr></table>",
"type_str": "table"
},
"TABREF4": {
"html": null,
"num": null,
"text": "Best translation result for each method",
"content": "<table><tr><td/><td colspan=\"2\">Accuracy (%)</td><td>Coverage</td></tr><tr><td/><td>Top 1</td><td>Top 3</td><td>(%)</td></tr><tr><td>EM-NBC-Ensemble</td><td>61.7</td><td>80.3</td><td/></tr><tr><td>Prior</td><td>57.6</td><td>77.6</td><td/></tr><tr><td>MT-NBC-Ensemble</td><td>59.9</td><td>78.1</td><td/></tr><tr><td>EM-KL-Ensemble EM-NBC</td><td>45.9 60.8</td><td>72.3 78.9</td><td>89.9</td></tr><tr><td>EM-TF-IDF</td><td>61.9</td><td>80.8</td><td/></tr><tr><td>MT-TF-IDF</td><td>58.2</td><td>77.6</td><td/></tr><tr><td>EM-TF</td><td>55.8</td><td>77.8</td><td/></tr></table>",
"type_str": "table"
},
"TABREF5": {
"html": null,
"num": null,
"text": "The dictionary is created by the Harbin Institute of Technology.",
"content": "<table><tr><td/><td/><td/><td colspan=\"3\">A</td><td/><td/><td/><td/><td/><td/><td colspan=\"3\">B</td><td/><td/><td/><td/><td/><td/><td colspan=\"3\">C</td><td/><td/><td/><td/><td/><td/><td colspan=\"3\">D</td><td/><td/><td/></tr><tr><td>I</td><td>U</td><td>H</td><td>T</td><td>X</td><td>H</td><td>Q</td><td>F</td><td>\\</td><td>I</td><td>U</td><td>H</td><td>T</td><td>X</td><td>H</td><td>Q</td><td>F</td><td>\\</td><td>I</td><td>U</td><td>H</td><td>T</td><td>X</td><td>H</td><td>Q</td><td>F</td><td>\\</td><td>I</td><td>U</td><td>H</td><td>T</td><td>X</td><td>H</td><td>Q</td><td>F</td><td>\\</td></tr><tr><td/><td/><td/><td/><td/><td/><td/><td/><td colspan=\"19\">Figure 5. Example of frequency vector transformation</td><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td colspan=\"9\">1. Input 'information asymmetry';</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td colspan=\"9\">2. Search the English Base NP on web sites in Chinese</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td colspan=\"9\">and obtain documents as follows (i.e., using partial parallel</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr><tr><td colspan=\"3\">corpora):</td><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/><td/></tr></table>",
"type_str": "table"
},
"TABREF7": {
"html": null,
"num": null,
"text": "Sample of translation outputs",
"content": "<table><tr><td>Base NP</td><td>Translation</td></tr><tr><td>calcium ion adventure tale lung cancer aircraft carrier adult literacy</td><td>\u0464 --) \u073d \u01cd \u02fe \u02fe \u0170 -0 * * 0 \u01a3 p</td></tr></table>",
"type_str": "table"
},
"TABREF8": {
"html": null,
"num": null,
"text": "Translation results",
"content": "<table><tr><td/><td colspan=\"2\">Accuracy (%) Top 1 Top 3</td><td>Coverage (%)</td></tr><tr><td>Our Method</td><td>61.7</td><td>80.3</td><td>89.9</td></tr><tr><td>Nagata et al's</td><td>72.0</td><td>76.0</td><td>10.5</td></tr></table>",
"type_str": "table"
},
"TABREF9": {
"html": null,
"num": null,
"text": "Translation results",
"content": "<table><tr><td/><td colspan=\"2\">Accuracy %</td><td>Coverage</td></tr><tr><td/><td>Top 1</td><td>Top 3</td><td>%</td></tr><tr><td>Back-off (Ensemble) Back-off (TF-IDF)</td><td>62.9 62.2</td><td>79.7 79.8</td><td>91.4</td></tr></table>",
"type_str": "table"
},
"TABREF10": {
"html": null,
"num": null,
"text": "Translation results",
"content": "<table><tr><td>Data</td><td colspan=\"2\">Accuracy % Top 1 Top 3</td><td>Coverage %</td></tr><tr><td>Web (EM-NBC-Ensemble)</td><td>62.9</td><td>79.7</td><td>91.4</td></tr><tr><td>Non-web (EM-NBC-Ensemble)</td><td>56.9</td><td>74.7</td><td>79.3</td></tr><tr><td>Web (EM-IF-IDF)</td><td>62.2</td><td>79.8</td><td>91.4</td></tr><tr><td>Non-web (EM-TF-IDF)</td><td>51.5</td><td>71.4</td><td>78.5</td></tr></table>",
"type_str": "table"
}
}
}
} |