File size: 84,235 Bytes
6fa4bc9 |
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333 334 335 336 337 338 339 340 341 342 343 344 345 346 347 348 349 350 351 352 353 354 355 356 357 358 359 360 361 362 363 364 365 366 367 368 369 370 371 372 373 374 375 376 377 378 379 380 381 382 383 384 385 386 387 388 389 390 391 392 393 394 395 396 397 398 399 400 401 402 403 404 405 406 407 408 409 410 411 412 413 414 415 416 417 418 419 420 421 422 423 424 425 426 427 428 429 430 431 432 433 434 435 436 437 438 439 440 441 442 443 444 445 446 447 448 449 450 451 452 453 454 455 456 457 458 459 460 461 462 463 464 465 466 467 468 469 470 471 472 473 474 475 476 477 478 479 480 481 482 483 484 485 486 487 488 489 490 491 492 493 494 495 496 497 498 499 500 501 502 503 504 505 506 507 508 509 510 511 512 513 514 515 516 517 518 519 520 521 522 523 524 525 526 527 528 529 530 531 532 533 534 535 536 537 538 539 540 541 542 543 544 545 546 547 548 549 550 551 552 553 554 555 556 557 558 559 560 561 562 563 564 565 566 567 568 569 570 571 572 573 574 575 576 577 578 579 580 581 582 583 584 585 586 587 588 589 590 591 592 593 594 595 596 597 598 599 600 601 602 603 604 605 606 607 608 609 610 611 612 613 614 615 616 617 618 619 620 621 622 623 624 625 626 627 628 629 630 631 632 633 634 635 636 637 638 639 640 641 642 643 644 645 646 647 648 649 650 651 652 653 654 655 656 657 658 659 660 661 662 663 664 665 666 667 668 669 670 671 672 673 674 675 676 677 678 679 680 681 682 683 684 685 686 687 688 689 690 691 692 693 694 695 696 697 698 699 700 701 702 703 704 705 706 707 708 709 710 711 712 713 714 715 716 717 718 719 720 721 722 723 724 725 726 727 728 729 730 731 732 733 734 735 736 737 738 739 740 741 742 743 744 745 746 747 748 749 750 751 752 753 754 755 756 757 758 759 760 761 762 763 764 765 766 767 768 769 770 771 772 773 774 775 776 777 778 779 780 781 782 783 784 785 786 787 788 789 790 791 792 793 794 795 796 797 798 799 800 801 802 803 804 805 806 807 808 809 810 811 812 813 814 815 816 817 818 819 820 821 822 823 824 825 826 827 828 829 830 831 832 833 834 835 836 837 838 839 840 841 842 843 844 845 846 847 848 849 850 851 852 853 854 855 856 857 858 859 860 861 862 863 864 865 866 867 868 869 870 871 872 873 874 875 876 877 878 879 880 881 882 883 884 885 886 887 888 889 890 891 892 893 894 895 896 897 898 899 900 901 902 903 904 905 906 907 908 909 910 911 912 913 914 915 916 917 918 919 920 921 922 923 924 925 926 927 928 929 930 931 932 933 934 935 936 937 938 939 940 941 942 943 944 945 946 947 948 949 950 951 952 953 954 955 956 957 958 959 960 961 962 963 964 965 966 967 968 969 970 971 972 973 974 975 976 977 978 979 980 981 982 983 984 985 986 987 988 989 990 991 992 993 994 995 996 997 998 999 1000 1001 1002 1003 1004 1005 1006 1007 1008 1009 1010 1011 1012 1013 1014 1015 1016 1017 1018 1019 1020 1021 1022 1023 1024 1025 1026 1027 1028 1029 1030 1031 1032 1033 1034 1035 1036 1037 1038 1039 1040 1041 1042 1043 1044 1045 1046 1047 1048 1049 1050 1051 1052 1053 1054 1055 1056 1057 1058 1059 1060 1061 1062 1063 1064 1065 1066 1067 1068 1069 1070 1071 1072 1073 1074 1075 1076 1077 1078 1079 1080 1081 1082 1083 1084 1085 1086 1087 1088 1089 1090 1091 1092 1093 1094 1095 1096 1097 1098 1099 1100 1101 1102 1103 1104 1105 1106 1107 1108 1109 1110 1111 1112 1113 1114 1115 1116 1117 1118 1119 1120 1121 1122 1123 1124 1125 1126 1127 1128 1129 1130 1131 1132 1133 1134 1135 1136 1137 1138 1139 1140 1141 1142 1143 1144 1145 1146 1147 1148 1149 1150 1151 1152 1153 1154 1155 1156 1157 1158 1159 1160 1161 1162 1163 1164 1165 1166 1167 1168 1169 1170 1171 1172 1173 1174 1175 1176 1177 1178 1179 1180 1181 1182 1183 1184 1185 1186 1187 1188 1189 1190 1191 1192 1193 1194 1195 1196 1197 1198 1199 1200 1201 1202 1203 1204 1205 1206 1207 1208 1209 1210 1211 1212 1213 1214 1215 1216 1217 1218 1219 1220 1221 1222 1223 1224 1225 1226 1227 1228 1229 1230 1231 1232 1233 1234 1235 1236 1237 1238 1239 1240 1241 1242 1243 1244 1245 1246 1247 1248 1249 1250 1251 1252 1253 1254 1255 1256 1257 1258 1259 1260 1261 1262 1263 1264 1265 1266 1267 1268 1269 1270 1271 1272 1273 1274 1275 1276 1277 1278 1279 1280 1281 1282 1283 1284 1285 1286 1287 1288 1289 1290 1291 1292 1293 1294 1295 1296 1297 1298 1299 1300 1301 1302 1303 1304 1305 1306 1307 1308 1309 1310 1311 1312 1313 1314 1315 1316 1317 1318 1319 1320 1321 1322 1323 1324 1325 1326 1327 1328 1329 1330 1331 1332 1333 1334 1335 1336 1337 1338 1339 1340 1341 1342 1343 1344 1345 1346 1347 1348 1349 1350 1351 1352 1353 1354 1355 1356 1357 1358 1359 1360 1361 1362 1363 1364 1365 1366 1367 1368 1369 1370 1371 1372 1373 1374 1375 1376 1377 1378 1379 1380 1381 1382 1383 1384 1385 1386 1387 1388 1389 1390 1391 1392 1393 1394 1395 1396 1397 1398 1399 1400 1401 1402 1403 1404 1405 1406 1407 1408 1409 1410 1411 1412 1413 1414 1415 1416 1417 1418 1419 1420 1421 1422 1423 1424 1425 1426 1427 1428 1429 1430 1431 1432 1433 1434 1435 1436 1437 1438 1439 1440 1441 1442 1443 1444 1445 1446 1447 1448 1449 1450 1451 1452 1453 1454 1455 1456 1457 1458 1459 1460 1461 1462 1463 1464 1465 1466 1467 1468 1469 1470 1471 1472 1473 1474 1475 1476 1477 1478 1479 1480 1481 1482 1483 1484 1485 1486 1487 1488 1489 1490 1491 1492 1493 1494 1495 1496 1497 1498 1499 1500 1501 1502 1503 1504 1505 1506 1507 1508 1509 1510 1511 1512 1513 1514 1515 1516 1517 1518 1519 1520 1521 1522 1523 1524 1525 1526 1527 1528 1529 1530 1531 1532 1533 1534 1535 1536 1537 1538 1539 1540 1541 1542 1543 1544 1545 1546 1547 1548 1549 1550 1551 1552 1553 1554 1555 1556 1557 1558 1559 1560 1561 1562 1563 1564 1565 1566 1567 1568 1569 1570 1571 1572 1573 1574 1575 1576 1577 1578 1579 1580 1581 1582 1583 1584 1585 1586 1587 1588 1589 1590 1591 1592 1593 1594 1595 1596 1597 1598 1599 1600 1601 1602 1603 1604 1605 1606 1607 1608 1609 1610 1611 1612 1613 1614 1615 1616 1617 1618 1619 1620 1621 1622 1623 1624 1625 1626 1627 1628 1629 1630 1631 1632 1633 1634 1635 1636 1637 1638 1639 1640 1641 1642 1643 1644 1645 1646 1647 1648 1649 1650 1651 1652 1653 1654 1655 1656 1657 1658 1659 1660 1661 |
{
"paper_id": "2020",
"header": {
"generated_with": "S2ORC 1.0.0",
"date_generated": "2023-01-19T01:49:03.507992Z"
},
"title": "CLIReval: Evaluating Machine Translation as a Cross-Lingual Information Retrieval Task",
"authors": [
{
"first": "Shuo",
"middle": [],
"last": "Sun",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Johns Hopkins University",
"location": {}
},
"email": ""
},
{
"first": "Suzanna",
"middle": [],
"last": "Sia",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Johns Hopkins University",
"location": {}
},
"email": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Duh",
"suffix": "",
"affiliation": {
"laboratory": "",
"institution": "Johns Hopkins University",
"location": {}
},
"email": "kevinduh@cs.jhu.edu"
}
],
"year": "",
"venue": null,
"identifiers": {},
"abstract": "We present CLIReval, an easy-to-use toolkit for evaluating machine translation (MT) with the proxy task of cross-lingual information retrieval (CLIR). Contrary to what the project name might suggest, CLIReval does not actually require any annotated CLIR dataset. Instead, it automatically transforms translations and references used in MT evaluations into a synthetic CLIR dataset; it then sets up a standard search engine (Elasticsearch) and computes various information retrieval metrics (e.g., mean average precision) by treating the translations as documents to be retrieved. The idea is to gauge the quality of MT by its impact on the document translation approach to CLIR. As a case study, we run CLIReval on the \"metrics shared task\" of WMT2019; while this extrinsic metric is not intended to replace popular intrinsic metrics such as BLEU, results suggest CLIReval is competitive in many language pairs in terms of correlation to human judgments of quality. CLIReval is publicly available at https: //github.com/ssun32/CLIReval.",
"pdf_parse": {
"paper_id": "2020",
"_pdf_hash": "",
"abstract": [
{
"text": "We present CLIReval, an easy-to-use toolkit for evaluating machine translation (MT) with the proxy task of cross-lingual information retrieval (CLIR). Contrary to what the project name might suggest, CLIReval does not actually require any annotated CLIR dataset. Instead, it automatically transforms translations and references used in MT evaluations into a synthetic CLIR dataset; it then sets up a standard search engine (Elasticsearch) and computes various information retrieval metrics (e.g., mean average precision) by treating the translations as documents to be retrieved. The idea is to gauge the quality of MT by its impact on the document translation approach to CLIR. As a case study, we run CLIReval on the \"metrics shared task\" of WMT2019; while this extrinsic metric is not intended to replace popular intrinsic metrics such as BLEU, results suggest CLIReval is competitive in many language pairs in terms of correlation to human judgments of quality. CLIReval is publicly available at https: //github.com/ssun32/CLIReval.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Abstract",
"sec_num": null
}
],
"body_text": [
{
"text": "Machine translation (MT) is the task of automatically translating sentences from a source language to a target language. A natural question that arises is how do we determine whether an MT system is translating sentences well? One answer is that we can engage human translators to evaluate the translated sentences manually. Unfortunately, evaluating translations can be relatively time-consuming and worse, the fact that the quality of translation is inherently subjective can lead to variations among different human translators. The desire for fast and consistent evaluation has led to the emergence of a plethora of automatic evaluation metrics such as BLEU (Papineni et al., 2002) , TER (Snover et al., 2006) , METOR (Banerjee and Lavie, 2005) and BEER (Stanojevi\u0107 and Sima'an, 2014) . Out of the aforementioned metrics, BLEU has become the de facto evaluation metric for machine translation. It calculates the weighted average of n-gram precision between a translated sentence and a reference sentence. Nevertheless, BLEU, too, has its problems. For example, Callison-Burch et al. (2006) showed that an improved BLEU score does not represent an actual improvement in translation quality.",
"cite_spans": [
{
"start": 662,
"end": 685,
"text": "(Papineni et al., 2002)",
"ref_id": "BIBREF14"
},
{
"start": 692,
"end": 713,
"text": "(Snover et al., 2006)",
"ref_id": "BIBREF21"
},
{
"start": 722,
"end": 748,
"text": "(Banerjee and Lavie, 2005)",
"ref_id": "BIBREF0"
},
{
"start": 758,
"end": 788,
"text": "(Stanojevi\u0107 and Sima'an, 2014)",
"ref_id": "BIBREF22"
},
{
"start": 1065,
"end": 1093,
"text": "Callison-Burch et al. (2006)",
"ref_id": "BIBREF4"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "There are also some proposals to evaluate the quality of translations with the help of extrinsic proxy tasks. Berka et al. (2011) collected short English documents from various domains and created yes and no questions in Czech. They then translated the English documents into Czech and evaluated the quality of the MT systems based on human performances on the documents and questions in Czech. Scarton and Specia (2016) translated a dataset of German reading comprehension tests into English with various MT systems such as Google Translate and Bing Translate and judged the quality of translations based on human performances on the translated reading comprehension datasets. Unfortunately, these external tasks suffer from the same scalability and consistency issues as manual evaluation.",
"cite_spans": [
{
"start": 110,
"end": 129,
"text": "Berka et al. (2011)",
"ref_id": "BIBREF2"
},
{
"start": 395,
"end": 420,
"text": "Scarton and Specia (2016)",
"ref_id": "BIBREF19"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "One downstream task that relies heavily on MT but has not been used as a method to evaluate MT systems is the task of Cross-Lingual Information Retrieval (CLIR). CLIR is a task in which search queries are issued in one language, and the retrieved relevant documents are written in a different language. Two commonly used methods in CLIR are query translation, where queries are translated into the same language as the documents and document translation where documents are translated into the same language as the queries (Zhou et al., 2012; Oard, 1998; McCarley, 1999) . A monolingual IR system is then used to obtain search results.",
"cite_spans": [
{
"start": 523,
"end": 542,
"text": "(Zhou et al., 2012;",
"ref_id": "BIBREF24"
},
{
"start": 543,
"end": 554,
"text": "Oard, 1998;",
"ref_id": "BIBREF13"
},
{
"start": 555,
"end": 570,
"text": "McCarley, 1999)",
"ref_id": "BIBREF9"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "CLIR is an active field of research, and previ-ous works suggest that the performance of CLIR correlates highly with the quality of the MT (Zhu and Wang, 2006; Nie, 2010; Yarmohammadi et al., 2019) . Therefore, we expect IR metrics to be good indicators of the quality of translations. Unfortunately, there is currently no publicly available tool to facilitate research in this area, and this motivates us to design and implement CLIReval.",
"cite_spans": [
{
"start": 139,
"end": 159,
"text": "(Zhu and Wang, 2006;",
"ref_id": "BIBREF25"
},
{
"start": 160,
"end": 170,
"text": "Nie, 2010;",
"ref_id": "BIBREF12"
},
{
"start": 171,
"end": 197,
"text": "Yarmohammadi et al., 2019)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "CLIReval is a lightweight python-based MT evaluation toolkit that consumes the same inputs as other automatic MT evaluation tools such as multibleu.perl and SacreBLEU (Post, 2018) and does not require any additional annotated CLIR data. Instead, it automatically transforms inputs into a synthetic CLIR dataset on the fly with the help of an Information Retrieval (IR) system. It implements the document translation approach to CLIR, where MT translations are viewed as documents and indexed using a commonly-used search engine (Elasticsearch).",
"cite_spans": [
{
"start": 167,
"end": 179,
"text": "(Post, 2018)",
"ref_id": "BIBREF15"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "As a case study, we test CLIReval on the metrics shared task of WMT2019 (Ma et al., 2019) , which measures the Pearson correlations (r) between automatically generated MT metrics and human judgments. Results show that CLIReval consistently performs at the level of r \u2265 0.9 and is on par or even outperforms popular metrics such as BLEU on multiple language directions. Further, this is achieved without using external data or doing domain-based parameter tuning. These promising results highlight the potential of CLIR as a proxy task for MT evaluation, and we hope CLIReval can facilitate future research in this area.",
"cite_spans": [
{
"start": 72,
"end": 89,
"text": "(Ma et al., 2019)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Our key contributions in this work can be summarized as follows:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "1. We release CLIReval, 1 an open-source toolkit that evaluates the quality of MT outputs in the context of a CLIR system, without the need for any actual CLIR dataset. The only inputs required to the tool are the translations and the references. It is easy to use in that with a single script, the tool will create a synthetic CLIR dataset, index the translations as documents, and report metrics such as mean average precision.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "2. We demonstrate that CLIReval can perform as well as popular intrinsic MT metrics on recent WMT metrics shared task, without supervision from external datasets and domain-based parameter tuning. Results suggest that CLIR is a feasible proxy task for MT evaluation and is worth further exploration in future research.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Introduction",
"sec_num": "1"
},
{
"text": "Given a set of source documents S, an MT system \u03c6 converts S into a set of translated documents, T = \u03c6(S) . Intrinsic MT metrics directly calculate an aggregated score between the sentences in T and sentences in R, where R is a set of reference documents. 2 We propose an alternative way to evaluate \u03c6 by first converting it into a proxy CLIR task and then evaluate the MT system with extrinsic IR metrics. First, CLIReval extracts a set of synthetic search queries Q from R. Second, given a monolingual information retrieval (IR) engine \u03c1, we can run these queries Q over the document collection R to obtain a set of \"relevant\" documents for Q. We use the notation \u03c1(Q, R) to refer to this set of desired returned search results. Now, our goal is to evaluate the quality of the translation T = \u03c6(S) under the same IR engine \u03c1. We index the documents T into the IR engine and submit the same queries to obtain the search results \u03c1(Q, T ). Finally, we can measure the performance of the CLIR system by comparing \u03c1(Q, T ) to \u03c1(Q, R), and calculating IR metrics such as mean average precision.",
"cite_spans": [
{
"start": 256,
"end": 257,
"text": "2",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Approach",
"sec_num": "2"
},
{
"text": "This approach makes several assumptions. First, CLIReval implements the document translation approach to CLIR and evaluates MT quality in that context; additionally, we assume that \u03c1 is a robust and reasonable IR engine that can be used across a wide range of situations. Second, we assume R contains the \"correct\" translations of S, and that \u03c1(Q, R) is a good approximation of the optimal search results. Third, we assume that automatically-generated Q can mimic that actual information needs of manually-crafted queries. If these caveats are acknowledged, then CLIReval is a reasonable tool for MT evaluation. 3. Query both instances of IR system with the same set of generated search queries. where the inputs are standard text files that",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Approach",
"sec_num": "2"
},
{
"text": "CLIReval ingests a system output translation (MT) file which contains documents translated by an MT system and a reference (REF) file, which contains reference translations of the same source documents. Our system supports two input file formats:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input files",
"sec_num": "3.1"
},
{
"text": "1. The SGML format commonly used by the news translation shared task from the annual conference on machine translation (Barrault et al., 2019) . This is also the input format required by the NIST BLEU scoring tool. 5 In a SGML file, every translated sentence segment is placed in a <seg> tag, and sentence segments belonging to the same document are placed in the same <doc> tag. Every <doc> tag must also contain a unique document id attribute used to identify the document.",
"cite_spans": [
{
"start": 119,
"end": 142,
"text": "(Barrault et al., 2019)",
"ref_id": "BIBREF1"
},
{
"start": 215,
"end": 216,
"text": "5",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Input files",
"sec_num": "3.1"
},
{
"text": "2. A text file where each line contains a sentence. A user can supply an optional mapping file that maps a line number to a (document id and, segment id) tuple. If a mapping file is not specified, CLIReval will create an artificial document boundary every N sentences. 6",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input files",
"sec_num": "3.1"
},
{
"text": "For either format, the number of documents in the MT file must be equivalent to the number of documents in the REF file. Further, the number of sentence segments in a machine translated document must also match the number of sentence segments in the corresponding reference document.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Input files",
"sec_num": "3.1"
},
{
"text": "The query generator module ingests data in the REF file and automatically generates search queries. CLIReval has two modes for query generation, which can be specified with the query mode argument:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Query Generator",
"sec_num": "3.2"
},
{
"text": "1. In sentences mode, the query generator extracts all reference sentences from the input Figure 2 : R is a set of sample reference documents and each document contains two sentences, while T is a set of sample translated documents. 2. In unique terms mode, the query generator treats all unique terms as queries. For Elasticsearch, these terms can be obtained from the term vectors of all indexed documents.",
"cite_spans": [],
"ref_spans": [
{
"start": 90,
"end": 98,
"text": "Figure 2",
"ref_id": null
}
],
"eq_spans": [],
"section": "Query Generator",
"sec_num": "3.2"
},
{
"text": "We recognize that using sentences or unique terms as queries might be less ideal than using real search queries, but getting relevant humangenerated queries can be time-consuming and expensive. Our query generation methods are cheap and fast, which enables quick experimentation. Examples of R and T are shown in Figure 2 , and the resulting queries generated from R are shown in Figure 3 . In the example, we have two documents D 1 and D 2 each with two sentences S 1 and S 2 . In the sentence mode for query generation, each of the four sentences in R are used as queries; in the unique terms mode, the 6 vocabulary words are extracted as query.",
"cite_spans": [],
"ref_spans": [
{
"start": 313,
"end": 321,
"text": "Figure 2",
"ref_id": null
},
{
"start": 380,
"end": 388,
"text": "Figure 3",
"ref_id": "FIGREF2"
}
],
"eq_spans": [],
"section": "Query Generator",
"sec_num": "3.2"
},
{
"text": "To ensure consistent and reproducible results, we choose Elasticsearch 7 as the default backend IR system for CLIReval and adopt well-tested search configurations. 8 Elasticsearch is an open-source, lightweight, and fast search engine written in Java. We pick Elasticsearch for three reasons:",
"cite_spans": [
{
"start": 164,
"end": 165,
"text": "8",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Information Retrieval (IR) System",
"sec_num": "3.3"
},
{
"text": "First, Elasticsearch has built-in analyzers for a wide variety of languages, which allows CLIReval to support many translation tasks beyond English as the target language. Analyzers are Elasticsearch modules that preprocess and tokenize queries and documents according to language-specific rules. It also implements stopwords removal and stemming. These are important operations that affect the quality of search results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Information Retrieval (IR) System",
"sec_num": "3.3"
},
{
"text": "Second, Elasticsearch implements many competitive retrieval models used by IR researchers and practitioners. By default, CLIReval uses the Okapi BM25 (Robertson et al., 2009) score to measure the degree of similarity of documents to a given search query. Note that BM25 shows strong performances on many datasets (Chapelle and Chang, 2011; Mc-Donald et al., 2018) and frequently outperforms newer \"state of the art\" methods (Guo et al., 2016) . It is also fast to compute, allowing CLIReval to run in a highly efficient manner.",
"cite_spans": [
{
"start": 150,
"end": 174,
"text": "(Robertson et al., 2009)",
"ref_id": "BIBREF17"
},
{
"start": 313,
"end": 339,
"text": "(Chapelle and Chang, 2011;",
"ref_id": "BIBREF5"
},
{
"start": 340,
"end": 363,
"text": "Mc-Donald et al., 2018)",
"ref_id": null
},
{
"start": 424,
"end": 442,
"text": "(Guo et al., 2016)",
"ref_id": "BIBREF6"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Information Retrieval (IR) System",
"sec_num": "3.3"
},
{
"text": "Third, Elasticsearch is a widely used search engine solution that is supported on various platforms. This increases the ease of installation for users of CLIReval.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Information Retrieval (IR) System",
"sec_num": "3.3"
},
{
"text": "CLIReval separately indexes the documents from MT and REF files into two instances of Elasticsearch. It then queries the Elasticsearch instances with the generated query strings. For every query, Elasticsearch returns the top 100 documents ranked by BM25 scores. Since trec eval only accepts discrete relevance judgment labels, the relevance label converter module is used to convert search scores from REF-IR into discrete labels.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Information Retrieval (IR) System",
"sec_num": "3.3"
},
{
"text": "We implement three ways of converting raw BM25 scores of REF-IR into discrete relevance judgment labels:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Relevance Label Converter",
"sec_num": "3.4"
},
{
"text": "The query in document method (Schamoni et al., 2014; Sasaki et al., 2018) assigns 1 to a document if and only if the given search query Figure 4 : Given queries from the query generator and documents from R, we can obtain relevance scores from an IR system. The relevance label converter then converts those relevance scores into discrete relevance labels via different conversion modes.",
"cite_spans": [
{
"start": 29,
"end": 52,
"text": "(Schamoni et al., 2014;",
"ref_id": "BIBREF20"
},
{
"start": 53,
"end": 73,
"text": "Sasaki et al., 2018)",
"ref_id": "BIBREF18"
}
],
"ref_spans": [
{
"start": 136,
"end": 144,
"text": "Figure 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Relevance Label Converter",
"sec_num": "3.4"
},
{
"text": "is extracted from that document. Consequently, there will only be one relevant document per search query.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Relevance Label Converter",
"sec_num": "3.4"
},
{
"text": "The percentile method assigns 1 to documents with BM25 scores in the top 25 percentile of all document scores returned by the IR system and 0 otherwise. The cutoff percentile value can be adjusted with the n percentile argument.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Relevance Label Converter",
"sec_num": "3.4"
},
{
"text": "Th Jenks methods uses Jenks natural breaks optimization 9 to automatically break a list of BM25 scores into different classes. This is achieved by minimizing the variance of BM25 scores within a class and at the same time maximize the variance of average BM25 scores between classes (McMaster and McMaster, 2002) . Following the conventions of publicly available IR datasets (Chapelle and Chang, 2011; Qin and Liu, 2013) , we break the BM25 scores into 5 relevance judgment classes, where 4 indicates that a document is highly relevant to a given query and 0 indicates that a document is not relevant to a given query. For each query, CLIReval normalizes the BM25 scores of 9 https://en.wikipedia.org/wiki/Jenks_ natural_breaks_optimization retrieved documents to the range [0, 1] and use Jenks natural breaks optimization to convert the BM25 scores into discrete relevance judgment labels. Users can specify the number of classes with the jenks nb class argument. Figure 4 illustrates an example of how relevance labels are generated for each query-document pair using the generated query Q (see Section 3.2 and the reference documents R provided by the user. First, raw BM25 scores are obtained by indexing R in an IR system and searching with Q. These scores are then converted to discrete labels in one of three ways.",
"cite_spans": [
{
"start": 283,
"end": 312,
"text": "(McMaster and McMaster, 2002)",
"ref_id": "BIBREF11"
},
{
"start": 375,
"end": 401,
"text": "(Chapelle and Chang, 2011;",
"ref_id": "BIBREF5"
},
{
"start": 402,
"end": 420,
"text": "Qin and Liu, 2013)",
"ref_id": null
}
],
"ref_spans": [
{
"start": 965,
"end": 973,
"text": "Figure 4",
"ref_id": null
}
],
"eq_spans": [],
"section": "Relevance Label Converter",
"sec_num": "3.4"
},
{
"text": "To summarize: after the queries and relevance labels are prepared (as in Section 3.2 and 3.4), the MT output T (e.g. Figure 2 , left) is indexed into another IR system. Finally, we run the queries Q through this MT-IR system to obtain document scores \u03c1(Q, T ) (e.g. Figure 1 , left branch), which can be evaluated with respect to the relevance labels. We do this final evaluation with the standard trec eval toolkit.",
"cite_spans": [],
"ref_spans": [
{
"start": 117,
"end": 125,
"text": "Figure 2",
"ref_id": null
},
{
"start": 266,
"end": 274,
"text": "Figure 1",
"ref_id": "FIGREF0"
}
],
"eq_spans": [],
"section": "IR Metrics",
"sec_num": "3.5"
},
{
"text": "The trec eval toolkit returns a large number of IR metrics but CLIReval is configured to return only two of the most popular IR metrics by default:",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "IR Metrics",
"sec_num": "3.5"
},
{
"text": "\u2022 Mean average precision (MAP) is the mean of the average precision scores for each query (Buckley and Voorhees, 2005 ).",
"cite_spans": [
{
"start": 90,
"end": 117,
"text": "(Buckley and Voorhees, 2005",
"ref_id": "BIBREF3"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "IR Metrics",
"sec_num": "3.5"
},
{
"text": "\u2022 Normalized discounted cumulative gain (NDCG) is a metric that measures the usefulness of documents based on their ranks in the search results (J\u00e4rvelin and Kek\u00e4l\u00e4inen, 2002) and is normalized to [0, 1].",
"cite_spans": [
{
"start": 144,
"end": 175,
"text": "(J\u00e4rvelin and Kek\u00e4l\u00e4inen, 2002)",
"ref_id": "BIBREF7"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "IR Metrics",
"sec_num": "3.5"
},
{
"text": "We choose MAP because it is a widely understood metric, and NDCG because it allows for multiple levels of relevance labels. We follow standard practice in IR benchmark datasets such as Chapelle and Chang (2011) and calculate both metrics at the cutoff threshold of 10 documents. We name these metrics as MAP@10 and NDCG@10.",
"cite_spans": [
{
"start": 185,
"end": 210,
"text": "Chapelle and Chang (2011)",
"ref_id": "BIBREF5"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "IR Metrics",
"sec_num": "3.5"
},
{
"text": "CLIReval is written in Python 3 and works on Python 3.5 and later. Elasticsearch requires at least Java 8. We provide a shell script that automatically downloads and installs Elasticsearch 6.5.3 and the latest version of trec eval. It also installs additional Elasticsearch plugins that support additional languages. In total, CLIReval has built-in support for 36 languages and for unsupported languages, it will fall back to the default standard analyzer, which is based on the Unicode text segmentation algorithm. 10 We tested CLIReval extensively in the Unix/Linux environment, but it should work in other environments with minimal modification.",
"cite_spans": [
{
"start": 516,
"end": 518,
"text": "10",
"ref_id": null
}
],
"ref_spans": [],
"eq_spans": [],
"section": "Installation",
"sec_num": "3.6"
},
{
"text": "To demonstrate the utility of CLIReval, we test it on the metrics shared task of WMT2019. 11 The metrics task (Ma et al., 2019) is designed to evaluate outputs from automatic MT metrics against actual human ratings on machine translation systems. The goal is to find evaluation methods that have high Pearson correlations with human judgments. For every system in every language direction, we compute multiple system-level scores (different IR metrics) with CLIReval.",
"cite_spans": [
{
"start": 110,
"end": 127,
"text": "(Ma et al., 2019)",
"ref_id": "BIBREF23"
}
],
"ref_spans": [],
"eq_spans": [],
"section": "WMT metrics shared task",
"sec_num": "4.1"
},
{
"text": "In total, there are 18 language directions, and for every language direction, a reference file and 11 to 22 system generated translation files are provided. In every reference file, there are around 1000 to 2000 sentences in 70 to 140 documents. The only exceptions are French-German and German-French, where all sentences are placed in the same document. Since document boundaries are not clearly defined in these language directions, we are excluding them from this case study.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "WMT metrics shared task",
"sec_num": "4.1"
},
{
"text": "We used an Intel Xeon E5 Linux server with 64GB RAM. For every language direction, CLIReval runs consistently at the rate of around 0.2 to 0.3 seconds per document and it takes less than a minute to get results.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Run Time",
"sec_num": "4.2"
},
{
"text": "We use the official evaluation scripts 12 to compute linear correlations between IR metrics and human judgments. Table 1 presents the results for 16 language directions and IR metrics perform well. On Jenks mode, NDCG@10 outperforms BLEU and NIST on 10 out of the 16 language directions. Further, the 4 IR metrics collectively hold the top scores for 6 language directions. BEER seems to be a little bit better than the IR metrics, claiming the top spot for 7 language directions. Note that the participating BEER system is trained on provided in-domain data, while we are getting comparable results without any tuning. It is also worth pointing out that the intrinsic MT metrics work at sentence level while in comparison, CLIReval works at the documentlevel. Nonetheless, the results are encouraging and show the potential of CLIR as a proxy task for MT evaluation.",
"cite_spans": [],
"ref_spans": [
{
"start": 113,
"end": 120,
"text": "Table 1",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "4.3"
},
{
"text": "4.4 Analysis: BLEU vs. NDCG Figure 5 : Scatterplot of sentence-level NDCG@10 vs sentence-level BLEU on zh-en and en-gu. For better visualization, only 300 random samples from each language direction are shown.",
"cite_spans": [],
"ref_spans": [
{
"start": 28,
"end": 36,
"text": "Figure 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "4.3"
},
{
"text": "To get a deeper comparison between CLIReval and the most popular MT metric, BLEU, we randomly select two systems (Baidu-system for zh-en and UEDIN for en-gu) and calculate sentence-level BLEU and sentence-level NDCG@10 scores 13 on both systems. As we can see in Figure 5 , there is no clear correlation between sentence-level NDCG@10 and sentence-level BLEU scores. To be more exact, the Pearson correlations between the two metrics is almost non-existent, at -0.021 and -0.032 for zh-en and en-gu respectively. This shows that the two metrics are qualitatively different and contribute different perspectives to MT evaluation.",
"cite_spans": [],
"ref_spans": [
{
"start": 263,
"end": 271,
"text": "Figure 5",
"ref_id": null
}
],
"eq_spans": [],
"section": "Results",
"sec_num": "4.3"
},
{
"text": "We present CLIReval, an open-source pythonbased evaluation toolkit for machine translation.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Conclusions",
"sec_num": "5"
},
{
"text": "https://github.com/ssun32/CLIReval",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "When document boundaries are not defined, CLIReval automatically creates artificial document boundaries. The default option is to treat each sentence as a document for retrieval purposes.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "https://github.com/usnistgov/trec_ eval one might pass to multi-bleu.perl, or standard SGML files that one might pass to mteval-v13a.pl, both of which are common BLEU scripts for MT.4",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "https://github.com/moses-smt/ mosesdecoder/blob/master/scripts/ generic/ 5 ftp://jaguar.ncsl.nist.gov/mt/resources/mteval-v13.pl 6 N can be specified with the doc length argument. The default value is 1, which means every sentence is treated as a document.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "https://www.elastic.co/ 8 CLIReval is flexible and users can easily replace Elasticsearch with their own IR system.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "https://unicode.org/reports/tr29/ 11 http://www.statmt.org/wmt19/ 12 http://ufallab.ms.mff.cuni.cz/\u02dcbojar/ wmt18-metrics-task-package.tgz",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
},
{
"text": "calculated with CLIReval using default arguments.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "",
"sec_num": null
}
],
"back_matter": [
{
"text": "We want to thank Sorami Hisamoto and Muhammad Mahbubur Rahman for their initial code and guidance on best practices for Elasticsearch.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "Acknowledgement",
"sec_num": null
},
{
"text": "Note that BEER is trained on in-domain resources from the WMT2019 metrics task. We show MAP@10 and NDCG@10 scores for CLIReval with two relevance label conversion settings.Rather than directly evaluating translated sentences against reference sentences, CLIReval transforms the inputs into the closely related task of CLIR, without the need for annotated CLIR dataset. The aim of this project is not to replace current automatic evaluation metrics or fix the limitations in those metrics, but to bridge the gap between machine translation and cross-lingual information retrieval and to show that CLIR is a feasible proxy task for MT evaluation.Our case study on the WMT2019 metrics shared task further highlights the potential of CLIR as a proxy task for MT evaluation, and we hope that CLIReval can facilitate future research in this area.",
"cite_spans": [],
"ref_spans": [],
"eq_spans": [],
"section": "annex",
"sec_num": null
}
],
"bib_entries": {
"BIBREF0": {
"ref_id": "b0",
"title": "Meteor: An automatic metric for mt evaluation with improved correlation with human judgments",
"authors": [
{
"first": "Satanjeev",
"middle": [],
"last": "Banerjee",
"suffix": ""
},
{
"first": "Alon",
"middle": [],
"last": "Lavie",
"suffix": ""
}
],
"year": 2005,
"venue": "Proceedings of the acl workshop on intrinsic and extrinsic evaluation measures for machine translation and/or summarization",
"volume": "",
"issue": "",
"pages": "65--72",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Satanjeev Banerjee and Alon Lavie. 2005. Meteor: An automatic metric for mt evaluation with improved correlation with human judgments. In Proceedings of the acl workshop on intrinsic and extrinsic evalu- ation measures for machine translation and/or sum- marization, pages 65-72.",
"links": null
},
"BIBREF1": {
"ref_id": "b1",
"title": "Findings of the 2019 conference on machine translation (wmt19)",
"authors": [
{
"first": "Lo\u00efc",
"middle": [],
"last": "Barrault",
"suffix": ""
},
{
"first": "Ond\u0159ej",
"middle": [],
"last": "Bojar",
"suffix": ""
},
{
"first": "Marta",
"middle": [
"R"
],
"last": "Costa-Juss\u00e0",
"suffix": ""
},
{
"first": "Christian",
"middle": [],
"last": "Federmann",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Fishel",
"suffix": ""
},
{
"first": "Yvette",
"middle": [],
"last": "Graham",
"suffix": ""
},
{
"first": "Barry",
"middle": [],
"last": "Haddow",
"suffix": ""
},
{
"first": "Matthias",
"middle": [],
"last": "Huck",
"suffix": ""
},
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "Shervin",
"middle": [],
"last": "Malmasi",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the Fourth Conference on Machine Translation",
"volume": "2",
"issue": "",
"pages": "1--61",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Lo\u00efc Barrault, Ond\u0159ej Bojar, Marta R Costa-juss\u00e0, Christian Federmann, Mark Fishel, Yvette Gra- ham, Barry Haddow, Matthias Huck, Philipp Koehn, Shervin Malmasi, et al. 2019. Findings of the 2019 conference on machine translation (wmt19). In Proceedings of the Fourth Conference on Machine Translation (Volume 2: Shared Task Papers, Day 1), pages 1-61.",
"links": null
},
"BIBREF2": {
"ref_id": "b2",
"title": "Quiz-based evaluation of machine translation",
"authors": [
{
"first": "Jan",
"middle": [],
"last": "Berka",
"suffix": ""
},
{
"first": "Ond\u0159ej",
"middle": [],
"last": "Martin\u010dern\u1ef3",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Bojar",
"suffix": ""
}
],
"year": 2011,
"venue": "The Prague Bulletin of Mathematical Linguistics",
"volume": "95",
"issue": "",
"pages": "77--86",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jan Berka, Martin\u010cern\u1ef3, and Ond\u0159ej Bojar. 2011. Quiz-based evaluation of machine translation. The Prague Bulletin of Mathematical Linguistics, 95:77- 86.",
"links": null
},
"BIBREF3": {
"ref_id": "b3",
"title": "Retrieval system evaluation. TREC: Experiment and Evaluation in Information Retrieval",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Buckley",
"suffix": ""
},
{
"first": "Ellen",
"middle": [],
"last": "Voorhees",
"suffix": ""
}
],
"year": 2005,
"venue": "",
"volume": "",
"issue": "",
"pages": "53--75",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chris Buckley and Ellen Voorhees. 2005. Retrieval sys- tem evaluation. TREC: Experiment and Evaluation in Information Retrieval, pages 53-75.",
"links": null
},
"BIBREF4": {
"ref_id": "b4",
"title": "Re-evaluation the role of bleu in machine translation research",
"authors": [
{
"first": "Chris",
"middle": [],
"last": "Callison",
"suffix": ""
},
{
"first": "-",
"middle": [],
"last": "Burch",
"suffix": ""
},
{
"first": "Miles",
"middle": [],
"last": "Osborne",
"suffix": ""
},
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
}
],
"year": 2006,
"venue": "11th Conference of the European Chapter of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Chris Callison-Burch, Miles Osborne, and Philipp Koehn. 2006. Re-evaluation the role of bleu in ma- chine translation research. In 11th Conference of the European Chapter of the Association for Computa- tional Linguistics.",
"links": null
},
"BIBREF5": {
"ref_id": "b5",
"title": "Yahoo! learning to rank challenge overview",
"authors": [
{
"first": "Olivier",
"middle": [],
"last": "Chapelle",
"suffix": ""
},
{
"first": "Yi",
"middle": [],
"last": "Chang",
"suffix": ""
}
],
"year": 2011,
"venue": "Proceedings of the Learning to Rank Challenge",
"volume": "",
"issue": "",
"pages": "1--24",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Olivier Chapelle and Yi Chang. 2011. Yahoo! learning to rank challenge overview. In Proceedings of the Learning to Rank Challenge, pages 1-24.",
"links": null
},
"BIBREF6": {
"ref_id": "b6",
"title": "A deep relevance matching model for ad-hoc retrieval",
"authors": [
{
"first": "Jiafeng",
"middle": [],
"last": "Guo",
"suffix": ""
},
{
"first": "Yixing",
"middle": [],
"last": "Fan",
"suffix": ""
},
{
"first": "Qingyao",
"middle": [],
"last": "Ai",
"suffix": ""
},
{
"first": "W Bruce",
"middle": [],
"last": "Croft",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the 25th ACM International on Conference on Information and Knowledge Management",
"volume": "",
"issue": "",
"pages": "55--64",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jiafeng Guo, Yixing Fan, Qingyao Ai, and W Bruce Croft. 2016. A deep relevance matching model for ad-hoc retrieval. In Proceedings of the 25th ACM International on Conference on Information and Knowledge Management, pages 55-64.",
"links": null
},
"BIBREF7": {
"ref_id": "b7",
"title": "Cumulated gain-based evaluation of ir techniques",
"authors": [
{
"first": "Kalervo",
"middle": [],
"last": "J\u00e4rvelin",
"suffix": ""
},
{
"first": "Jaana",
"middle": [],
"last": "Kek\u00e4l\u00e4inen",
"suffix": ""
}
],
"year": 2002,
"venue": "ACM Transactions on Information Systems (TOIS)",
"volume": "20",
"issue": "4",
"pages": "422--446",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kalervo J\u00e4rvelin and Jaana Kek\u00e4l\u00e4inen. 2002. Cu- mulated gain-based evaluation of ir techniques. ACM Transactions on Information Systems (TOIS), 20(4):422-446.",
"links": null
},
"BIBREF8": {
"ref_id": "b8",
"title": "Results of the wmt19 metrics shared task: Segment-level and strong mt systems pose big challenges",
"authors": [
{
"first": "Qingsong",
"middle": [],
"last": "Ma",
"suffix": ""
},
{
"first": "Johnny",
"middle": [],
"last": "Wei",
"suffix": ""
},
{
"first": "Ond\u0159ej",
"middle": [],
"last": "Bojar",
"suffix": ""
},
{
"first": "Yvette",
"middle": [],
"last": "Graham",
"suffix": ""
}
],
"year": 2019,
"venue": "Proceedings of the Fourth Conference on Machine Translation",
"volume": "2",
"issue": "",
"pages": "62--90",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Qingsong Ma, Johnny Wei, Ond\u0159ej Bojar, and Yvette Graham. 2019. Results of the wmt19 metrics shared task: Segment-level and strong mt systems pose big challenges. In Proceedings of the Fourth Confer- ence on Machine Translation (Volume 2: Shared Task Papers, Day 1), pages 62-90.",
"links": null
},
"BIBREF9": {
"ref_id": "b9",
"title": "Should we translate the documents or the queries in cross-language information retrieval",
"authors": [
{
"first": "",
"middle": [],
"last": "Scott Mccarley",
"suffix": ""
}
],
"year": 1999,
"venue": "Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics",
"volume": "",
"issue": "",
"pages": "208--214",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "J Scott McCarley. 1999. Should we translate the doc- uments or the queries in cross-language information retrieval? In Proceedings of the 37th annual meet- ing of the Association for Computational Linguistics on Computational Linguistics, pages 208-214. Asso- ciation for Computational Linguistics.",
"links": null
},
"BIBREF10": {
"ref_id": "b10",
"title": "Deep relevance ranking using enhanced document-query interactions",
"authors": [
{
"first": "Ryan",
"middle": [],
"last": "Mcdonald",
"suffix": ""
},
{
"first": "George",
"middle": [],
"last": "Brokos",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference on Empirical Methods in Natural Language Processing",
"volume": "",
"issue": "",
"pages": "1849--1860",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Ryan McDonald, George Brokos, and Ion Androut- sopoulos. 2018. Deep relevance ranking using en- hanced document-query interactions. In Proceed- ings of the 2018 Conference on Empirical Methods in Natural Language Processing, pages 1849-1860.",
"links": null
},
"BIBREF11": {
"ref_id": "b11",
"title": "A history of twentieth-century american academic cartography",
"authors": [
{
"first": "Robert",
"middle": [],
"last": "Mcmaster",
"suffix": ""
},
{
"first": "Susanna",
"middle": [],
"last": "Mcmaster",
"suffix": ""
}
],
"year": 2002,
"venue": "Cartography and Geographic Information Science",
"volume": "29",
"issue": "3",
"pages": "305--321",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Robert McMaster and Susanna McMaster. 2002. A his- tory of twentieth-century american academic cartog- raphy. Cartography and Geographic Information Science, 29(3):305-321.",
"links": null
},
"BIBREF12": {
"ref_id": "b12",
"title": "Cross-language information retrieval",
"authors": [
{
"first": "Jian-Yun",
"middle": [],
"last": "Nie",
"suffix": ""
}
],
"year": 2010,
"venue": "Synthesis Lectures on Human Language Technologies",
"volume": "3",
"issue": "1",
"pages": "1--125",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jian-Yun Nie. 2010. Cross-language information re- trieval. Synthesis Lectures on Human Language Technologies, 3(1):1-125.",
"links": null
},
"BIBREF13": {
"ref_id": "b13",
"title": "A comparative study of query and document translation for cross-language information retrieval",
"authors": [
{
"first": "W",
"middle": [],
"last": "Douglas",
"suffix": ""
},
{
"first": "",
"middle": [],
"last": "Oard",
"suffix": ""
}
],
"year": 1998,
"venue": "Conference of the Association for Machine Translation in the Americas",
"volume": "",
"issue": "",
"pages": "472--483",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Douglas W Oard. 1998. A comparative study of query and document translation for cross-language infor- mation retrieval. In Conference of the Association for Machine Translation in the Americas, pages 472- 483. Springer.",
"links": null
},
"BIBREF14": {
"ref_id": "b14",
"title": "Bleu: a method for automatic evaluation of machine translation",
"authors": [
{
"first": "Kishore",
"middle": [],
"last": "Papineni",
"suffix": ""
},
{
"first": "Salim",
"middle": [],
"last": "Roukos",
"suffix": ""
},
{
"first": "Todd",
"middle": [],
"last": "Ward",
"suffix": ""
},
{
"first": "Wei-Jing",
"middle": [],
"last": "Zhu",
"suffix": ""
}
],
"year": 2002,
"venue": "Proceedings of the 40th annual meeting on association for computational linguistics",
"volume": "",
"issue": "",
"pages": "311--318",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Kishore Papineni, Salim Roukos, Todd Ward, and Wei- Jing Zhu. 2002. Bleu: a method for automatic eval- uation of machine translation. In Proceedings of the 40th annual meeting on association for compu- tational linguistics, pages 311-318. Association for Computational Linguistics.",
"links": null
},
"BIBREF15": {
"ref_id": "b15",
"title": "A call for clarity in reporting bleu scores",
"authors": [
{
"first": "Matt",
"middle": [],
"last": "Post",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the Third Conference on Machine Translation: Research Papers",
"volume": "",
"issue": "",
"pages": "186--191",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Matt Post. 2018. A call for clarity in reporting bleu scores. In Proceedings of the Third Conference on Machine Translation: Research Papers, pages 186- 191.",
"links": null
},
"BIBREF17": {
"ref_id": "b17",
"title": "The probabilistic relevance framework: Bm25 and beyond",
"authors": [
{
"first": "Stephen",
"middle": [],
"last": "Robertson",
"suffix": ""
},
{
"first": "Hugo",
"middle": [],
"last": "Zaragoza",
"suffix": ""
}
],
"year": 2009,
"venue": "Foundations and Trends R in Information Retrieval",
"volume": "3",
"issue": "4",
"pages": "333--389",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Stephen Robertson, Hugo Zaragoza, et al. 2009. The probabilistic relevance framework: Bm25 and be- yond. Foundations and Trends R in Information Re- trieval, 3(4):333-389.",
"links": null
},
"BIBREF18": {
"ref_id": "b18",
"title": "Cross-lingual learning-to-rank with shared representations",
"authors": [
{
"first": "Shota",
"middle": [],
"last": "Sasaki",
"suffix": ""
},
{
"first": "Shuo",
"middle": [],
"last": "Sun",
"suffix": ""
},
{
"first": "Shigehiko",
"middle": [],
"last": "Schamoni",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Duh",
"suffix": ""
},
{
"first": "Kentaro",
"middle": [],
"last": "Inui",
"suffix": ""
}
],
"year": 2018,
"venue": "Proceedings of the 2018 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies",
"volume": "",
"issue": "",
"pages": "458--463",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shota Sasaki, Shuo Sun, Shigehiko Schamoni, Kevin Duh, and Kentaro Inui. 2018. Cross-lingual learning-to-rank with shared representations. In Pro- ceedings of the 2018 Conference of the North Amer- ican Chapter of the Association for Computational Linguistics: Human Language Technologies, Vol- ume 2 (Short Papers), pages 458-463.",
"links": null
},
"BIBREF19": {
"ref_id": "b19",
"title": "A reading comprehension corpus for machine translation evaluation",
"authors": [
{
"first": "Carolina",
"middle": [],
"last": "Scarton",
"suffix": ""
},
{
"first": "Lucia",
"middle": [],
"last": "Specia",
"suffix": ""
}
],
"year": 2016,
"venue": "Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC'16)",
"volume": "",
"issue": "",
"pages": "3652--3658",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Carolina Scarton and Lucia Specia. 2016. A reading comprehension corpus for machine translation eval- uation. In Proceedings of the Tenth International Conference on Language Resources and Evaluation (LREC'16), pages 3652-3658.",
"links": null
},
"BIBREF20": {
"ref_id": "b20",
"title": "Learning translational and knowledge-based similarities from relevance rankings for cross-language retrieval",
"authors": [
{
"first": "Shigehiko",
"middle": [],
"last": "Schamoni",
"suffix": ""
},
{
"first": "Felix",
"middle": [],
"last": "Hieber",
"suffix": ""
},
{
"first": "Artem",
"middle": [],
"last": "Sokolov",
"suffix": ""
},
{
"first": "Stefan",
"middle": [],
"last": "Riezler",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the 52nd Annual Meeting of the Association for Computational Linguistics",
"volume": "2",
"issue": "",
"pages": "488--494",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Shigehiko Schamoni, Felix Hieber, Artem Sokolov, and Stefan Riezler. 2014. Learning translational and knowledge-based similarities from relevance rank- ings for cross-language retrieval. In Proceedings of the 52nd Annual Meeting of the Association for Com- putational Linguistics (Volume 2: Short Papers), pages 488-494.",
"links": null
},
"BIBREF21": {
"ref_id": "b21",
"title": "A study of translation edit rate with targeted human annotation",
"authors": [
{
"first": "Matthew",
"middle": [],
"last": "Snover",
"suffix": ""
},
{
"first": "Bonnie",
"middle": [],
"last": "Dorr",
"suffix": ""
},
{
"first": "Richard",
"middle": [],
"last": "Schwartz",
"suffix": ""
},
{
"first": "Linnea",
"middle": [],
"last": "Micciulla",
"suffix": ""
},
{
"first": "John",
"middle": [],
"last": "Makhoul",
"suffix": ""
}
],
"year": 2006,
"venue": "",
"volume": "",
"issue": "",
"pages": "",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Matthew Snover, Bonnie Dorr, Richard Schwartz, Lin- nea Micciulla, and John Makhoul. 2006. A study of translation edit rate with targeted human annotation.",
"links": null
},
"BIBREF22": {
"ref_id": "b22",
"title": "Beer: Better evaluation as ranking",
"authors": [
{
"first": "Milo\u0161",
"middle": [],
"last": "Stanojevi\u0107",
"suffix": ""
}
],
"year": 2014,
"venue": "Proceedings of the Ninth Workshop on Statistical Machine Translation",
"volume": "",
"issue": "",
"pages": "414--419",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Milo\u0161 Stanojevi\u0107 and Khalil Sima'an. 2014. Beer: Bet- ter evaluation as ranking. In Proceedings of the Ninth Workshop on Statistical Machine Translation, pages 414-419.",
"links": null
},
"BIBREF23": {
"ref_id": "b23",
"title": "Robust document representations for cross-lingual information retrieval in low-resource settings",
"authors": [
{
"first": "Mahsa",
"middle": [],
"last": "Yarmohammadi",
"suffix": ""
},
{
"first": "Xutai",
"middle": [],
"last": "Ma",
"suffix": ""
},
{
"first": "Sorami",
"middle": [],
"last": "Hisamoto",
"suffix": ""
},
{
"first": "Muhammad",
"middle": [],
"last": "Rahman",
"suffix": ""
},
{
"first": "Yiming",
"middle": [],
"last": "Wang",
"suffix": ""
},
{
"first": "Hainan",
"middle": [],
"last": "Xu",
"suffix": ""
},
{
"first": "Daniel",
"middle": [],
"last": "Povey",
"suffix": ""
},
{
"first": "Philipp",
"middle": [],
"last": "Koehn",
"suffix": ""
},
{
"first": "Kevin",
"middle": [],
"last": "Duh",
"suffix": ""
}
],
"year": 2019,
"venue": "Research Track",
"volume": "1",
"issue": "",
"pages": "12--20",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Mahsa Yarmohammadi, Xutai Ma, Sorami Hisamoto, Muhammad Rahman, Yiming Wang, Hainan Xu, Daniel Povey, Philipp Koehn, and Kevin Duh. 2019. Robust document representations for cross-lingual information retrieval in low-resource settings. In Proceedings of Machine Translation Summit XVII Volume 1: Research Track, pages 12-20, Dublin, Ireland. European Association for Machine Transla- tion.",
"links": null
},
"BIBREF24": {
"ref_id": "b24",
"title": "Translation techniques in cross-language information retrieval",
"authors": [
{
"first": "Dong",
"middle": [],
"last": "Zhou",
"suffix": ""
},
{
"first": "Mark",
"middle": [],
"last": "Truran",
"suffix": ""
},
{
"first": "Tim",
"middle": [],
"last": "Brailsford",
"suffix": ""
},
{
"first": "Vincent",
"middle": [],
"last": "Wade",
"suffix": ""
},
{
"first": "Helen",
"middle": [],
"last": "Ashman",
"suffix": ""
}
],
"year": 2012,
"venue": "ACM Computing Surveys (CSUR)",
"volume": "45",
"issue": "1",
"pages": "1--44",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Dong Zhou, Mark Truran, Tim Brailsford, Vincent Wade, and Helen Ashman. 2012. Translation techniques in cross-language information retrieval. ACM Computing Surveys (CSUR), 45(1):1-44.",
"links": null
},
"BIBREF25": {
"ref_id": "b25",
"title": "The effect of translation quality in mt-based cross-language information retrieval",
"authors": [
{
"first": "Jiang",
"middle": [],
"last": "Zhu",
"suffix": ""
},
{
"first": "Haifeng",
"middle": [],
"last": "Wang",
"suffix": ""
}
],
"year": 2006,
"venue": "Proceedings of the 21st International Conference on Computational Linguistics and the 44th annual meeting of the Association for Computational Linguistics",
"volume": "",
"issue": "",
"pages": "593--600",
"other_ids": {},
"num": null,
"urls": [],
"raw_text": "Jiang Zhu and Haifeng Wang. 2006. The effect of trans- lation quality in mt-based cross-language informa- tion retrieval. In Proceedings of the 21st Interna- tional Conference on Computational Linguistics and the 44th annual meeting of the Association for Com- putational Linguistics, pages 593-600. Association for Computational Linguistics.",
"links": null
}
},
"ref_entries": {
"FIGREF0": {
"num": null,
"text": "The system architecture of CLIReval. Documents from input files are separately indexed into two instances of IR systems. Generated search queries are used to query both IR instances. Search scores from REF-IR are converted to discrete relevance judgment labels as required by trec eval. Finally, CLIReval uses trec eval to calculate IR metrics.",
"type_str": "figure",
"uris": null
},
"FIGREF1": {
"num": null,
"text": "presents the system architecture of CLIReval. The only necessary inputs are 1) a system output translation (MT) file and 2) a reference (REF) file. CLIReval executes the following steps: 1. Separately index documents in MT and REF files into two instances of the Information Retrieval (IR) system, we refer to them as MT-IR and REF-IR. 2. Convert text in the REF file into search queries with the Query Generator module.",
"type_str": "figure",
"uris": null
},
"FIGREF2": {
"num": null,
"text": "Sample outputs from the query generator. In sentences mode, all sentences from R (Figure 2) are used as search queries while in the unique terms mode, the unique terms in R are the search queries.REF file and treats every sentence as a search query string. This is inspired bySasaki et al. (2018), who use the first sentences of documents as queries.",
"type_str": "figure",
"uris": null
}
}
}
} |