File size: 81,852 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 | {
"paper_id": "P09-1044",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T08:53:28.778374Z"
},
"title": "A Chinese-English Organization Name Translation System Using Heuristic Web Mining and Asymmetric Alignment",
"authors": [
{
"first": "Fan",
"middle": [],
"last": "Yang",
"suffix": "",
"affiliation": {
"laboratory": "National Laboratory of Pattern Recognition",
"institution": "Chinese Academy of Sciences",
"location": {
"postCode": "100190",
"settlement": "Beijing",
"country": "China"
}
},
"email": "fyang@nlpr.ia.ac.cn"
},
{
"first": "Jun",
"middle": [],
"last": "Zhao",
"suffix": "",
"affiliation": {
"laboratory": "National Laboratory of Pattern Recognition",
"institution": "Chinese Academy of Sciences",
"location": {
"postCode": "100190",
"settlement": "Beijing",
"country": "China"
}
},
"email": "jzhao@nlpr.ia.ac.cn"
},
{
"first": "Kang",
"middle": [],
"last": "Liu",
"suffix": "",
"affiliation": {
"laboratory": "National Laboratory of Pattern Recognition",
"institution": "Chinese Academy of Sciences",
"location": {
"postCode": "100190",
"settlement": "Beijing",
"country": "China"
}
},
"email": "kliu@nlpr.ia.ac.cn"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "In this paper, we propose a novel system for translating organization names from Chinese to English with the assistance of web resources. Firstly, we adopt a chunkingbased segmentation method to improve the segmentation of Chinese organization names which is plagued by the OOV problem. Then a heuristic query construction method is employed to construct an efficient query which can be used to search the bilingual Web pages containing translation equivalents. Finally, we align the Chinese organization name with English sentences using the asymmetric alignment method to find the best English fragment as the translation equivalent. The experimental results show that the proposed method outperforms the baseline statistical machine translation system by 30.42%.",
"pdf_parse": {
"paper_id": "P09-1044",
"_pdf_hash": "",
"abstract": [
{
"text": "In this paper, we propose a novel system for translating organization names from Chinese to English with the assistance of web resources. Firstly, we adopt a chunkingbased segmentation method to improve the segmentation of Chinese organization names which is plagued by the OOV problem. Then a heuristic query construction method is employed to construct an efficient query which can be used to search the bilingual Web pages containing translation equivalents. Finally, we align the Chinese organization name with English sentences using the asymmetric alignment method to find the best English fragment as the translation equivalent. The experimental results show that the proposed method outperforms the baseline statistical machine translation system by 30.42%.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "The task of Named Entity (NE) translation is to translate a named entity from the source language to the target language, which plays an important role in machine translation and cross-language information retrieval (CLIR). The organization name (ON) translation is the most difficult subtask in NE translation. The structure of ON is complex and usually nested, including person name, location name and sub-ON etc. For example, the organization name \"\u5317\u4eac\u8bfa\u57fa\u4e9a\u901a \u4fe1 \u6709 \u9650 \u516c \u53f8",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "(Beijing Nokia Communication Ltd.)\" contains a company name (\u8bfa\u57fa\u4e9a/Nokia) and a location name (\u5317\u4eac/Beijing). Therefore, the translation of organization names should combine transliteration and translation together.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Many previous researchers have tried to solve ON translation problem by building a statistical model or with the assistance of web resources.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The performance of ON translation using web knowledge is determined by the solution of the following two problems:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The efficiency of web page searching: how can we find the web pages which contain the translation equivalent when the amount of the returned web pages is limited?",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "The reliability of the extraction method: how reliably can we extract the translation equivalent from the web pages that we obtained in the searching phase?",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "For solving these two problems, we propose a Chinese-English organization name translation system using heuristic web mining and asymmetric alignment, which has three innovations.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "1) Chunking-based segmentation: A Chinese ON is a character sequences, we need to segment it before translation. But the OOV words always make the ON segmentation much more difficult. We adopt a new two-phase method here. First, the Chinese ON is chunked and each chunk is classified into four types. Then, different types of chunks are segmented separately using different strategies. Through chunking the Chinese ON first, the OOVs can be partitioned into one chunk which will not be segmented in the next phase. In this way, the performance of segmentation is improved.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "2) Heuristic Query construction: We need to obtain the bilingual web pages that contain both the input Chinese ON and its translation equivalent. But in most cases, if we just send the Chinese ON to the search engine, we will always get the Chinese monolingual web pages which don't contain any English word sequences, let alone the English translation equivalent. So we propose a heuristic query construction method to generate an efficient bilingual query. Some words in the Chinese ON are selected and their translations are added into the query. These English words will act as clues for searching bilingual web pages. The selection of the Chinese words to be translated will take into consideration both the translation confidence of the words and the information contents that they contain for the whole ON.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "3) Asymmetric alignment: When we extract the translation equivalent from the web pages, the traditional method should recognize the named entities in the target language sentence first, and then the extracted NEs will be aligned with the source ON. However, the named entity recognition (NER) will always introduce some mistakes. In order to avoid NER mistakes, we propose an asymmetric alignment method which align the Chinese ON with an English sentence directly and then extract the English fragment with the largest alignment score as the equivalent. The asymmetric alignment method can avoid the influence of improper results of NER and generate an explicit matching between the source and the target phrases which can guarantee the precision of alignment.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "In order to illustrate the above ideas clearly, we give an example of translating the Chinese ON \"\u4e2d\u56fd\u534e\u878d\u8d44\u4ea7\u7ba1\u7406\u516c\u53f8 (China Huarong Asset Management Corporation)\".",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Step1: We first chunk the ON, where \"LC\", \"NC\", \"MC\" and \"KC\" are the four types of chunks defined in Section 4.2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "(China)/LC \u534e \u878d (Huarong)/NC \u8d44 \u4ea7 \u7ba1 \u7406 (asset management)/MC \u516c \u53f8 (corporation)/KC Step2:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u4e2d \u56fd",
"sec_num": null
},
{
"text": "We segment the ON based on the chunking results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u4e2d \u56fd",
"sec_num": null
},
{
"text": "(china) \u534e \u878d (Huarong) \u8d44 \u4ea7 (asset) \u7ba1 \u7406 (management) \u516c \u53f8",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u4e2d \u56fd",
"sec_num": null
},
{
"text": "(corporation) If we do not chunk the ON first, the OOV word \"\u534e\u878d(Huarong)\" may be segmented as \"\u534e \u878d \". This result will certainly lead to translation errors.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u4e2d \u56fd",
"sec_num": null
},
{
"text": "Step 3: Query construction:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u4e2d \u56fd",
"sec_num": null
},
{
"text": "We select the words \"\u8d44\u4ea7\" and \"\u7ba1\u7406\" to translate and a bilingual query is constructed as: \"",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u4e2d \u56fd",
"sec_num": null
},
{
"text": "\u4e2d \u56fd \u534e \u878d \u8d44 \u4ea7 \u7ba1 \u7406 \u516c \u53f8 \" + asset + management",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u4e2d \u56fd",
"sec_num": null
},
{
"text": "If we don't add some English words into the query, we may not obtain the web pages which contain the English phrase \"China Huarong Asset Management Corporation\". In that case, we can not extract the translation equivalent.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u4e2d \u56fd",
"sec_num": null
},
{
"text": "Step 4: Asymmetric Alignment: We extract a sentence \"\u2026President of China Huarong Asset Management Corporation\u2026\" from the returned snippets. Then the best fragment of the sentence \"China Huarong Asset Management Corporation\" will be extracted as the translation equivalent. We don't need to implement English NER process which may make mistakes. The remainder of the paper is structured as follows. Section 2 reviews the related works. In Section 3, we present the framework of our system. We discuss the details of the ON chunking in Section 4. In Section 5, we introduce the approach of heuristic query construction. In section 6, we will analyze the asymmetric alignment method. The experiments are reported in Section 7. The last section gives the conclusion and future work.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "\u4e2d \u56fd",
"sec_num": null
},
{
"text": "In the past few years, researchers have proposed many approaches for organization translation. There are three main types of methods. The first type of methods translates ONs by building a statistical translation model. The model can be built on the granularity of word [Stalls et al., 1998 ], phrase [Min Zhang et al., 2005] or structure [Yufeng Chen et al., 2007] . The second type of methods finds the translation equivalent based on the results of alignment from the source ON to the target ON [Huang et al., 2003; Feng et al., 2004; Lee et al., 2006] . The ONs are extracted from two corpora. The corpora can be parallel corpora [Moore et al., 2003] or contentaligned corpora [Kumano et al., 2004] . The third type of methods introduces the web resources into ON translation. [Al-Onaizan et al., 2002] uses the web knowledge to assist NE translation and [Huang et al., 2004; Chen et al., 2006] extracts the translation equivalents from web pages directly.",
"cite_spans": [
{
"start": 270,
"end": 290,
"text": "[Stalls et al., 1998",
"ref_id": "BIBREF12"
},
{
"start": 301,
"end": 325,
"text": "[Min Zhang et al., 2005]",
"ref_id": "BIBREF10"
},
{
"start": 339,
"end": 365,
"text": "[Yufeng Chen et al., 2007]",
"ref_id": "BIBREF1"
},
{
"start": 498,
"end": 518,
"text": "[Huang et al., 2003;",
"ref_id": "BIBREF4"
},
{
"start": 519,
"end": 537,
"text": "Feng et al., 2004;",
"ref_id": "BIBREF2"
},
{
"start": 538,
"end": 555,
"text": "Lee et al., 2006]",
"ref_id": "BIBREF8"
},
{
"start": 634,
"end": 654,
"text": "[Moore et al., 2003]",
"ref_id": "BIBREF15"
},
{
"start": 681,
"end": 702,
"text": "[Kumano et al., 2004]",
"ref_id": "BIBREF14"
},
{
"start": 781,
"end": 806,
"text": "[Al-Onaizan et al., 2002]",
"ref_id": "BIBREF0"
},
{
"start": 859,
"end": 879,
"text": "[Huang et al., 2004;",
"ref_id": null
},
{
"start": 880,
"end": 898,
"text": "Chen et al., 2006]",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "The above three types of methods have their advantages and shortcomings. The statistical translation model can give an output for any input. But the performance is not good enough on complex ONs. The method of extracting translation equivalents from bilingual corpora can obtain high-quality translation equivalents. But the quantity of the results depends heavily on the amount and coverage of the corpora. So this kind of method is fit for building a reliable ON dictionary. In the third type of method, with the assistance of web pages, the task of ON translation can be viewed as a two-stage process. Firstly, the web pages that may contain the target translation are found through a search engine. Then the translation equivalent will be extracted from the web pages based on the alignment score with the original ON. This method will not depend on the quantity and quality of the corpora and can be used for translating complex ONs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Related Work",
"sec_num": "2"
},
{
"text": "The Framework of our ON translation system shown in Figure 1 has four modules. The input of this module is a Chinese ON. The Chunking model will partition the ON into chunks, and label each chunk using one of four classes. Then, different segmentation strategies will be executed for different types of chunks.",
"cite_spans": [],
"ref_spans": [
{
"start": 52,
"end": 60,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "The Framework of Our System",
"sec_num": "3"
},
{
"text": "2) Statistical Organization Translation Module: The input of the module is a word set in which the words are selected from the Chinese ON. The module will output the translation of these words.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Framework of Our System",
"sec_num": "3"
},
{
"text": "3) Web Retrieval Module: When input a Chinese ON, this module generates a query which contains both the ON and some words' translation output from the translation module. Then we can obtain the snippets that may contain the translation of the ON from the search engine. The English sentences will be extracted from these snippets. 4) NE Alignment Module: In this module, the asymmetric alignment method is employed to align the Chinese ON with these English sentences obtained in Web retrieval module. The best part of the English sentences will be extracted as the translation equivalent.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Framework of Our System",
"sec_num": "3"
},
{
"text": "In this section, we will illustrate a chunkingbased Chinese ON segmentation method, which can efficiently deal with the ONs containing OOVs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Chunking-based Segmentation for Chinese ONs",
"sec_num": "4"
},
{
"text": "The performance of the statistical ON translation model is dependent on the precision of the Chinese ON segmentation to some extent. When Chinese words are aligned with English words, the mistakes made in Chinese segmentation may result in wrong alignment results. We also need correct segmentation results when decoding. But Chinese ONs usually contain some OOVs that are hard to segment, especially the ONs containing names of people or brand names. To solve this problem, we try to chunk Chinese ONs firstly and the OOVs will be partitioned into one chunk. Then the segmentation will be executed for every chunk except the chunks containing OOVs.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Problems in ON Segmentation",
"sec_num": "4.1"
},
{
"text": "We define the following four types of chunks for ",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Four Types of Chunks",
"sec_num": "4.2"
},
{
"text": "\u5317 \u4eac (Beijing)/LC \u767e \u5bcc \u52e4 (Peregrine)/NC \u6295 \u8d44 \u54a8 \u8be2 (investment consulting)/MC \u6709 \u9650 \u516c \u53f8 (co.)/KC",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Four Types of Chunks",
"sec_num": "4.2"
},
{
"text": "In the above example, the OOV \" \u767e \u5bcc \u52e4 (Peregrine)\" is partitioned into name chunk. Then the name chunk will not be segmented.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Four Types of Chunks",
"sec_num": "4.2"
},
{
"text": "Considered as a discriminative probabilistic model for sequence joint labeling and with the advantage of flexible feature fusion ability, Conditional Random Fields (CRFs) [J. Lafferty et al., 2001 ] is believed to be one of the best probabilistic models for sequence labeling tasks. So the CRFs model is employed for chunking.",
"cite_spans": [
{
"start": 175,
"end": 196,
"text": "Lafferty et al., 2001",
"ref_id": "BIBREF13"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The CRFs Model for Chunking",
"sec_num": "4.3"
},
{
"text": "We select 6 types of features which are proved to be efficient for chunking through experiments. The templates of features are shown in whether the characters is a word",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The CRFs Model for Chunking",
"sec_num": "4.3"
},
{
"text": "W(C-2C-1C0)\u3001W(C0C1C2)\u3001 W(C-1C0C1)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The CRFs Model for Chunking",
"sec_num": "4.3"
},
{
"text": "whether the characters is a location name",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The CRFs Model for Chunking",
"sec_num": "4.3"
},
{
"text": "L(C-2C-1C0)\u3001L(C0C1C2)\u3001 L(C-1C0C1)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The CRFs Model for Chunking",
"sec_num": "4.3"
},
{
"text": "whether the characters is an ON suffix",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The CRFs Model for Chunking",
"sec_num": "4.3"
},
{
"text": "SK(C-2C-1C0)\u3001SK(C0C1C2)\u3001 SK(C-1C0C1)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The CRFs Model for Chunking",
"sec_num": "4.3"
},
{
"text": "whether the characters is a location suffix",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The CRFs Model for Chunking",
"sec_num": "4.3"
},
{
"text": "SL(C-2C-1C0)\u3001SL(C0C1C2)\u3001 SL(C-1C0C1)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The CRFs Model for Chunking",
"sec_num": "4.3"
},
{
"text": "relative position in the sentence where C i denotes a Chinese character, i denotes the position relative to the current character. We also use bigram and unigram features but only show trigram templates in Table 1 .",
"cite_spans": [],
"ref_spans": [
{
"start": 206,
"end": 213,
"text": "Table 1",
"ref_id": "TABREF1"
}
],
"eq_spans": [],
"section": "The CRFs Model for Chunking",
"sec_num": "4.3"
},
{
"text": "POS(C0)",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The CRFs Model for Chunking",
"sec_num": "4.3"
},
{
"text": "In order to use the web information to assist Chinese-English ON translation, we must firstly retrieve the bilingual web pages effectively. So we should develop a method to construct efficient queries which are used to obtain web pages through the search engine.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Heuristic Query Construction",
"sec_num": "5"
},
{
"text": "We expect to find the web pages where the Chinese ON and its translation equivalent cooccur. If we just use a Chinese ON as the query, we will always obtain the monolingual web pages only containing the Chinese ON. In order to solve the problem, some words in the Chinese ON can be translated into English, and the English words will be added into the query as the clues to search the bilingual web pages.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Limitation of Monolingual Query",
"sec_num": "5.1"
},
{
"text": "We use the metric of precision here to evaluate the possibility in which the translation equivalent is contained in the snippets returned by the search engine. That means, on the condition that we obtain a fixed number of snippets, the more the snippets which contain the translation equivalent are obtained, the higher the precision is. There are two factors to be considered. The first is how efficient the added English words can improve the precision. The second is how to avoid adding wrong translations which may bring down the precision. The first factor means that we should select the most informative words in the Chinese ON. The second factor means that we should consider the confidence of the SMT model at the same time. For example: Honda motor co. ltd.) There are three strategies of constructing queries as follows: Q1.\"\u5929\u6d25\u672c\u7530\u6469\u6258\u8f66\u6709\u9650\u516c\u53f8\" Honda Q2.\"\u5929\u6d25\u672c\u7530\u6469\u6258\u8f66\u6709\u9650\u516c\u53f8\" Ltd. Q3.",
"cite_spans": [],
"ref_spans": [
{
"start": 747,
"end": 758,
"text": "Honda motor",
"ref_id": null
}
],
"eq_spans": [],
"section": "The Strategy of Query Construction",
"sec_num": "5.2"
},
{
"text": "\u5929 \u6d25 /LC \u672c \u7530 /NC \u8f66 \u6469 \u6258 /MC \u6709 \u9650 \u516c \u53f8 /KC (Tianjin",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Strategy of Query Construction",
"sec_num": "5.2"
},
{
"text": "\" \u5929 \u6d25 \u672c \u7530 \u6469 \u6258 \u8f66 \u6709 \u9650 \u516c \u53f8 \" Motor Tianjin",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Strategy of Query Construction",
"sec_num": "5.2"
},
{
"text": "In the first strategy, we translate the word \"\u672c \u7530 (Honda)\" which is the most informative word in the ON. But its translation confidence is very low, which means that the statistical model gives wrong results usually. The mistakes in translation will mislead the search engine. In the second strategy, we translate the word which has the largest translation confidence. Unfortunately the word is so common that it can't give any help in filtering out useless web pages. In the third strategy, the words which have sufficient translation confidence and information content are selected.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Strategy of Query Construction",
"sec_num": "5.2"
},
{
"text": "The mutual information is used to evaluate the importance of the words in a Chinese ON. We calculate the mutual information on the granularity of words in formula 1 and chunks in formula 2. The integration of the two kinds of mutual information is in formula 3.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Heuristically Selecting the Words to be Translated",
"sec_num": "5.3"
},
{
"text": "y Y p ( x , y ) ( , ) = l o g p ( x ) p ( y ) M I W x Y \u2208 \u2211 (1) Y p ( y , c ) ( , ) = l o g p ( y ) p ( c ) y M I C c Y \u2208 \u2211 (2) ( , )= ( , )+(1-) ( , ) x IC x Y MIW x Y MIC c Y \u03b1 \u03b1",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Heuristically Selecting the Words to be Translated",
"sec_num": "5.3"
},
{
"text": "(3) Here, MIW(x,Y) denotes the mutual information of word x with ON Y. That is the summation of the mutual information of x with every word in Y. MIC(c,Y) is similar. c x denotes the label of the chunk containing x.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Heuristically Selecting the Words to be Translated",
"sec_num": "5.3"
},
{
"text": "We should also consider the risk of obtaining wrong translation results. We can see that the name chunk usually has the largest mutual information. However, the name chunk always needs to be transliterated, and transliteration is often more difficult than translation by lexicon. So we set a threshold T c for translation confidence. We only select the words whose translation confidences are higher than T c , with their mutual information from high to low.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Heuristically Selecting the Words to be Translated",
"sec_num": "5.3"
},
{
"text": "After we have obtained the web pages with the assistant of search engine, we extract the equivalent candidates from the bilingual web pages. So we first extract the pure English sentences and then an asymmetric alignment method is executed to find the best fragment of the English sentences as the equivalent candidate.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Asymmetric Alignment Method for Equivalent Extraction",
"sec_num": "6"
},
{
"text": "To find the translation candidates, the traditional method has three main steps.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Traditional Alignment Method",
"sec_num": "6.1"
},
{
"text": "1) The NEs in the source and the target language sentences are extracted separately. The NE collections are S ne and T ne .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Traditional Alignment Method",
"sec_num": "6.1"
},
{
"text": "2) For each NE in S ne , calculate the alignment probability with every NE in T ne .",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Traditional Alignment Method",
"sec_num": "6.1"
},
{
"text": "3) For each NE in S ne , the NE in T ne which has the highest alignment probability will be selected as its translation equivalent.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Traditional Alignment Method",
"sec_num": "6.1"
},
{
"text": "This method has two main shortcomings: 1) Traditional alignment method needs the NER process in both sides, but the NER process may often bring in some mistakes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Traditional Alignment Method",
"sec_num": "6.1"
},
{
"text": "2) Traditional alignment method evaluates the alignment probability coarsely. In other words, we don't know exactly which target word(s) should be aligned to for the source word. A coarse alignment method may have negative effect on translation equivalent extraction.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Traditional Alignment Method",
"sec_num": "6.1"
},
{
"text": "To solve the above two problems, we propose an asymmetric alignment method. The alignment method is so called \"asymmetric\" for that it aligns a phrase with a sentence, in other words, the alignment is conducted between two objects with different granularities. The NER process is not necessary for that we align the Chinese ON with English sentences directly.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Asymmetric Alignment Method",
"sec_num": "6.2"
},
{
"text": "[Wai Lam et al., 2007] proposed a method which uses the KM algorithm to find the optimal explicit matching between a Chinese ON and a given English ON. KM algorithm [Kuhn, 1955] is a traditional graphic algorithm for finding the maximum matching in bipartite weighted graph. In this paper, the KM algorithm is extended to be an asymmetric alignment method. So we can obtain an explicit matching between a Chinese ON and a fragment of English sentence.",
"cite_spans": [
{
"start": 5,
"end": 22,
"text": "Lam et al., 2007]",
"ref_id": "BIBREF7"
},
{
"start": 165,
"end": 177,
"text": "[Kuhn, 1955]",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Asymmetric Alignment Method",
"sec_num": "6.2"
},
{
"text": "A Chinese NE CO={CW 1 , CW 2 , \u2026, CW n } is a sequence of Chinese words CW i and the English sentence ES={EW 1 , EW 2 , \u2026, EW m } is a sequence of English words EW i . Our goal is to find a fragment EW i,i+n ={EW i , \u2026, EW i+n } in ES, which has the highest alignment score with CO. Through executing the extended KM algorithm, we can obtain an explicit matching L. For any CW i, we can get its corresponding English word EW j , written as L(CW i )=EW j and vice versa. We find the optimal matching L between two phrases, and calculate the alignment score based on L. An example of the asymmetric alignment will be given in Fig2.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Asymmetric Alignment Method",
"sec_num": "6.2"
},
{
"text": "In Fig2, the Chinese ON \"\u4e2d\u56fd\u519c\u4e1a\u94f6\u884c\" is aligned to an English sentence \"\u2026 the Agriculture Bank of China is the four\u2026\". The stop words in parentheses are deleted for they have no meaning in Chinese. In step 1, the English fragment contained in the square brackets is aligned with the Chinese ON. We can obtain an explicit matching L 1 , shown by arrows, and an alignment score. In step 2, the square brackets move right by one word, we can obtain a new matching L 2 and its corresponding alignment score, and so on. When we have calculated every consequent fragment in English sentence, we can find the best fragment \"the Agriculture Bank of China\" according to the alignment score as the translation equivalent.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Fig2. An example of asymmetric alignment",
"sec_num": null
},
{
"text": "The algorithm is shown in Fig3. Where, m is the number of words in an English sentence and n is the number of words in a Chinese ON. KM algorithm will generate an equivalent sub-graph by setting a value to each vertex. The edge whose weight is equal to the summation of the values of its two vertexes will be added into the sub-graph. Then the Hungary algorithm will be executed in the equivalent sub-graph to find the optimal matching. We find the optimal matching between CW 1,n and EW 1,n first. Then we move the window right and find the optimal matching between CW 1,n and EW 2,n+1 . The process will continue until the window arrives at the right most of the Step 1:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Fig2. An example of asymmetric alignment",
"sec_num": null
},
{
"text": "Step 2:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Fig2. An example of asymmetric alignment",
"sec_num": null
},
{
"text": "English sentence. When the window moves right, we only need to find a new matching for the new added English vertex EW end and the Chinese vertex C drop which has been matched with EW start in the last step. In the Hungary algorithm, the matching is added through finding an augmenting path. So we only need to find one augmenting path each time. The time complexity of finding an augmenting path is O(n 3 ). So the whole complexity of asymmetric alignment is O(m*n 3 ).",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Fig2. An example of asymmetric alignment",
"sec_num": null
},
{
"text": "Input: A segmented Chinese ON CO and an English sentence ES. Output: an English fragment EW k,k+n 1. Let start=1, end=n, L 0 =null 2. Using KM algorithm to find the optimal matching between two phrases CW 1,n and EW start,end based on the previous matching L start-1 . We obtain a matching L start and calculate the alignment score S start based on",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm: Asymmetric Alignment Algorithm",
"sec_num": null
},
{
"text": "L start . 3. CW drop = L(EW start ) L(CW drop )=null.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm: Asymmetric Alignment Algorithm",
"sec_num": null
},
{
"text": "4. If (end==m) go to 7, else start=start+1, end=end+1. 5. Calculate the feasible vertex labeling for the vertexes CW drop and EW end 6. Go to 2. 7. The fragment EW k,k+n-1 which has the highest alignment score will be returned.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Algorithm: Asymmetric Alignment Algorithm",
"sec_num": null
},
{
"text": "For each English sentence, we can obtain a fragment ES i,i+n which has the highest alignment score. We will also take into consideration the frequency information of the fragment and its distance away from the Chinese ON. We use formula (4) to obtain a final score for each translation candidate ET i and select the largest one as translation result.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Obtain the Translation Equivalent",
"sec_num": "6.3"
},
{
"text": "( )= + log( + 1)+ log(1 / + 1) i i i i S E T SA C D \u03b1 \u03b2 \u03b3",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Obtain the Translation Equivalent",
"sec_num": "6.3"
},
{
"text": "(4) Where C i denotes the frequency of ET i , and D i denotes the nearest distance between ET i and the Chinese ON.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Obtain the Translation Equivalent",
"sec_num": "6.3"
},
{
"text": "We carried out experiments to investigate the performance improvement of ON translation under the assistance of web knowledge.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experiments",
"sec_num": "7"
},
{
"text": "Our experiment data are extracted from LDC2005T34. There are two corpora, ldc_propernames_org_ce_v1.beta (Indus_corpus for short) and ldc_propernames_indu stry_ce_v1.beta (Org_corpus for short). Some pre-process will be executed to filter out some noisy translation pairs. For example, the translation pairs involving other languages such as Japanese and Korean will be filtered out. There are 65,835 translation pairs that we used as the training corpus and the chunk labels are added manually.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Data",
"sec_num": "7.1"
},
{
"text": "We randomly select 250 translation pairs from the Org_corpus and 253 translation pairs from the Indus_corpus. Altogether, there are 503 translation pairs as the testing set.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Experimental Data",
"sec_num": "7.1"
},
{
"text": "In order to evaluate the influence of segmentation results upon the statistical ON translation system, we compare the results of two translation models. One model uses chunking-based segmentation results as input, while the other uses traditional segmentation results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Effect of Chunking-based Segmentation upon ON Translation",
"sec_num": "7.2"
},
{
"text": "To train the CRFs-chunking model, we randomly selected 59,200 pairs of equivalent translations from Indus_corpus and org_corpus. We tested the performance on the set which contains 6,635 Chinese ONs and the results are shown as Table-2. For constructing a statistical ON translation model, we use GIZA++ 1 to align the Chinese NEs and the English NEs in the training set. Then the phrase-based machine translation system MOSES 2 is adopted to translate the 503 Chinese NEs in testing set into English. We have two metrics to evaluate the translation results. The first metric L1 is used to evaluate whether the translation result is exactly the same as the answer. The second metric L2 is used to evaluate whether the translation result contains almost the same words as the answer, without considering the order of words. The results are shown in Table- From the above experimental data, we can see that the chunking-based segmentation improves L1 precision from 18.29% to 21.47% and L2 precision from 36.78% to 40.76% in comparison with the traditional segmentation method. Because the segmentation results will be used in alignment, the errors will affect the computation of alignment probability. The chunking based segmentation can generate better segmentation results; therefore better alignment probabilities can be obtained.",
"cite_spans": [],
"ref_spans": [
{
"start": 228,
"end": 236,
"text": "Table-2.",
"ref_id": null
},
{
"start": 848,
"end": 854,
"text": "Table-",
"ref_id": null
}
],
"eq_spans": [],
"section": "The Effect of Chunking-based Segmentation upon ON Translation",
"sec_num": "7.2"
},
{
"text": "The heuristic query construction method aims to improve the efficiency of Web searching. The performance of searching for translation equivalents mostly depends on how to construct the query. To test its validity, we design four kinds of queries and evaluate their ability using the metric of average precision in formula 5 and macro average precision (MAP) in formula 6, where H i is the count of snippets that contain at least one equivalent for the ith query. And S i is the total number of snippets we got for the ith query,",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Efficiency of Query Construction",
"sec_num": "7.3"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "1 = 1 1 ( ) 1 j i H N j j i M A P R i N H = = \u2211 \u2211",
"eq_num": "(6)"
}
],
"section": "The Efficiency of Query Construction",
"sec_num": "7.3"
},
{
"text": "where R(i) is the order of snippet where the ith equivalent occurs. We construct four kinds of queries for the 503 Chinese ONs in testing set as follows: Q1: only the Chinese ON. Q2: the Chinese ON and the results of the statistical translation model. Q3: the Chinese ON and some parts' translation selected by the heuristic query construction method.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Efficiency of Query Construction",
"sec_num": "7.3"
},
{
"text": "Q4: the Chinese ON and its correct English translation equivalent.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Efficiency of Query Construction",
"sec_num": "7.3"
},
{
"text": "We obtain at most 100 snippets from Google for every query. Sometimes there are not enough snippets as we expect. We set \u03b1 in formula 4 at 0.7\uff0cand the threshold of translation confidence at 0.05. The results are shown as Here we can see that, the result of Q4 is the upper bound of the performance, and the Q1 is the lower bound of the performance. We concentrate on the comparison between Q2 and Q3. Q2 contains the translations of every word in a Chinese ON, while Q3 just contains the translations of the words we select using the heuristic method. Q2 may give more information to search engine about which web pages we expect to obtain, but it also brings in translation mistakes that may mislead the search engine. The results show that Q3 is better than Q2, which proves that a careful clue selection is needed.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Efficiency of Query Construction",
"sec_num": "7.3"
},
{
"text": "The asymmetric alignment method can avoid the mistakes made in the NER process and give an explicit alignment matching. We will compare the asymmetric alignment algorithm with the traditional alignment method on performance. We adopt two methods to align the Chinese NE with the English sentences. The first method has two phases, the English ONs are extracted from English sentences firstly, and then the English ONs are aligned with the Chinese ON. Lastly, the English ON with the highest alignment score will be selected as the translation equivalent. We use the software Lingpipe 3 to recognize NEs in the English sentences. The alignment probability can be calculated as formula 7:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "The Effect of Asymmetric Alignment Algorithm",
"sec_num": "7.4"
},
{
"text": "EQUATION",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [
{
"start": 0,
"end": 8,
"text": "EQUATION",
"ref_id": "EQREF",
"raw_str": "( , ) ( | ) i j i j Score C E p e c = \u2211 \u2211",
"eq_num": "(7)"
}
],
"section": "The Effect of Asymmetric Alignment Algorithm",
"sec_num": "7.4"
},
{
"text": "The second method is our asymmetric alignment algorithm. Our method is different from the one in [Wai Lam et al., 2007] which segmented a Chinese ON using an English ON as suggestion. We segment the Chinese ON using the chunking-based segmentation method. The English sentences extracted from snippets will be preprocessed. Some stop words will be deleted, such as \"the\", \"of\", \"on\" etc. To execute the extended KM algorithm for finding the best alignment matching, we must assure that the vertex number in each side of the bipartite is the same. So we will execute a phrase combination process before alignment, which combines some frequently occurring consequent English words into single vertex, such as \"limited company\" etc. The combination is based on the phrase pair table which is generated from phrase-based SMT system. The results are shown in From the results (column 1 and column 2) we can see that, the Asymmetric alignment method outperforms the traditional alignment method. Our method can overcome the mistakes introduced in the NER process. On the other hand, in our asymmetric alignment method, there are two main reasons which may result in mistakes, one is that the correct equivalent doesn't occur in the snippet; the other is that some English ONs can't be aligned to the Chinese ON word by word.",
"cite_spans": [
{
"start": 97,
"end": 119,
"text": "[Wai Lam et al., 2007]",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "The Effect of Asymmetric Alignment Algorithm",
"sec_num": "7.4"
},
{
"text": "Compared with the statistical ON translation model, we can see that the performance is improved from 18.29% to 48.71% (the bold data shown in column 1 and column 3 of Table 5 ) by using our Chinese-English ON translation system. Transforming the translation problem into the problem of searching for the correct translation equivalent in web pages has three advantages. First, word order determination is difficult in statistical machine translation (SMT), while search engines are insensitive to this problem. Second, SMT often loses some function word such as \"the\", \"a\", \"of\", etc, while our method can avoid this problem because such words are stop words in search engines. Third, SMT often makes mistakes in the selection of synonyms. This problem can be solved by the fuzzy matching of search engines. In summary, web assistant method makes Chinese ON translation easier than traditional SMT method.",
"cite_spans": [],
"ref_spans": [
{
"start": 167,
"end": 174,
"text": "Table 5",
"ref_id": "TABREF7"
}
],
"eq_spans": [],
"section": "Comparison between Statistical ON Translation Model and Our Method",
"sec_num": "7.5"
},
{
"text": "In this paper, we present a new approach which translates the Chinese ON into English with the assistance of web resources. We first adopt the chunking-based segmentation method to improve the ON segmentation. Then a heuristic query construction method is employed to construct a query which can search translation equivalent more efficiently. At last, the asymmetric alignment method aligns the Chinese ON with English sentences directly. The performance of ON translation is improved from 18.29% to 48.71%. It proves that our system can work well on the Chinese-English ON translation task. In the future, we will try to apply this method in mining the NE translation equivalents from monolingual web pages. In addition, the asymmetric alignment algorithm also has some space to be improved.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusion",
"sec_num": "8"
},
{
"text": "http://www.fjoch.com/GIZA++.html 2 http://www.statmt.org/moses/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "http://www.alias-i.com/lingpipe/",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Translating named entities using monolingual and bilingual resources",
"authors": [
{
"first": "Yaser",
"middle": [],
"last": "Al-Onaizan",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
}
],
"year": 2002,
"venue": "Proc of ACL-2002",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yaser Al-Onaizan and Kevin Knight. 2002. Translating named entities using monolingual and bilingual resources. In Proc of ACL-2002.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "A Structure-Based Model for Chinese Organization Name Translation",
"authors": [
{
"first": "Yufeng",
"middle": [],
"last": "Chen",
"suffix": ""
},
{
"first": "Chenqing",
"middle": [],
"last": "Zong",
"suffix": ""
}
],
"year": 2007,
"venue": "Proc. of ACM Transactions on Asian Language Information Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Yufeng Chen, Chenqing Zong. 2007. A Structure- Based Model for Chinese Organization Name Translation. In Proc. of ACM Transactions on Asian Language Information Processing (TALIP)",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "A new approach for English-Chinese named entity alignment",
"authors": [
{
"first": "Donghui",
"middle": [],
"last": "Feng",
"suffix": ""
},
{
"first": "Yajuan",
"middle": [],
"last": "Lv",
"suffix": ""
},
{
"first": "Ming",
"middle": [],
"last": "Zhou",
"suffix": ""
}
],
"year": 2004,
"venue": "Proc. of EMNLP",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Donghui Feng, Yajuan Lv, Ming Zhou. 2004. A new approach for English-Chinese named entity alignment. In Proc. of EMNLP 2004.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Improved named entity translation and bilingual named entity extraction",
"authors": [
{
"first": "Fei",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Stephan",
"middle": [],
"last": "Vogal",
"suffix": ""
}
],
"year": 2002,
"venue": "Proc. of the 4th IEEE International Conference on Multimodal Interface",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fei Huang, Stephan Vogal. 2002. Improved named entity translation and bilingual named entity extraction. In Proc. of the 4th IEEE International Conference on Multimodal Interface.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Automatic extraction of named entity translingual equivalence based on multi-feature cost minimization",
"authors": [
{
"first": "Fei",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Stephan",
"middle": [],
"last": "Vogal",
"suffix": ""
},
{
"first": "Alex",
"middle": [],
"last": "Waibel",
"suffix": ""
}
],
"year": 2001,
"venue": "Proc. of the 2003 Annual Conference of the ACL, Workshop on Multilingual and Mixed-language Named Entity Recognition Masaaki Nagata, Teruka Saito, and Kenji Suzuki",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Fei Huang, Stephan Vogal, Alex Waibel. 2003. Automatic extraction of named entity translingual equivalence based on multi-feature cost minimization. In Proc. of the 2003 Annual Conference of the ACL, Workshop on Multilingual and Mixed-language Named Entity Recognition Masaaki Nagata, Teruka Saito, and Kenji Suzuki. 2001. Using the Web as a Bilingual Dictionary. In Proc. of ACL 2001 Workshop on Data-driven Methods in Machine Translation.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "A hierarchical phrase-based model for statistical machine translation",
"authors": [
{
"first": "David",
"middle": [],
"last": "Chiang",
"suffix": ""
}
],
"year": 2005,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "David Chiang. 2005. A hierarchical phrase-based model for statistical machine translation. In Proc. of ACL 2005.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "A High-Accurate Chinese-English NE Backward Translation System Combining Both Lexical Information and Web Statistics",
"authors": [
{
"first": "Conrad",
"middle": [],
"last": "Chen",
"suffix": ""
}
],
"year": 2006,
"venue": "Proc. of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Conrad Chen, Hsin-His Chen. 2006. A High-Accurate Chinese-English NE Backward Translation System Combining Both Lexical Information and Web Statistics. In Proc. of ACL 2006.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Named Entity Translation Matching and Learning: With Application for Mining Unseen Translations",
"authors": [
{
"first": "Wai",
"middle": [],
"last": "Lam",
"suffix": ""
},
{
"first": "Shing-Kit",
"middle": [],
"last": "Chan",
"suffix": ""
}
],
"year": 2007,
"venue": "Proc. of ACM Transactions on Information Systems",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Wai Lam, Shing-Kit Chan. 2007. Named Entity Translation Matching and Learning: With Application for Mining Unseen Translations. In Proc. of ACM Transactions on Information Systems.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Alignment of bilingual named entities in parallel corpora using statistical models and multiple knowledge sources",
"authors": [
{
"first": "Chun-Jen",
"middle": [],
"last": "Lee",
"suffix": ""
},
{
"first": "Jason",
"middle": [
"S"
],
"last": "Chang",
"suffix": ""
},
{
"first": "R",
"middle": [],
"last": "Jyh-Shing",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Jang",
"suffix": ""
}
],
"year": 2006,
"venue": "Proc. of ACM Transactions on Asian Language Information Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chun-Jen Lee, Jason S. Chang, Jyh-Shing R. Jang. 2006. Alignment of bilingual named entities in parallel corpora using statistical models and multiple knowledge sources. In Proc. of ACM Transactions on Asian Language Information Processing (TALIP).",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "The Hungarian method for the assignment problem",
"authors": [
{
"first": "H",
"middle": [],
"last": "Kuhn",
"suffix": ""
}
],
"year": 1955,
"venue": "Naval Rese. Logist. Quart",
"volume": "2",
"issue": "",
"pages": "83--97",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kuhn, H. 1955. The Hungarian method for the assignment problem. Naval Rese. Logist. Quart 2,83-97.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "A phrase-based context-dependent joint probability model for named entity translation",
"authors": [
{
"first": "Min",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Haizhou",
"middle": [],
"last": "Li",
"suffix": ""
},
{
"first": "Su",
"middle": [],
"last": "Jian",
"suffix": ""
},
{
"first": "Hendra",
"middle": [],
"last": "Setiawan",
"suffix": ""
}
],
"year": 2005,
"venue": "Proc. of the 2nd International Joint Conference on Natural Language Processing",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Min Zhang., Haizhou Li, Su Jian, Hendra Setiawan. 2005. A phrase-based context-dependent joint probability model for named entity translation. In Proc. of the 2nd International Joint Conference on Natural Language Processing(IJCNLP)",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "Mining translations of OOV terms from the web through cross-lingual query expansion",
"authors": [
{
"first": "Ying",
"middle": [],
"last": "Zhang",
"suffix": ""
},
{
"first": "Fei",
"middle": [],
"last": "Huang",
"suffix": ""
},
{
"first": "Stephan",
"middle": [],
"last": "Vogel",
"suffix": ""
}
],
"year": 2005,
"venue": "Proc. of the 28th ACM SIGIR",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ying Zhang, Fei Huang, Stephan Vogel. 2005. Mining translations of OOV terms from the web through cross-lingual query expansion. In Proc. of the 28th ACM SIGIR.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Translating names and technical terms in Arabic text",
"authors": [
{
"first": "Bonnie",
"middle": [],
"last": "Glover Stalls",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Knight",
"suffix": ""
}
],
"year": 1998,
"venue": "Proc. of the COLING/ACL Workshop on Computational Approaches to Semitic Language",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Bonnie Glover Stalls and Kevin Knight. 1998. Translating names and technical terms in Arabic text. In Proc. of the COLING/ACL Workshop on Computational Approaches to Semitic Language.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "Conditional random fields: Probabilistic models for segmenting and labeling sequence data",
"authors": [
{
"first": "J",
"middle": [],
"last": "Lafferty",
"suffix": ""
},
{
"first": "A",
"middle": [],
"last": "Mccallum",
"suffix": ""
},
{
"first": "F",
"middle": [],
"last": "Pereira",
"suffix": ""
}
],
"year": 2001,
"venue": "Proc. ICML",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J. Lafferty, A. McCallum, and F. Pereira. 2001. Conditional random fields: Probabilistic models for segmenting and labeling sequence data. In Proc. ICML-2001.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Acquiring bilingual named entity translations from content-aligned corpora",
"authors": [
{
"first": "Tadashi",
"middle": [],
"last": "Kumano",
"suffix": ""
},
{
"first": "Hideki",
"middle": [],
"last": "Kashioka",
"suffix": ""
},
{
"first": "Hideki",
"middle": [],
"last": "Tanaka",
"suffix": ""
},
{
"first": "Takahiro",
"middle": [],
"last": "Fukusima",
"suffix": ""
}
],
"year": 2004,
"venue": "Proc. IJCNLP-04",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Tadashi Kumano, Hideki Kashioka, Hideki Tanaka and Takahiro Fukusima. 2004. Acquiring bilingual named entity translations from content-aligned corpora. In Proc. IJCNLP-04.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "Learning translation of named-entity phrases from parallel corpora",
"authors": [
{
"first": "Robert",
"middle": [
"C"
],
"last": "Moore",
"suffix": ""
}
],
"year": 2003,
"venue": "Proc. of 10 th conference of the European chapter of ACL",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Robert C. Moore. 2003. Learning translation of named-entity phrases from parallel corpora. In Proc. of 10 th conference of the European chapter of ACL.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"text": "System framework 1) Chunking-based ON Segmentation Module:",
"type_str": "figure",
"uris": null,
"num": null
},
"TABREF0": {
"html": null,
"content": "<table><tr><td/><td/><td/><td colspan=\"2\">In most</td></tr><tr><td>cases,</td><td>Name</td><td>chunks</td><td>should</td><td>be</td></tr><tr><td colspan=\"2\">transliterated.</td><td/><td/><td/></tr><tr><td colspan=\"3\">Modification Chunk (MC):</td><td/><td/></tr></table>",
"text": "MC contains the modification information of an ON. Key word Chunk (KC): KC contains the type information of an ON. The following is an example of an ON containing these four types of chunks.",
"type_str": "table",
"num": null
},
"TABREF1": {
"html": null,
"content": "<table><tr><td>,</td></tr></table>",
"text": "",
"type_str": "table",
"num": null
},
"TABREF2": {
"html": null,
"content": "<table/>",
"text": "Features used in CRFs model",
"type_str": "table",
"num": null
},
"TABREF6": {
"html": null,
"content": "<table><tr><td/><td>Average</td><td>MAP</td></tr><tr><td/><td>precision</td><td/></tr><tr><td>Q1</td><td>0.031</td><td>0.0527</td></tr><tr><td>Q2</td><td>0.187</td><td>0.2061</td></tr><tr><td>Q3</td><td>0.265</td><td>0.3129</td></tr><tr><td>Q4</td><td>1.000</td><td>1.0000</td></tr><tr><td colspan=\"3\">Table 4. Comparison of four types query</td></tr></table>",
"text": "",
"type_str": "table",
"num": null
},
"TABREF7": {
"html": null,
"content": "<table><tr><td/><td/><td/><td>:</td></tr><tr><td/><td>Asymmetric</td><td>Traditional</td><td>Statistical</td></tr><tr><td/><td>Alignment</td><td>method</td><td>model</td></tr><tr><td>Top1</td><td>48.71%</td><td>36.18%</td><td>18.29%</td></tr><tr><td>Top5</td><td>53.68%</td><td>46.12%</td><td>--</td></tr><tr><td colspan=\"4\">Table 5. Comparison the precision of alignment</td></tr><tr><td/><td colspan=\"2\">method</td><td/></tr></table>",
"text": "",
"type_str": "table",
"num": null
}
}
}
} |