File size: 81,015 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
{
    "paper_id": "I11-1030",
    "header": {
        "generated_with": "S2ORC 1.0.0",
        "date_generated": "2023-01-19T07:31:46.108555Z"
    },
    "title": "Generating Chinese Named Entity Data from a Parallel Corpus",
    "authors": [
        {
            "first": "Ruiji",
            "middle": [],
            "last": "Fu",
            "suffix": "",
            "affiliation": {
                "laboratory": "Research Center for Social Computing and Information Retrieval MOE-Microsoft Key Laboratory of Natural Language Processing and Speech",
                "institution": "Harbin Institute of Technology",
                "location": {
                    "settlement": "Harbin",
                    "country": "China"
                }
            },
            "email": "rjfu@ir.hit.edu.cn"
        },
        {
            "first": "Bing",
            "middle": [],
            "last": "Qin",
            "suffix": "",
            "affiliation": {
                "laboratory": "Research Center for Social Computing and Information Retrieval MOE-Microsoft Key Laboratory of Natural Language Processing and Speech",
                "institution": "Harbin Institute of Technology",
                "location": {
                    "settlement": "Harbin",
                    "country": "China"
                }
            },
            "email": "bqin@ir.hit.edu.cn"
        },
        {
            "first": "Ting",
            "middle": [],
            "last": "Liu",
            "suffix": "",
            "affiliation": {
                "laboratory": "Research Center for Social Computing and Information Retrieval MOE-Microsoft Key Laboratory of Natural Language Processing and Speech",
                "institution": "Harbin Institute of Technology",
                "location": {
                    "settlement": "Harbin",
                    "country": "China"
                }
            },
            "email": "tliu@ir.hit.edu.cn"
        }
    ],
    "year": "",
    "venue": null,
    "identifiers": {},
    "abstract": "Annotating Named Entity Recognition (NER) training corpora is a costly process but necessary for supervised NER systems. This paper presents an approach to generate large-scale Chinese NER training data from an English-Chinese discourse level aligned parallel corpus. Difficulty of NER is different among languages due to their unique features. For example, the performance of English NER systems is usually higher than the Chinese ones on average. In our method, we first employ a high performance NER system on one side of a bilingual corpus. And then, we project the NE labels to the other side according to the word level alignment. At last, we select high-quality labeled sentences using different strategies and generate an NER training corpus. In our experiments, we generate a Chinese NER corpus with 167,100 sentences through an English-Chinese parallel corpus. The system trained on the automatically generated corpus attains a comparable result with the one trained on the manuallyannotated corpus. Further experiments show that the NER performance is significantly improved on two different evaluation sets by using the generated training data as an additional corpus to the manually-labeled data.",
    "pdf_parse": {
        "paper_id": "I11-1030",
        "_pdf_hash": "",
        "abstract": [
            {
                "text": "Annotating Named Entity Recognition (NER) training corpora is a costly process but necessary for supervised NER systems. This paper presents an approach to generate large-scale Chinese NER training data from an English-Chinese discourse level aligned parallel corpus. Difficulty of NER is different among languages due to their unique features. For example, the performance of English NER systems is usually higher than the Chinese ones on average. In our method, we first employ a high performance NER system on one side of a bilingual corpus. And then, we project the NE labels to the other side according to the word level alignment. At last, we select high-quality labeled sentences using different strategies and generate an NER training corpus. In our experiments, we generate a Chinese NER corpus with 167,100 sentences through an English-Chinese parallel corpus. The system trained on the automatically generated corpus attains a comparable result with the one trained on the manuallyannotated corpus. Further experiments show that the NER performance is significantly improved on two different evaluation sets by using the generated training data as an additional corpus to the manually-labeled data.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Abstract",
                "sec_num": null
            }
        ],
        "body_text": [
            {
                "text": "Named Entity Recognition (NER) is the task of identifying and classifying the names of persons, * Correspondence author: tliu@ir.hit.edu.cn locations, organizations and other named entities in text, which plays an important role in many Natural Language Processing (NLP) applications such as information extraction, information retrieval, machine translation, and so on.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "Supervised machine learning systems have proved successful for NER (Zhou and Su, 2002; Chieu and Ng, 2002; Takeuchi and Collier, 2002; Settles, 2004) . They usually need manuallyannotated high performance textual corpora. These corpora are considered as gold standards for training statistical models. However, corpora manually-annotating is so costly and timeconsuming that the existing corpora are limited in both scale and scope for Chinese NER.",
                "cite_spans": [
                    {
                        "start": 67,
                        "end": 86,
                        "text": "(Zhou and Su, 2002;",
                        "ref_id": "BIBREF18"
                    },
                    {
                        "start": 87,
                        "end": 106,
                        "text": "Chieu and Ng, 2002;",
                        "ref_id": "BIBREF1"
                    },
                    {
                        "start": 107,
                        "end": 134,
                        "text": "Takeuchi and Collier, 2002;",
                        "ref_id": "BIBREF10"
                    },
                    {
                        "start": 135,
                        "end": 149,
                        "text": "Settles, 2004)",
                        "ref_id": "BIBREF9"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "More seriously, the domain overfitting problem even worsens the corpora-shortage problem. Supervised NER approaches can often achieve high accuracy when a large annotated training set similar to the test data is available (Zhou and Su, 2002; Florian et al., 2003; Klein et al., 2003; Finkel et al., 2005) . Unfortunately, if the test data has some difference from the training data, these approaches tend to not perform well. For instance, Ciaramita and Altun (2005) reported that the F1-score of a named entity recognizer trained on CoNLL 2003 Reuters corpus dropped from 90.8% (when tested on a similar Reuters set) to 64.3% (when tested on a Wall Street Journal set). A similar phenomenon of performance degradation in Chinese NER will be presented later in this paper (see Table 3 ).",
                "cite_spans": [
                    {
                        "start": 222,
                        "end": 241,
                        "text": "(Zhou and Su, 2002;",
                        "ref_id": "BIBREF18"
                    },
                    {
                        "start": 242,
                        "end": 263,
                        "text": "Florian et al., 2003;",
                        "ref_id": null
                    },
                    {
                        "start": 264,
                        "end": 283,
                        "text": "Klein et al., 2003;",
                        "ref_id": "BIBREF4"
                    },
                    {
                        "start": 284,
                        "end": 304,
                        "text": "Finkel et al., 2005)",
                        "ref_id": "BIBREF3"
                    },
                    {
                        "start": 440,
                        "end": 466,
                        "text": "Ciaramita and Altun (2005)",
                        "ref_id": "BIBREF2"
                    }
                ],
                "ref_spans": [
                    {
                        "start": 777,
                        "end": 784,
                        "text": "Table 3",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "Therefore, we try to solve the problems for Chinese mentioned above by automatically constructing large scale and scope training corpora.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "Chinese NER is more difficult than English NER because of the lack of capitalization and the uncertainty in word segmentation. Our motivation is to collect large-scale training data and improve Chinese NER with the help of an exist-ing high performance English NER system and a bilingual corpus.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "In this paper, we employ a high performance NER system on the English side of a bilingual corpus. And then, the NE labels are projected to the Chinese side according to the word level alignment. At last, we select high-quality labeled sentences using different strategies and generate an NER training corpus.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "In our experiments, statistical models are trained on the generated corpora, and compared with the model trained on a manually annotated corpus. The results show that our corpus is comparable to the manually-labeled corpus. Furthermore, the model trained on the combined corpus (generated and manually-labeled corpora) obtains an F1-score of 67.89% on 863-Evaluation corpus and 73.20% on OntoNotes corpus, which significantly outperforms the one trained on the manually-labeled corpus.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "The contributions of this paper are as follows.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "First, we present a method to generate largescale Chinese NER training data from a bilingual corpus automatically. Our method trades off manual effort to annotate named entities in documents for effort to identify pairs of parallel documents, which is easier than NE manual annotation. For example, large scale of parallel documents can be extracted from the web automatically (Resnik and Smith, 2003; Zhang et al., 2006) .",
                "cite_spans": [
                    {
                        "start": 377,
                        "end": 401,
                        "text": "(Resnik and Smith, 2003;",
                        "ref_id": "BIBREF7"
                    },
                    {
                        "start": 402,
                        "end": 421,
                        "text": "Zhang et al., 2006)",
                        "ref_id": "BIBREF16"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "Second, we propose some strategies to select high-quality training data, which are very effective and important as the experiments show.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "And third, we prove that our generated training data can be used as an additional corpus to improve the NER performance.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "This paper is organized as follows. Section 2 discusses the related work. Section 3 describes our approach in detail. Section 4 presents and discusses the results of our experiments. Finally, we present our conclusions and future work in section 5.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "In this section, we introduce some previous work about NER training data generation.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "2"
            },
            {
                "text": "The most closed related work to our approach is Yarowsky et al. (2001) . They used word alignment on parallel corpora to induce several text analysis tools from English to other languages for which such resources are scarce. An NE tagger was transferred from English to French and achieved good classification accuracy. However, Chinese NER is more difficult than French and word alignment between Chinese and English is also more complex because of the tremendous difference between the two languages. Huang and Vogel (2002) presented an integrated approach to extract an NE translation dictionary from an English-Chinese parallel corpus while improving the monolingual NE annotation quality for both languages. They started with low-quality NE tagging for both languages and improved the annotation result using alignment information. But they did not filter the annotated data and evaluate its impact for NER as training data.",
                "cite_spans": [
                    {
                        "start": 48,
                        "end": 70,
                        "text": "Yarowsky et al. (2001)",
                        "ref_id": "BIBREF14"
                    },
                    {
                        "start": 503,
                        "end": 525,
                        "text": "Huang and Vogel (2002)",
                        "ref_id": null
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "2"
            },
            {
                "text": "Besides, some other resources have been used to generate NE tagged corpus. and Whitelaw et al. (2008) used seed sets of entities and search engines to collect NER training data from the web. However, constructing of a high-quality seed list is also a time-consuming work. Richman and Schone (2008) and Nothman et al. (2008) used similar methods to create NE training data. They transformed Wikipedia's links into named entity annotations by classifying the target articles into common entity types. But the article classification seeds also had to be hand-labeled in advance.",
                "cite_spans": [
                    {
                        "start": 79,
                        "end": 101,
                        "text": "Whitelaw et al. (2008)",
                        "ref_id": "BIBREF12"
                    },
                    {
                        "start": 272,
                        "end": 297,
                        "text": "Richman and Schone (2008)",
                        "ref_id": "BIBREF8"
                    },
                    {
                        "start": 302,
                        "end": 323,
                        "text": "Nothman et al. (2008)",
                        "ref_id": "BIBREF6"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "2"
            },
            {
                "text": "In the biomedical domain, Vlachos and Gasperin (2006) automatically created training material for the task of gene name recognition from the broader raw corpus using existing domain resources.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "2"
            },
            {
                "text": "In our work, we generate a large scale Chinese NER training data from a bilingual corpus without any NE seed lists and filter it by using effective strategies. And we prove that it can improve the performance of Chinese NER as additional training data.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "2"
            },
            {
                "text": "In this section we describe our approach of generating NER training data from a parallel corpus. The framework of our system consists of four components as shown in Figure 1 . Figure 1 . System Framework project the English NE labels to the Chinese side and generate training data candidates. At the same time, we extract a Chinese NE list, which can be used as a dictionary resource.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 165,
                        "end": 173,
                        "text": "Figure 1",
                        "ref_id": null
                    },
                    {
                        "start": 176,
                        "end": 184,
                        "text": "Figure 1",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Our Approach",
                "sec_num": "3"
            },
            {
                "text": "\uf0b7 Training Data Selection: According to the different filtering strategies, we select high-quality labeled sentences from the candidates to form Chinese NER training data.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Our Approach",
                "sec_num": "3"
            },
            {
                "text": "First, we perform sentence level alignment by using Champollion toolkit 1 . 1 http://champollion.sourceforge.net/ And then, GIZA++ toolkit 2 is used for word alignment. This toolkit can generate one-to-many word alignments in a certain direction (Chinese to English or English to Chinese). However, we need many-to-many alignments. Hence, we need GIZA++ to run on the bilingual corpus in both directions and merge the results, as shown in Figure 2 .",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 439,
                        "end": 447,
                        "text": "Figure 2",
                        "ref_id": "FIGREF0"
                    }
                ],
                "eq_spans": [],
                "section": "Alignment and Automatic English NER",
                "sec_num": "3.1"
            },
            {
                "text": "English NER is easier than Chinese because of the capitalization information and the needlessness of word segmentation. So the performance of English NER systems is usually higher than the Chinese ones on average. Hence a widely used open-source NER system, Stanford Named Entity Recognizer 3 is employed to label NEs on the English side of the parallel corpus. The system is based on linear chain Conditional Random Field (CRF) (J. Lafferty et al., 2001 ) sequence models and can recognize three kinds of named entities (PERSON, LOCATION and ORGANIZATION).",
                "cite_spans": [
                    {
                        "start": 433,
                        "end": 454,
                        "text": "Lafferty et al., 2001",
                        "ref_id": "BIBREF5"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Alignment and Automatic English NER",
                "sec_num": "3.1"
            },
            {
                "text": "To evaluate the robustness of Stanford NER system, we manually labeled 1000 English sentences from our bilingual corpus as a test set where the system achieves an F1-score of 89.32%. It is close to the result of 87.94% 4 on CoNLL 2003 NER test set.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Alignment and Automatic English NER",
                "sec_num": "3.1"
            },
            {
                "text": "After the English NER, we map the English NE labels to the Chinese side to discover Chinese NEs candidates, according to the result of word alignment.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Chinese NE Candidates Generation",
                "sec_num": "3.2"
            },
            {
                "text": "We consider all related alignment pairs of every word within an English NE. For example, in Figure 3 , the index of the organization name NBA is 1 and the related word alignment pairs Figure 3 . An Example of Chinese NE Candidates Generation include 1-1, 1-2 and 1-3. Therefore, we can find the boundaries (from 1 to 3) of the corresponding Chinese translation \u56fd\u5bb6 \u7bee\u7403 \u534f\u4f1a. There are also some English words connecting with NULL at Chinese side. We ignore these word alignment pairs. According to the alignment, we project the NE labels from English to Chinese and generate the named entity candidates on the Chinese side.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 92,
                        "end": 100,
                        "text": "Figure 3",
                        "ref_id": null
                    },
                    {
                        "start": 184,
                        "end": 192,
                        "text": "Figure 3",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Chinese NE Candidates Generation",
                "sec_num": "3.2"
            },
            {
                "text": "However, the generated NER training data candidates are noisy because of the errors in English NER or word alignment. In this section, we present the strategies of selecting training data.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Training Data Selection",
                "sec_num": "3.3"
            },
            {
                "text": "As the common definition, a named entity is a continuous string, whether it is in English or in Chinese. So we assume that every named entity alignment pair is a closed alignment pair of two continuous strings, as shown in Figure 4 Based on this assumption, we make two alternative rules to filter the training data candidates. One is a soft filtering rule to retain training instances as many as possible. Another is a hard filtering rule to guarantee the quality of the gen- Rule 1 prefers to keep training instances as many as possible. But it may make some NEs be labeled as non-NE mistakingly on the Chinese side for incorrect word alignments, which are the noises in the generated training data. Rule 2 prefers to guarantee the quality of the generated data but may make useful training instances be discarded and the data scale shrinking.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 223,
                        "end": 231,
                        "text": "Figure 4",
                        "ref_id": "FIGREF2"
                    }
                ],
                "eq_spans": [],
                "section": "Filtering Based on Rules",
                "sec_num": "3.3.1"
            },
            {
                "text": "Based on the rules, we can filter lots of ill conditioned named entity candidates, such as overlapped entities, nested entities and so on.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Filtering Based on Rules",
                "sec_num": "3.3.1"
            },
            {
                "text": "Although many ill conditioned candidates are filtered out by the rules, the remaining data is still noisy because of the incorrect labeling of the English NER and the incorrect NE alignment. In fact, the accuracy of NE alignment is only affected by the boundary alignment of English and Chinese NEs. In other words, we do not care about how to align within or without the NEs. Hence, we score Chinese named entity candidates by formula 1.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Filtering Based on Scores",
                "sec_num": "3.3.2"
            },
            {
                "text": "(1)",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Filtering Based on Scores",
                "sec_num": "3.3.2"
            },
            {
                "text": "Here, denotes the confidence of the English named entity , which is derived from Stanford NER system. denotes the boundaries of the Chinese named entity , which are actually the left-most and the right-most word within . e denotes an English word, and w denotes a Chinese word.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Filtering Based on Scores",
                "sec_num": "3.3.2"
            },
            {
                "text": "denotes all related alignment pairs of word w in current Chinese named entity . denotes the probability of alignment , which is obtained from GIZA++.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Filtering Based on Scores",
                "sec_num": "3.3.2"
            },
            {
                "text": "As mentioned in section 3.1, Stanford NER is based on CRF. The inference of CRF is that given an observable sequence , we want to find the most likely set of labels for . The probability of given is calculated as follows (J. Lafferty et al., 2001 ):",
                "cite_spans": [
                    {
                        "start": 225,
                        "end": 246,
                        "text": "Lafferty et al., 2001",
                        "ref_id": "BIBREF5"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Filtering Based on Scores",
                "sec_num": "3.3.2"
            },
            {
                "text": "( 2)(3) 4In formulae 2, 3 and 4, j denotes the index of the jth word in sequence . n denotes the length of . m denotes the number of the features.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Filtering Based on Scores",
                "sec_num": "3.3.2"
            },
            {
                "text": "Now the substring in is labeled as an NE",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Filtering Based on Scores",
                "sec_num": "3.3.2"
            },
            {
                "text": ". The label sequence of is which is denoted as . We compute the marginal probability as follows:",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Filtering Based on Scores",
                "sec_num": "3.3.2"
            },
            {
                "text": "(5) (6)",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Filtering Based on Scores",
                "sec_num": "3.3.2"
            },
            {
                "text": "The factor of every English NE is used to measure the confidence of NER. We apply the forward-backward algorithm to compute them.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Filtering Based on Scores",
                "sec_num": "3.3.2"
            },
            {
                "text": "For , we use the probabilities of alignment pairs which are computed by GIZA++. GIZA++ outputs the probability of translating source word s as target word t. There are two kinds of probabilities of alignment in two directions. Since our alignment is bidirectional, we merge the probabilities in two directions to come up with formula 7.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Filtering Based on Scores",
                "sec_num": "3.3.2"
            },
            {
                "text": "Particularly we set zero while the translation pair \"s \u2192 t\" does not exist in the translation table given by GIZA++.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "(7)",
                "sec_num": null
            },
            {
                "text": "We set experiential thresholds for every category to filter the Chinese NE candidates.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "(7)",
                "sec_num": null
            },
            {
                "text": "During the time of filtering the NE candidates, we can also extract the high-quality candidates as an NE list. We calculate the frequencies and the average scores of the candidates. We set thresholds of frequency and average score for every kind of NE candidate, and select the candidates with the highest frequency and score to compose a list. Table 1 shows some samples of the list.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 345,
                        "end": 352,
                        "text": "Table 1",
                        "ref_id": "TABREF3"
                    }
                ],
                "eq_spans": [],
                "section": "Recalling by a Chinese NE List",
                "sec_num": "3.3.3"
            },
            {
                "text": "An NE may be found correctly in some sentences where word alignment is easy, while the same one may be missed in others. Hence we use the extracted NE list to recall the missed NEs in the result of the former two steps. ",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Recalling by a Chinese NE List",
                "sec_num": "3.3.3"
            },
            {
                "text": "We carried out experiments to investigate the quality and practical applicability of our NER training corpora generated from the bilingual corpus.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Experiments",
                "sec_num": "4"
            },
            {
                "text": "We selected the LDC2003E14 multilanguage corpus and several bilingual parallel corpora 5 as the source corpus to generate NER training data. LDC2003E14 was derived from news of Foreign Broadcast Information Service (FBIS). We used the English-Chinese parallel news composed of 11,645 document pairs. The other bilingual parallel corpora contain 11,750 sentence pairs in all. A manually annotated Chinese NER goldstandard data from People's Daily corpus was prepared as the contrasting data. The corpus was annotated with 7 tags: person, location, organization, date, time, number and miscellany. For the evaluation, the last 4 tags were removed. The corpus, composed of 47,426 sentences, was di-vided into two parts: 37,426 for training and 10,000 for evaluation.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Data Set",
                "sec_num": "4.1"
            },
            {
                "text": "We also use other two corpora for the evaluation. One is the Chinese NER evaluation corpus from the National High Technology Development 863 Program of China in 2004. The other is OntoNotes Release 2.0 corpus. The tags except person, location and organization were removed in the 863-Evaluation corpus. The OntoNotes corpus was annotated with 18 fine-grained tags: 11 for named entities and 7 for numerical and time terms. We reduced the tags NORP and LOCATION into location, FACILITY, GPE and ORGANIZATION into organization, and PERSON into person. After this preprocessing, 14,547 NEs remained in the 863-Evaluation corpus and 13,658 NEs remained in the OntoNotes corpus. See Table 2 for a summary of the corpora used. In addition, we manually labeled 1,000 sentences randomly extracted from FBIS corpus for the direct evaluation about the quality of our generated corpus.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 678,
                        "end": 685,
                        "text": "Table 2",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Data Set",
                "sec_num": "4.1"
            },
            {
                "text": "We trained a Maximum Entropy Markov Model (MEMM) on People's Daily training set as our baseline. State-of-the-art features (Wu et al., 2005) From the evaluation result, we can see that the F1-score drops from 89.82% on People's Daily corpus to 65.87% on 863-Evaluation corpus and to 70.56% on OntoNotes corpus. It's similar to the report of Ciaramita and Altun (2005) . The reason for this problem is that the model is overfitted to the training data and fails to fit the test data with different distribution. To ease the problem, we attempt to improve the coverage of the model by generating large scale and scope training corpora.",
                "cite_spans": [
                    {
                        "start": 123,
                        "end": 140,
                        "text": "(Wu et al., 2005)",
                        "ref_id": null
                    },
                    {
                        "start": 341,
                        "end": 367,
                        "text": "Ciaramita and Altun (2005)",
                        "ref_id": "BIBREF2"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "The Baseline System",
                "sec_num": "4.2"
            },
            {
                "text": "We evaluated the training data generated by using different strategies on the 1000 manually annotated sentences. Table 4 . The Quality of Generated Corpora",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 113,
                        "end": 120,
                        "text": "Table 4",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "The Quality of the Generated Data",
                "sec_num": "4.3"
            },
            {
                "text": "Comparing the upper and lower parts of Table  4 , we get a larger corpus based on Rule 1, but the recall rate is low. Rule 2 requires removing whole sentences with ineligible cases, so that we can get a higher quality but smaller corpus. The result is reasonable. If an ineligible case as shown in Figure 4 (b) occurs in a pair of English and Chinese sentences, it is possible that a named entity is labeled in the English sentence, but is not mapped to the correct Chinese string due to the errors of word alignment. For example, if National Basketball Association is recognized as an organization name in an English sentence, it is very possible that the translated organization name \u56fd\u5bb6\u7bee\u7403\u534f\u4f1a exists in the Chinese sentence. But if National Basketball Association is not aligned to \u56fd\u5bb6\u7bee\u7403\u534f\u4f1a, the Chinese NE will be missed. We should remove the whole sentences from the corpus, or they will be noises in the training data. The results show that Rule 2 outperforms Rule 1. In the remainder of our experiment, we use Rule 2 instead of Rule 1.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 39,
                        "end": 47,
                        "text": "Table  4",
                        "ref_id": null
                    },
                    {
                        "start": 298,
                        "end": 306,
                        "text": "Figure 4",
                        "ref_id": "FIGREF2"
                    }
                ],
                "eq_spans": [],
                "section": "The Quality of the Generated Data",
                "sec_num": "4.3"
            },
            {
                "text": "The strategy filtering candidates by scores can help to improve the precision. But the improvement of F1-score is marginal, because some correct training instances may be filtered out, which makes the recall rate decrease. We extract a Chinese NE list containing 824 NEs with the highest frequency and scores from the corpus. Based on the NE list, we can recall many NEs missed by other strategies with only a little expense of precision. The recall rates are substantially improved from 48.56% to 67.71% based on Rule 1 and from 74.76% to 86.44% based on Rule 2.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "The Quality of the Generated Data",
                "sec_num": "4.3"
            },
            {
                "text": "Here, we chose the best-performing thresholds of the strategies in our experiments. The results show that our strategies are effective for improve the quality of the training data.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "The Quality of the Generated Data",
                "sec_num": "4.3"
            },
            {
                "text": "As mentioned in section 3.1, the F1-score of Stanford NER on our parallel corpus is 89.32%. The best F1-score of the generated training data in Table 4 is 82.11%. Thus, we roughly infer that about 8.07% (= 1 -82.11% / 89.32%) correct NE information is lost in the process of the Chinese NER training data generation.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 144,
                        "end": 151,
                        "text": "Table 4",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "The Quality of the Generated Data",
                "sec_num": "4.3"
            },
            {
                "text": "We trained MEMMs on the generated corpora using the same features as the baseline. As shown in Table 5 , we get a basic result by using Rule 2. On 863-Evaluation corpus for example, we get a marginal raise (0.72%) of precision but a drop (0.20%) of recall by using Rule 2 and Score strategy, and get a substantial raise (16.35%) of recall with a drop (0.30%) of the precision by using Rule 2 and List strategy. The situation is similar on OntoNotes corpus. The results are consistent with the quality of the training data shown in Table 4 . And it is reasonable that better training data leads to higher NER performance. The model trained on our corpus generated by using all of the strategies gets a comparable result with the baseline system.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 95,
                        "end": 102,
                        "text": "Table 5",
                        "ref_id": "TABREF7"
                    },
                    {
                        "start": 531,
                        "end": 538,
                        "text": "Table 4",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Comparison between the Manuallylabeled Data and the Generated Data",
                "sec_num": "4.4"
            },
            {
                "text": "We also use the generated corpus as additional training data to the gold-standard data. The last row in Table 5 shows that this approach leads to an improvement of the NER performance. We also perform a paired significance test 6 , which shows that the improvement is significant.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 104,
                        "end": 111,
                        "text": "Table 5",
                        "ref_id": "TABREF7"
                    }
                ],
                "eq_spans": [],
                "section": "Comparison between the Manuallylabeled Data and the Generated Data",
                "sec_num": "4.4"
            },
            {
                "text": "Our generated corpus contains 167,100 sentences, which are much more than sentences in the baseline corpus. Furthermore, it is generated without any manual annotation. The size could be limitless as long as there are plenty of parallel corpora available. Figure 5 illustrates the effect of varying the size of the generated training data set. Increased training data tends to improve performance until the size reaches about 67k sentences for 863-Evaluation corpus and 33k for OntoNotes corpus. But after that, improvements are marginal.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 255,
                        "end": 263,
                        "text": "Figure 5",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Comparison between the Manuallylabeled Data and the Generated Data",
                "sec_num": "4.4"
            },
            {
                "text": "We believe that there are two reasons causing this result. On the one hand, the noises increase when more training data is used. And the training data gets a balance between the noises and the correct training instances when the size reaches a certain point. On the other hand, a subset of the training data can represent the whole data, especially for the data from a simplex source. So we should collect data from a wider range of sources. Figure 5 . The Effect of Varying the Generated Corpus Size 6 We used Zhang's significance tester (Zhang et al., 2004 ",
                "cite_spans": [
                    {
                        "start": 501,
                        "end": 502,
                        "text": "6",
                        "ref_id": null
                    },
                    {
                        "start": 539,
                        "end": 558,
                        "text": "(Zhang et al., 2004",
                        "ref_id": "BIBREF17"
                    }
                ],
                "ref_spans": [
                    {
                        "start": 442,
                        "end": 450,
                        "text": "Figure 5",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "The Effect of the Generated Data Size",
                "sec_num": "4.5"
            },
            {
                "text": "To analyze overall error, our per-class F1-score is shown in Table 6 . Training on the combined corpus could improve the performance of each NE category. The improvements are substantial in all categories except LOC on 863-Evaluation.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 61,
                        "end": 68,
                        "text": "Table 6",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "The Performance of Each NE Category",
                "sec_num": "4.6"
            },
            {
                "text": "In general, the results of ORG entities are lower than the results of PER and LOC. The possible reason may be that ORG names are more complex than PER and LOC names. They usually consist of more words, which may result in more word alignment errors and then lead to more training instances filtered out. Fewer training instances might lead to a poorer performance. In addition, English ORG entity recognition is also more difficulty, which also results in more noises among the ORG name training instances.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "The Performance of Each NE Category",
                "sec_num": "4.6"
            },
            {
                "text": "To solve the data-shortage and domain overfitting problems, we attempt to enlarge the Chinese NE training data automatically.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusion and Future Work",
                "sec_num": "5"
            },
            {
                "text": "In this paper, we present a method of generating NER training data automatically from a bilingual parallel corpus. We employ an existing high-performance English NER system to recognized NEs at the English side, and then project the labels to the Chinese side according to the word alignment. To guarantee the quality of the training data, we propose effective filtering strategies. The results show that our training data is comparable with the manually-labeled data and can improve the performance of NER as an additional corpus.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusion and Future Work",
                "sec_num": "5"
            },
            {
                "text": "Besides, the training data could be expanded easily as long as there are plenty of parallel corpora available. And identifying pairs of parallel documents is much easier than NE training data annotation. Generating training data from parallel corpora thus provides an alternative way of collecting data required for Chinese NER. Our method can be easily adapted to other languages.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusion and Future Work",
                "sec_num": "5"
            },
            {
                "text": "In the future, we will try to improve the entity alignment and propose other better filtering strategies. Moreover, we will try to make use of more parallel corpora from a wider range of sources, because more parallel corpora may improve the accuracy of word alignment and widen the coverage of the generated NE corpus. ",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusion and Future Work",
                "sec_num": "5"
            },
            {
                "text": "http://www-i6.informatik.rwthaachen.de/Colleagues/och/software/GIZA++.html 3 http://nlp.stanford.edu/software/CRF-NER.shtml 4 http://nlp.stanford.edu/projects/project-ner.shtml",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "",
                "sec_num": null
            },
            {
                "text": "Six Chinese-English sentence-aligned corpora were used as extra data, including LDC2002T01, LDC2003E04, E07, E08, T17 and LDC2004T07.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "",
                "sec_num": null
            }
        ],
        "back_matter": [
            {
                "text": "This work was supported by National Natural Science Foundation of China (NSFC) via grant 60975055 and 61073126. Special thanks to Wanxiang Che, Yanyan Zhao, Fikadu Gemechu, Yuhang Guo, Zhenghua Li, Meishan Zhang and the anonymous reviewers for insightful comments and suggestions.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Acknowledgments",
                "sec_num": null
            }
        ],
        "bib_entries": {
            "BIBREF0": {
                "ref_id": "b0",
                "title": "Automatic acquisition of named entity tagged corpus from world wide web",
                "authors": [
                    {
                        "first": "Joohui",
                        "middle": [],
                        "last": "An",
                        "suffix": ""
                    },
                    {
                        "first": "Seungwoo",
                        "middle": [],
                        "last": "Lee",
                        "suffix": ""
                    },
                    {
                        "first": "Gary Geunbae",
                        "middle": [],
                        "last": "Lee",
                        "suffix": ""
                    }
                ],
                "year": 2003,
                "venue": "Proceedings of the 41st Annual Meeting of the Association for Computational Linguistics (ACL)",
                "volume": "",
                "issue": "",
                "pages": "165--168",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Joohui An, Seungwoo Lee, and Gary Geunbae Lee. 2003. Automatic acquisition of named entity tagged corpus from world wide web. In Proceed- ings of the 41st Annual Meeting of the Association for Computational Linguistics (ACL), pages 165- 168.",
                "links": null
            },
            "BIBREF1": {
                "ref_id": "b1",
                "title": "Named Entity Recognition: A Maximum Entropy Approach Using Global Information",
                "authors": [
                    {
                        "first": "Hai",
                        "middle": [],
                        "last": "Leong Chieu",
                        "suffix": ""
                    },
                    {
                        "first": "Hwee Tou",
                        "middle": [],
                        "last": "Ng",
                        "suffix": ""
                    }
                ],
                "year": 2002,
                "venue": "Proceedings of the 19th International Conference on Computational Linguistics (COLING)",
                "volume": "",
                "issue": "",
                "pages": "190--196",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Hai Leong Chieu and Hwee Tou Ng. 2002. Named Entity Recognition: A Maximum Entropy Ap- proach Using Global Information. In Proceedings of the 19th International Conference on Computa- tional Linguistics (COLING), pages 190-196.",
                "links": null
            },
            "BIBREF2": {
                "ref_id": "b2",
                "title": "Named-entity recognition in novel domains with external lexical knowledge",
                "authors": [
                    {
                        "first": "Massimiliano",
                        "middle": [],
                        "last": "Ciaramita",
                        "suffix": ""
                    },
                    {
                        "first": "Yasemin",
                        "middle": [],
                        "last": "Altun",
                        "suffix": ""
                    }
                ],
                "year": 2005,
                "venue": "Workshop on Advances in Structured Learning for Text and Speech Processing (NIPS-2005)",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Massimiliano Ciaramita and Yasemin Altun. 2005. Named-entity recognition in novel domains with external lexical knowledge. In Workshop on Ad- vances in Structured Learning for Text and Speech Processing (NIPS-2005).",
                "links": null
            },
            "BIBREF3": {
                "ref_id": "b3",
                "title": "Exploring the boundaries: Gene and protein identification in biomedical text",
                "authors": [
                    {
                        "first": "Jenny",
                        "middle": [],
                        "last": "Finkel",
                        "suffix": ""
                    },
                    {
                        "first": "Shipra",
                        "middle": [],
                        "last": "Dingare",
                        "suffix": ""
                    },
                    {
                        "first": "Christopher",
                        "middle": [
                            "D"
                        ],
                        "last": "Manning",
                        "suffix": ""
                    },
                    {
                        "first": "Malvina",
                        "middle": [],
                        "last": "Nissim",
                        "suffix": ""
                    },
                    {
                        "first": "Beatrice",
                        "middle": [
                            "Alex"
                        ],
                        "last": "",
                        "suffix": ""
                    },
                    {
                        "first": "Claire",
                        "middle": [],
                        "last": "Grover",
                        "suffix": ""
                    }
                ],
                "year": 2005,
                "venue": "BMC Bioinformatics",
                "volume": "",
                "issue": "6",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Jenny Finkel, Shipra Dingare, Christopher D. Man- ning, Malvina Nissim, Beatrice Alex, and Claire Grover. 2005. Exploring the boundaries: Gene and protein identification in biomedical text. BMC Bio- informatics, 6(Suppl 1):S5.",
                "links": null
            },
            "BIBREF4": {
                "ref_id": "b4",
                "title": "Named entity recognition with character-level models",
                "authors": [
                    {
                        "first": "Dan",
                        "middle": [],
                        "last": "Klein",
                        "suffix": ""
                    },
                    {
                        "first": "Joseph",
                        "middle": [],
                        "last": "Smarr",
                        "suffix": ""
                    },
                    {
                        "first": "Huy",
                        "middle": [],
                        "last": "Nguyen",
                        "suffix": ""
                    },
                    {
                        "first": "Christopher",
                        "middle": [
                            "D"
                        ],
                        "last": "Manning",
                        "suffix": ""
                    }
                ],
                "year": 2003,
                "venue": "Proceedings of the 7th Conference on Natural Language Learning (CoNLL)",
                "volume": "",
                "issue": "",
                "pages": "188--191",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Dan Klein, Joseph Smarr, Huy Nguyen, and Christo- pher D. Manning. 2003. Named entity recognition with character-level models. In Proceedings of the 7th Conference on Natural Language Learning (CoNLL), pages 188-191.",
                "links": null
            },
            "BIBREF5": {
                "ref_id": "b5",
                "title": "Conditional random fields: Probabilistic models for segmenting and labeling sequence data",
                "authors": [
                    {
                        "first": "John",
                        "middle": [],
                        "last": "Lafferty",
                        "suffix": ""
                    },
                    {
                        "first": "Andrew",
                        "middle": [],
                        "last": "Mccallum",
                        "suffix": ""
                    },
                    {
                        "first": "Fernando",
                        "middle": [],
                        "last": "Pereira",
                        "suffix": ""
                    }
                ],
                "year": 2001,
                "venue": "International Conference on Machine Learning (ICML)",
                "volume": "",
                "issue": "",
                "pages": "282--289",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "John Lafferty, Andrew McCallum and Fernando Pe- reira. 2001. Conditional random fields: Probabilis- tic models for segmenting and labeling sequence data. In International Conference on Machine Learning (ICML), pages 282-289.",
                "links": null
            },
            "BIBREF6": {
                "ref_id": "b6",
                "title": "Transforming Wikipedia into named entity training data",
                "authors": [
                    {
                        "first": "Joel",
                        "middle": [],
                        "last": "Nothman",
                        "suffix": ""
                    },
                    {
                        "first": "James",
                        "middle": [
                            "R"
                        ],
                        "last": "Curran",
                        "suffix": ""
                    },
                    {
                        "first": "Tara",
                        "middle": [],
                        "last": "Murphy",
                        "suffix": ""
                    }
                ],
                "year": 2008,
                "venue": "Proceedings of the Australian Language Technology Workshop",
                "volume": "",
                "issue": "",
                "pages": "124--132",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Joel Nothman, James R. Curran, and Tara Murphy. 2008. Transforming Wikipedia into named entity training data. In Proceedings of the Australian Language Technology Workshop, pages 124-132, Hobart, Australia.",
                "links": null
            },
            "BIBREF7": {
                "ref_id": "b7",
                "title": "The Web as a Parallel Corpus",
                "authors": [
                    {
                        "first": "Philip",
                        "middle": [],
                        "last": "Resnik",
                        "suffix": ""
                    },
                    {
                        "first": "Noah",
                        "middle": [
                            "A"
                        ],
                        "last": "Smith",
                        "suffix": ""
                    }
                ],
                "year": 2003,
                "venue": "Computational Linguistics, v",
                "volume": "29",
                "issue": "3",
                "pages": "349--380",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Philip Resnik and Noah A. Smith, 2003. The Web as a Parallel Corpus. Computational Linguistics, v.29 n.3, pages 349-380,",
                "links": null
            },
            "BIBREF8": {
                "ref_id": "b8",
                "title": "Mining wiki resources for multilingual named entity recognition",
                "authors": [
                    {
                        "first": "Alexander",
                        "middle": [
                            "E"
                        ],
                        "last": "Richman",
                        "suffix": ""
                    },
                    {
                        "first": "Patrick",
                        "middle": [],
                        "last": "Schone",
                        "suffix": ""
                    }
                ],
                "year": 2008,
                "venue": "Proceedings of the 46th Annual Meeting of the Association for Computational Linguistics: Human Language Technologies",
                "volume": "",
                "issue": "",
                "pages": "1--9",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Alexander E. Richman and Patrick Schone. 2008. Mining wiki resources for multilingual named enti- ty recognition. In Proceedings of the 46th Annual Meeting of the Association for Computational Lin- guistics: Human Language Technologies, pages 1- 9, Columbus, Ohio, USA.",
                "links": null
            },
            "BIBREF9": {
                "ref_id": "b9",
                "title": "Biomedical Named Entity Recognition Using Conditional Random Fields and Rich Feature Sets",
                "authors": [
                    {
                        "first": "Burr",
                        "middle": [],
                        "last": "Settles",
                        "suffix": ""
                    }
                ],
                "year": 2004,
                "venue": "Proceedings of COLING 2004, the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications (NLPBA)",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Burr Settles. 2004. Biomedical Named Entity Recog- nition Using Conditional Random Fields and Rich Feature Sets. In Proceedings of COLING 2004, the International Joint Workshop on Natural Language Processing in Biomedicine and its Applications (NLPBA), Geneva, Switzerland.",
                "links": null
            },
            "BIBREF10": {
                "ref_id": "b10",
                "title": "Use of Support Vector Machines in Extended Named Entity Recognition",
                "authors": [
                    {
                        "first": "Koichi",
                        "middle": [],
                        "last": "Takeuchi",
                        "suffix": ""
                    },
                    {
                        "first": "Nigel",
                        "middle": [],
                        "last": "Collier",
                        "suffix": ""
                    }
                ],
                "year": 2002,
                "venue": "Proceedings of the 6th Conference on Natural Language Learning (CoNLL)",
                "volume": "",
                "issue": "",
                "pages": "119--125",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Koichi Takeuchi and Nigel Collier. 2002. Use of Sup- port Vector Machines in Extended Named Entity Recognition. In Proceedings of the 6th Conference on Natural Language Learning (CoNLL), pages 119-125.",
                "links": null
            },
            "BIBREF11": {
                "ref_id": "b11",
                "title": "Bootstrapping and evaluating named entity recognition in the biomedical domain",
                "authors": [
                    {
                        "first": "Andreas",
                        "middle": [],
                        "last": "Vlachos",
                        "suffix": ""
                    },
                    {
                        "first": "Caroline",
                        "middle": [],
                        "last": "Gasperin",
                        "suffix": ""
                    }
                ],
                "year": 2006,
                "venue": "Proceedings of the Workshop on Linking Natural Language Processing and Biology: Towards Deeper Biological Literature Analysis",
                "volume": "",
                "issue": "",
                "pages": "138--145",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Andreas Vlachos and Caroline Gasperin. 2006. Boot- strapping and evaluating named entity recognition in the biomedical domain. In Proceedings of the Workshop on Linking Natural Language Processing and Biology: Towards Deeper Biologi- cal Literature Analysis, pages 138-145. New York City, New York, USA.",
                "links": null
            },
            "BIBREF12": {
                "ref_id": "b12",
                "title": "Web-scale named entity recognition",
                "authors": [
                    {
                        "first": "Casey",
                        "middle": [],
                        "last": "Whitelaw",
                        "suffix": ""
                    },
                    {
                        "first": "Alex",
                        "middle": [],
                        "last": "Kehlenbeck",
                        "suffix": ""
                    },
                    {
                        "first": "Nemanja",
                        "middle": [],
                        "last": "Petrovic",
                        "suffix": ""
                    },
                    {
                        "first": "Lyle",
                        "middle": [],
                        "last": "Ungar",
                        "suffix": ""
                    }
                ],
                "year": 2008,
                "venue": "Proceedings of the 17th ACM Conference on Information and Knowledge Management",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Casey Whitelaw , Alex Kehlenbeck , Nemanja Pe- trovic and Lyle Ungar. 2008. Web-scale named entity recognition. In Proceedings of the 17th ACM Conference on Information and Knowledge Man- agement, October 26-30, Napa Valley, California, USA.",
                "links": null
            },
            "BIBREF13": {
                "ref_id": "b13",
                "title": "Chinese Named Entity Recognition Model Based on Multiple Features",
                "authors": [
                    {
                        "first": "Youzheng",
                        "middle": [],
                        "last": "Wu",
                        "suffix": ""
                    },
                    {
                        "first": "Jun",
                        "middle": [],
                        "last": "Zhao",
                        "suffix": ""
                    },
                    {
                        "first": "Bo",
                        "middle": [],
                        "last": "Xu",
                        "suffix": ""
                    }
                ],
                "year": 2008,
                "venue": "Proceedings of HLT/EMNLP 2005",
                "volume": "",
                "issue": "",
                "pages": "427--434",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Youzheng Wu, Jun Zhao, Bo Xu, Chinese Named Entity Recognition Model Based on Multiple Fea- tures. In Proceedings of HLT/EMNLP 2005, pages: 427-434, October 6-8, Vancouver, B.C., Canada.",
                "links": null
            },
            "BIBREF14": {
                "ref_id": "b14",
                "title": "Inducing multilingual text analysis tools via robust projection across aligned corpora",
                "authors": [
                    {
                        "first": "David",
                        "middle": [],
                        "last": "Yarowsky",
                        "suffix": ""
                    },
                    {
                        "first": "Grace",
                        "middle": [],
                        "last": "Ngai",
                        "suffix": ""
                    },
                    {
                        "first": "Richard",
                        "middle": [],
                        "last": "Wicentowski",
                        "suffix": ""
                    }
                ],
                "year": 2001,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "David Yarowsky, Grace Ngai and Richard Wicen- towski. 2001. Inducing multilingual text analysis tools via robust projection across aligned corpora.",
                "links": null
            },
            "BIBREF15": {
                "ref_id": "b15",
                "title": "Human Language Technology Conference",
                "authors": [],
                "year": null,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "In Human Language Technology Conference, pag- es 109-116, San Diego, California, March.",
                "links": null
            },
            "BIBREF16": {
                "ref_id": "b16",
                "title": "Automatic Acquisition of Chinese-English Parallel Corpus from the Web",
                "authors": [
                    {
                        "first": "Ying",
                        "middle": [],
                        "last": "Zhang",
                        "suffix": ""
                    },
                    {
                        "first": "Ke",
                        "middle": [],
                        "last": "Wu",
                        "suffix": ""
                    }
                ],
                "year": 2006,
                "venue": "Proceedings of ECIR-06, 28th European Conference on Information Retrieval",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Ying Zhang, Ke Wu, Jianfeng Gao, and Phil Vines. 2006. Automatic Acquisition of Chinese-English Parallel Corpus from the Web. In Proceedings of ECIR-06, 28th European Conference on Informa- tion Retrieval.",
                "links": null
            },
            "BIBREF17": {
                "ref_id": "b17",
                "title": "Interpreting BLEU/NIST scores: How much improvement do we need to have a better system?",
                "authors": [
                    {
                        "first": "Ying",
                        "middle": [],
                        "last": "Zhang",
                        "suffix": ""
                    },
                    {
                        "first": "Stephan",
                        "middle": [],
                        "last": "Vogel",
                        "suffix": ""
                    },
                    {
                        "first": "Alex",
                        "middle": [],
                        "last": "Waibel",
                        "suffix": ""
                    }
                ],
                "year": 2004,
                "venue": "Proceedings of the Fourth International Conference on Language Resources and Evaluation (LREC)",
                "volume": "",
                "issue": "",
                "pages": "2051--2054",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Ying Zhang, Stephan Vogel, and Alex Waibel. 2004. Interpreting BLEU/NIST scores: How much im- provement do we need to have a better system? In Proceedings of the Fourth International Confe- rence on Language Resources and Evaluation (LREC), pages 2051-2054.",
                "links": null
            },
            "BIBREF18": {
                "ref_id": "b18",
                "title": "Named entity recognition using an HMM-based chunk tagger",
                "authors": [
                    {
                        "first": "Guodong",
                        "middle": [],
                        "last": "Zhou",
                        "suffix": ""
                    },
                    {
                        "first": "Jian",
                        "middle": [],
                        "last": "Su",
                        "suffix": ""
                    }
                ],
                "year": 2002,
                "venue": "Proceedings of the 40th Annual Meeting of the Association of Comparative Linguistics (ACL)",
                "volume": "",
                "issue": "",
                "pages": "473--480",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Guodong Zhou and Jian Su. 2002. Named entity rec- ognition using an HMM-based chunk tagger. In Proceedings of the 40th Annual Meeting of the As- sociation of Comparative Linguistics (ACL), pages 473-480.",
                "links": null
            }
        },
        "ref_entries": {
            "FIGREF0": {
                "text": "(a) Word Alignment from Chinese to English. (b) Word Alignment from English to Chinese. (c) The Merged Result of Both Directions. In (a), \u56fd\u5bb6 and \u7bee\u7403 are aligned to NULL, the same to Stern in (b).",
                "uris": null,
                "type_str": "figure",
                "num": null
            },
            "FIGREF2": {
                "text": "(a) An eligible case; (b) An ineligible case. In (b), the word alignment pair ek -c j is against the rule, while k > i+3 or k < i.",
                "uris": null,
                "type_str": "figure",
                "num": null
            },
            "FIGREF3": {
                "text": "erated corpus. These two rules are shown as follows: \uf0b7 Rule 1 (the soft rule): Label a Chinese NE candidate as a non-NE, if a word within it has an alignment pair with an English word out of the corresponding English NE, such as Figure 4 (b). \uf0b7 Rule 2 (the hard rule): Discard the whole sentence where there is a case satisfying Rule 1.",
                "uris": null,
                "type_str": "figure",
                "num": null
            },
            "TABREF3": {
                "type_str": "table",
                "text": "",
                "html": null,
                "content": "<table><tr><td>NEs</td><td>Label</td><td>Average Score</td><td>Freq.</td></tr><tr><td>\u5317\u4eac (Beijing)</td><td>LOC</td><td>0.637</td><td>4615</td></tr><tr><td>\u514b\u6797\u987f (Clinton)</td><td>PER</td><td>0.853</td><td>969</td></tr><tr><td>\u8054\u5408\u56fd (UN)</td><td>ORG</td><td>0.471</td><td>436</td></tr><tr><td colspan=\"2\">\u53f0\u6e7e \u6d77\u5ce1 (Taiwan Strait) LOC</td><td>0.244</td><td>82</td></tr></table>",
                "num": null
            },
            "TABREF5": {
                "type_str": "table",
                "text": "are used, which contain word features, POS features, position features, and labeled NE tag features. The model was evaluated on the People's Daily test set, 863-Evaluation corpus and OntoNotes corpus. The result is shown inTable 3.",
                "html": null,
                "content": "<table><tr><td/><td>P</td><td>R</td><td>F1</td></tr><tr><td>People's Daily</td><td>90.77%</td><td>88.90%</td><td>89.82%</td></tr><tr><td>863-Evaluation</td><td>74.55%</td><td>59.13%</td><td>65.87%</td></tr><tr><td>OntoNotes</td><td>78.32%</td><td>64.28%</td><td>70.56%</td></tr><tr><td colspan=\"4\">Table 3. Evaluation Result of the Baseline System</td></tr></table>",
                "num": null
            },
            "TABREF7": {
                "type_str": "table",
                "text": "Test Results for the Generated Training Data",
                "html": null,
                "content": "<table/>",
                "num": null
            },
            "TABREF9": {
                "type_str": "table",
                "text": "Radu Florian, Abe Ittycheriah, Hongyan Jing, and Tong Zhang. 2003. Named entity recognition through classifier combination. In Proceedings of the 7th Conference on Natural Language Learning (CoNLL), pages 168-171. Fei Huang and Stephan Vogel. 2002. Improved Named Entity Translation and Bilingual Named Entity Extraction. In Proceedings of the 4th IEEE International Conference on Multimodal Interface, pages 253-258. Pittsburgh, PA, October.",
                "html": null,
                "content": "<table><tr><td>Training data</td><td>PER</td><td colspan=\"3\">863-Evaluation corpus LOC</td><td>ORG</td><td>PER</td><td>OntoNotes corpus LOC</td><td>ORG</td></tr><tr><td>People's Daily (PD)</td><td colspan=\"2\">59.91%</td><td>74.97%</td><td colspan=\"2\">35.61%</td><td>72.96%</td><td>76.89%</td><td>47.72%</td></tr><tr><td>Rule2+Score+List</td><td colspan=\"2\">62.68%</td><td>72.36%</td><td colspan=\"2\">28.81%</td><td>66.36%</td><td>76.43%</td><td>44.78%</td></tr><tr><td>Rule2+Score+List+PD</td><td colspan=\"2\">66.15%</td><td>75.00%</td><td colspan=\"2\">36.22%</td><td>75.24%</td><td>78.31%</td><td>55.10%</td></tr></table>",
                "num": null
            }
        }
    }
}