File size: 62,832 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
{
    "paper_id": "2019",
    "header": {
        "generated_with": "S2ORC 1.0.0",
        "date_generated": "2023-01-19T07:30:17.359216Z"
    },
    "title": "Development of POS tagger for English-Bengali Code-Mixed data",
    "authors": [
        {
            "first": "Tathagata",
            "middle": [],
            "last": "Raha",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Jadavpur University",
                "location": {
                    "settlement": "Kolkata"
                }
            },
            "email": "tathagata.raha@research.iiit.ac.in"
        },
        {
            "first": "Sainik",
            "middle": [],
            "last": "Kumar Mahata",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Jadavpur University",
                "location": {
                    "settlement": "Kolkata"
                }
            },
            "email": ""
        },
        {
            "first": "Dipankar",
            "middle": [],
            "last": "Das",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Jadavpur University",
                "location": {
                    "settlement": "Kolkata"
                }
            },
            "email": ""
        },
        {
            "first": "Sivaji",
            "middle": [],
            "last": "Bandyopadhyay",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Jadavpur University",
                "location": {
                    "settlement": "Kolkata"
                }
            },
            "email": ""
        },
        {
            "first": "",
            "middle": [],
            "last": "Iiit",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Jadavpur University",
                "location": {
                    "settlement": "Kolkata"
                }
            },
            "email": ""
        },
        {
            "first": "",
            "middle": [],
            "last": "Hyderabad",
            "suffix": "",
            "affiliation": {
                "laboratory": "",
                "institution": "Jadavpur University",
                "location": {
                    "settlement": "Kolkata"
                }
            },
            "email": ""
        }
    ],
    "year": "",
    "venue": null,
    "identifiers": {},
    "abstract": "Code-mixed texts are widespread nowadays due to the advent of social media. Since these texts combine two languages to formulate a sentence, it gives rise to various research problems related to Natural Language Processing. In this paper, we try to excavate one such problem, namely, Parts of Speech tagging of code-mixed texts. We have built a system that can POS tag English-Bengali code-mixed data where the Bengali words were written in Roman script. Our approach initially involves the collection and cleaning of English-Bengali code-mixed tweets. These tweets were used as a development dataset for building our system. The proposed system is a modular approach that starts by tagging individual tokens with their respective languages and then passes them to different POS taggers, designed for different languages (English and Bengali, in our case). Tags given by the two systems are later joined together and the final result is then mapped to a universal POS tag set. Our system was checked using 100 manually POS tagged code-mixed sentences and it returned an accuracy of 75.29%.",
    "pdf_parse": {
        "paper_id": "2019",
        "_pdf_hash": "",
        "abstract": [
            {
                "text": "Code-mixed texts are widespread nowadays due to the advent of social media. Since these texts combine two languages to formulate a sentence, it gives rise to various research problems related to Natural Language Processing. In this paper, we try to excavate one such problem, namely, Parts of Speech tagging of code-mixed texts. We have built a system that can POS tag English-Bengali code-mixed data where the Bengali words were written in Roman script. Our approach initially involves the collection and cleaning of English-Bengali code-mixed tweets. These tweets were used as a development dataset for building our system. The proposed system is a modular approach that starts by tagging individual tokens with their respective languages and then passes them to different POS taggers, designed for different languages (English and Bengali, in our case). Tags given by the two systems are later joined together and the final result is then mapped to a universal POS tag set. Our system was checked using 100 manually POS tagged code-mixed sentences and it returned an accuracy of 75.29%.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Abstract",
                "sec_num": null
            }
        ],
        "body_text": [
            {
                "text": "A Parts-of-Speech (POS) Tagger is a piece of software that reads the text in some language and assigns parts of speech tags, such as noun, verb, adjective, etc., to each word/token. POS Tags are useful for building parse trees, which may be used to build textbfNamed Entity Recognizers (NER) or Dependency Parsers. POS Tagging is also useful for building lemmatizers, which are used to reduce a word to its root form. POS taggers for widely spoken languages have been developed in abundance. But such resources are very scarce for low resourced languages.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "On the other hand, code-mixing is simply a mix of two or more languages in communication. Due to the emergence of social media, a lavish amount of digital code-mixed data is generated. This is because people nowadays are very comfortable with multilingualism. This phenomenon has produced a section of researchers, who contemplate codemixed texts as being a new language.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "As mentioned earlier, since POS tagging systems for low resourced languages are hard to come by, developing one that will cater to code-mixed text is trivial. POS tagging systems, if developed for Code-Mixed data, can lead to deciphering many complex Natural Language Processing (NLP) tasks and hence, we attempt to develop the same in this reported work. We try to focus on creating a POS tagger for English-Bengali codemixed data, as languages such as Bengali are morphologically rich in nature.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "Our method includes scraping of code-mixed English-Bengali tweets on Twitter and cleaning them. The Bengali words in these tweets were in Roman script. These cleaned tweets were used as a development dataset for building our system. Our system starts with tagging individual tokens of a tweet with their respective languages, either English, Bengali or Unknown. This step will give rise to segments/sub-sequences of the tweet, written in the same language. It is to be noted that tokens tagged as Unknown were discarded. The segments will then be passed to two POS taggers, one designed for English and the other designed for Bengali. The output from the POS taggers will then be joined together to get the final POS tagged, code-mixed tweet. Since the POS tagging modules of English and Bengali use different tag sets, we further map the tags to a manually defined universal POS tag set. This step produces a final POS tagged tweet with uniform tags. The architecture of the proposed model is shown in Figure 1 .",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 1003,
                        "end": 1011,
                        "text": "Figure 1",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "The remainder of the paper is organized as follows. Section 2 documents a brief state-of-art on Figure 1 : Architecture of the proposed model. this domain. Section 3 defines the data preparation steps. Section 4 defines the pipeline which helps us in POS tagging the code-mixed tweets. This will be followed by the results in Section 5 and concluding remarks in Section 6.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 96,
                        "end": 104,
                        "text": "Figure 1",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Introduction",
                "sec_num": "1"
            },
            {
                "text": "In the past few years, a lot of significant work has been done in the field of Parts of Speech tagging. The first significant POS tagger came in the early Nineties which was a rule-based tagger (Karlsson et al., 2011) . One of the English rulebased taggers had an accuracy of 99.5% (Samuelsson and Voutilainen, 1997) . POS taggers based on statistical approaches were also used during this time, which was based on statistical models like bi-gram,tri-gram and Markov Models (DeRose, 1988; Cutting et al., 1992; Dermatas and Kokkinakis, 1995; Meteer et al., 1991; Merialdo, 1994) . Subsequently, POS tagger based on both statistical methods and a rule-based approach was proposed by Brill (1992) . Use of Conditional Random Fields for the development of POS taggers was proposed by Lafferty et al. (2001 ), Shrivastav et al. (2006 and Sha and Pereira (2003) . Nakamura et al. (1990) used neural networks for POS tagging for the first time.",
                "cite_spans": [
                    {
                        "start": 194,
                        "end": 217,
                        "text": "(Karlsson et al., 2011)",
                        "ref_id": "BIBREF8"
                    },
                    {
                        "start": 282,
                        "end": 316,
                        "text": "(Samuelsson and Voutilainen, 1997)",
                        "ref_id": "BIBREF15"
                    },
                    {
                        "start": 474,
                        "end": 488,
                        "text": "(DeRose, 1988;",
                        "ref_id": "BIBREF6"
                    },
                    {
                        "start": 489,
                        "end": 510,
                        "text": "Cutting et al., 1992;",
                        "ref_id": "BIBREF2"
                    },
                    {
                        "start": 511,
                        "end": 541,
                        "text": "Dermatas and Kokkinakis, 1995;",
                        "ref_id": "BIBREF5"
                    },
                    {
                        "start": 542,
                        "end": 562,
                        "text": "Meteer et al., 1991;",
                        "ref_id": "BIBREF12"
                    },
                    {
                        "start": 563,
                        "end": 578,
                        "text": "Merialdo, 1994)",
                        "ref_id": "BIBREF11"
                    },
                    {
                        "start": 682,
                        "end": 694,
                        "text": "Brill (1992)",
                        "ref_id": "BIBREF1"
                    },
                    {
                        "start": 781,
                        "end": 802,
                        "text": "Lafferty et al. (2001",
                        "ref_id": "BIBREF10"
                    },
                    {
                        "start": 803,
                        "end": 829,
                        "text": "), Shrivastav et al. (2006",
                        "ref_id": null
                    },
                    {
                        "start": 834,
                        "end": 856,
                        "text": "Sha and Pereira (2003)",
                        "ref_id": null
                    },
                    {
                        "start": 859,
                        "end": 881,
                        "text": "Nakamura et al. (1990)",
                        "ref_id": "BIBREF13"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "2"
            },
            {
                "text": "POS taggers for the Bengali language was also built by Seddiqui et al. (2003) . This POStagger was built on the analysis of the Bengali morphemes. Other works have been done in Bengali POS tagging by Hasan et al. (2007) and Dandapat et al. (2007) which were rule-based and semisupervised.",
                "cite_spans": [
                    {
                        "start": 55,
                        "end": 77,
                        "text": "Seddiqui et al. (2003)",
                        "ref_id": "BIBREF17"
                    },
                    {
                        "start": 200,
                        "end": 219,
                        "text": "Hasan et al. (2007)",
                        "ref_id": "BIBREF7"
                    },
                    {
                        "start": 224,
                        "end": 246,
                        "text": "Dandapat et al. (2007)",
                        "ref_id": "BIBREF3"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "2"
            },
            {
                "text": "Pimpale and Patel (2016) attempted to tag codemixed data using Stanford POS tagger. He trained the POS tagger on constrained data of Hindi, Bengali, and Telugu, mixed with English. They garnered accuracy figures of 71%. Similarly, Sarkar (2016) used the HMM model on constrained codemixed data and achieved an accuracy figure of 75.60%.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "2"
            },
            {
                "text": "Pipeline architecture for POS tagging of codemixed data was first used by Barman et al. (2016) . The training data was very low in their case and the LID (language identification) and transliteration models used were based on Support Vector Machines (SVM) and manual transliteration. Our approach also used pipeline architecture similar to theirs, but our model does not require any annotated data to train the system. Also, the LID and transliteration modules, in our case, have been fully trained with much larger data, using Deep Learning architecture.",
                "cite_spans": [
                    {
                        "start": 74,
                        "end": 94,
                        "text": "Barman et al. (2016)",
                        "ref_id": "BIBREF0"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Related Work",
                "sec_num": "2"
            },
            {
                "text": "We decided to use a development dataset for building our system. It is to be noted that this data was used to build the proposed system and not to train it. Since code-mixed data consisting of English and Bengali language are difficult to find, we decided to scrape such data from Twitter. The collected tweets contained multiple degrees of noise and hence, it needed to be cleaned before using it to develop our future systems. After cleaning the tweets, they were subjected to a Language Tagger module that tagged every token of the tweet with their corresponding language (English, Bengali, and Unknown, in this case).",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Data Preparation",
                "sec_num": "3"
            },
            {
                "text": "Initially, we had to assemble the development data, consisting of English-Bengali code-mixed data, that will be used to build the POS tagger model. For this, we scraped tweets from Twitter, as it is a social media handle with a huge repository of such data. Our tweet scraper module used the Twint module 1 , a python package that helps to scrape tweets. The program was fed with a list of Bengali (Romanized) keywords that will be used to scrape the tweets. Later, the Twint object iterates the keywords and recovers tweets corresponding to the same keywords.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Tweet Scraping and Cleaning",
                "sec_num": "3.1"
            },
            {
                "text": "Using this method, 5,148 code-mixed tweets containing English and Bengali (Romanized) words were collected. The collected tweets were noisy and hence we needed to clean it beforehand to proceed. The cleaning module was a manifold approach that involved cleaning links, smileys, Emojis, Hashtags, and Mentions (Usernames).",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Tweet Scraping and Cleaning",
                "sec_num": "3.1"
            },
            {
                "text": "We observed that there is no end-to-end POS tagger available that can jointly tag English and Bengali tokens. Thus we decided to segment the cleaned tweets, into Bengali and English. This was done so that tokens in different language segments can be tagged with their respective POS tags, separately.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Language Tagging and Segmentation",
                "sec_num": "3.2"
            },
            {
                "text": "For segmenting the tweets, the words needed to be tagged with their corresponding language. To develop such a Language Tagging (LT) model, we collected 11,060 Romanized words of Bengali and 7,223 words of English. We developed a binary classification model that takes as input, the tokens of a tweet (in character embedding) and outputs the language of the word to either English or Bengali. Tokens (in character embedding) were fed to a stacked LSTM of size 2. The output vectors from the LSTM cells were then fed to a fully connected layer, which then mapped the words to its specific language. For the given model, Activation was kept as Sigmoid, Optimizer used was Adam and Loss used was Binary Crossentropy. Batch Size was kept at 30. The program was executed for 30 epochs and the model was validated using a validation split of 0.2.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Language Tagging and Segmentation",
                "sec_num": "3.2"
            },
            {
                "text": "The architecture of the language tagging module is shown in Figure 2 . The model returned a validation accuracy of 91%. It is to be noted that, characters apart from alphabets and numbers were tagged as Unknown'. Tweets with no language tag and only unknown tags were discarded. An example of language tagging is shown in Table 1 . Statistics of the tweets after cleaning and language tagging are shown in Table 2 .",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 60,
                        "end": 68,
                        "text": "Figure 2",
                        "ref_id": "FIGREF0"
                    },
                    {
                        "start": 322,
                        "end": 329,
                        "text": "Table 1",
                        "ref_id": "TABREF1"
                    },
                    {
                        "start": 406,
                        "end": 413,
                        "text": "Table 2",
                        "ref_id": "TABREF3"
                    }
                ],
                "eq_spans": [],
                "section": "Language Tagging and Segmentation",
                "sec_num": "3.2"
            },
            {
                "text": "After the language tagging is done, a segmenta- I loved the golpo and khabar ta khub nice chilo . I\\en loved\\en the\\en golpo\\bn and\\en khabar\\bn ta\\bn khub\\bn nice\\en chilo\\bn .\\un tion module partitions the code-mixed input into segments concerning its language tags. In our case, segments are sub-sequences of the instance, written in the same language. An example of segmentation is shown below, where strings in brackets denote segments;",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Language Tagging and Segmentation",
                "sec_num": "3.2"
            },
            {
                "text": "1. (Movie) En (ta bhalo chilo) Bn (but mid point) En (e amar khub) Bn (boring) En (lagte shuru korlo) Bn . 2. (I had to go) En (karon o khub) Bn (urgently) En (daklo amaye) Bn .",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Language Tagging and Segmentation",
                "sec_num": "3.2"
            },
            {
                "text": "Language tagged tweets were then analyzed to examine switching patterns. For this, the tweets were tokenized and a list of bigrams was extracted. Since the tokens of the tweets are tagged with their specific language, we could find out the count of bigrams with respect to EN-EN (both tokens of biagram are in English), BN-BN (both tokens of biagram are in Bengali), EN-BN (fist token of biagram is in English and second in Bengali) and BN-EN (fist token of biagram is in English and second in Bengali).",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Language Switch Analysis",
                "sec_num": "3.3"
            },
            {
                "text": "After the data preparation step, the language tagged segments are passed to the corresponding For the Bengali segments, we used a tagger developed by Das et al. (2014) . They trained the tagger on 10,000 Bengali (Devanagari) POS tagged sentences and tested it on 2,000 Bengali (Devanagari) sentences. Their model returned 92% accuracy. To use their model, we had to transliterate the Bengali segments into its corresponding Devanagari script. The model developed to do the same is described in Section 4.1.",
                "cite_spans": [
                    {
                        "start": 150,
                        "end": 167,
                        "text": "Das et al. (2014)",
                        "ref_id": "BIBREF4"
                    }
                ],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Parts of Speech Tagging",
                "sec_num": "4"
            },
            {
                "text": "To develop the transliteration system, we initially collected 22,781 Romanized Bengali words and manually transliterated them to its Devanagari counterpart. We developed a Sequence-to-Sequence model that takes as input the Romanized Bengali words and outputs the Bengali words in the Devanagari script. The embedding used in this model was at the character level.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Bengali Transliteration",
                "sec_num": "4.1"
            },
            {
                "text": "The model consists of two parts: an Encoder and Decoder. The encoder takes as input, Romanized Bengali characters, creates one-hot vectors of the same and passes this to the Embedding layer. The output of the embedding layer is given to a stacked LSTM cell, which produces a context vector of the input word. The Decoder module takes as input the Bengali characters in Devanagari script, creates a one-hot vector of the same and passes it to an embedding layer. The output of the embedding layer is given to a stacked LSTM cell which is initialized with the state of the encoder module. The stacked LSTM cell then pro-2 https://nlp.stanford.edu/software/tagger.shtml duces Bengali characters (in Devanagari script) as output, with an offset of a one-time step. The activation of the model was selected as Softmax, Optimizer used was Adam and Loss used was Sparse Categorical Crossentropy. Batch Size was kept at 1024. The program was executed for 50 epochs and the model was validated using a validation split of 0.1.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Bengali Transliteration",
                "sec_num": "4.1"
            },
            {
                "text": "The validation accuracy of the model was recorded as 87%. The architecture of the model is shown in Figure 3 . The transliterated segments are then fed to the Bengali POS tagger and the corresponding outputs are recorded.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 100,
                        "end": 108,
                        "text": "Figure 3",
                        "ref_id": "FIGREF1"
                    }
                ],
                "eq_spans": [],
                "section": "Bengali Transliteration",
                "sec_num": "4.1"
            },
            {
                "text": "After POS tagging both the English and Bengali segments, the results are joined together to get a POS tagged code-mixed tweet.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Bengali Transliteration",
                "sec_num": "4.1"
            },
            {
                "text": "The final POS tagged code-mixed tweets need to be generalized to a universal system because the POS tags of the Bengali and English POS taggers are different. This is because English and Bengali POS taggers have different grammar and thus use different POS tag sets. To simplify this situation, we use a universal POS tag set that comprises the tags as showed in Table 4 . The table shows the universal tags in bold and italics while the other texts define the universal tag.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 363,
                        "end": 370,
                        "text": "Table 4",
                        "ref_id": null
                    }
                ],
                "eq_spans": [],
                "section": "Mapping to Universal POS Tag Set",
                "sec_num": "4.2"
            },
            {
                "text": "For mapping the English POS tags to this universal POS tag set we use map tag which is an inbuilt tool of NLTK. It maps the English tags to these tags based on some pre-defined rules. Table 4 : Universal tag set, where text in bold and italics denote the tag and the text above define the tags POS tags) to the universal POS tag set is shown in Table 5 . Here, text in bold and italics denotes the universal tag, while the other defines the Stanford POS tags. Finally, the POS tagged segments (mapped to the universal POS tagset) are recorded as the final output.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 184,
                        "end": 191,
                        "text": "Table 4",
                        "ref_id": null
                    },
                    {
                        "start": 345,
                        "end": 352,
                        "text": "Table 5",
                        "ref_id": "TABREF8"
                    }
                ],
                "eq_spans": [],
                "section": "Mapping to Universal POS Tag Set",
                "sec_num": "4.2"
            },
            {
                "text": "Since there is no automated evaluation metric present to assess the quality of POS tagging a code-mixed sentence, we hired a linguist who was proficient in both Bengali and English. The linguist was asked to prepare a test data comprising of 100 English-Bengali code-mixed sentences. Further, the linguist was asked to POS tag the tokens, based on the universal POS tagset, separately. The linguist was told to look into the context of the sentence while tagging the tokens. This approach was used to properly \u2022 tag ambiguous words, such as 'to', which occurs in both English and Bengali. \u2022 tag words in the switching point. The same test data was tagged using our system as well. To calculate the agreement between the manual annotation and system annotation, we used Krippendorff's Alpha (Krippendorff, 2011) , and the metrics and the confusion are shown in Table 6 : Agreement Analysis between manual tagged and system tagged POS tags",
                "cite_spans": [
                    {
                        "start": 790,
                        "end": 810,
                        "text": "(Krippendorff, 2011)",
                        "ref_id": "BIBREF9"
                    }
                ],
                "ref_spans": [
                    {
                        "start": 860,
                        "end": 867,
                        "text": "Table 6",
                        "ref_id": "TABREF9"
                    }
                ],
                "eq_spans": [],
                "section": "Results",
                "sec_num": "5"
            },
            {
                "text": "Inter-system annotation agreement scores described in Table 6 evaluates the overall system. To dive deeper, we evaluated every sentence of the test data. This was done using two methods.",
                "cite_spans": [],
                "ref_spans": [
                    {
                        "start": 54,
                        "end": 61,
                        "text": "Table 6",
                        "ref_id": "TABREF9"
                    }
                ],
                "eq_spans": [],
                "section": "Results",
                "sec_num": "5"
            },
            {
                "text": "For a code-mixed sentence, the POS tag of every token in the same manually annotated sentence as compared to the POS tag of every token in the same system annotated sentence. score A was calculated as scoreA = # matched POS tags with manual tagged sentence # tokens in the manually annotated sentence",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Method 1:",
                "sec_num": null
            },
            {
                "text": "POS tagging of tokens that lie in the language switching point,i.e., word English \u2194 word Bengali , is of utmost importance as the context of the two words may change. As a result, POS tags may also differ. In this context, score B was calculated by multiplying 0.25 to score A and taking the absolute value of its log value, if POS tags (for the language switching point) in the manually annotated sentence and the system annotated sentence, match. The multiplying factor was kept at 0.25 as there can be four bigrams, i.e., EN-EN, BN-BN, EN-BN, and BN-EN.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Method 2:",
                "sec_num": null
            },
            {
                "text": "If there is more than one switching point and the POS tags match, the multiplying factor was repeated for the number of switching. So, if there are two switching points, and the POS tags match, score A will be multiplied by 0.25 and 0.25 to get score B . scoreB = |log(scoreA * (0.25) n )|",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Method 2:",
                "sec_num": null
            },
            {
                "text": ", where n denotes the number of language switching points present and the trailing * denote that the formula holds true if certain conditions are met. With the help of the above methods, Score A and Score B were calculated for every sentence and finally, the average for the whole test data was calculated. With method 1, our algorithm garnered accuracy of 72.72% and with method 2, the accuracy increased to 75.29%.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Method 2:",
                "sec_num": null
            },
            {
                "text": "In this work, we have devised a modular system that can POS tag English-Bengali code-mixed sentences. The system uses sub-modules to perform the same. Owing to the fact, that the submodules can be trained for any given language, the proposed approach can be used to tag a variety of code-mixed data involving any two language pairs.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusion",
                "sec_num": "6"
            },
            {
                "text": "The system can be enhanced further if the submodules can be trained using more annotated data. E.g., if the POS tagger for the Bengali language could have been trained using more data, the problem of tagging untrained tokens with 'UN' tags could have been solved. Also, the problem of wrongly tagging tokens, e.g., tagging NOUN as ADJ, VERB and tagging PRON as NOUN, VERB, etc., could have been solved. This would have made the Bengali POS tagging module more robust. The same applies to the transliteration module as well.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusion",
                "sec_num": "6"
            },
            {
                "text": "In the future, we would like to develop an end-to-end system, so that the errors of one submodule do not propagate to the other sub-modules.",
                "cite_spans": [],
                "ref_spans": [],
                "eq_spans": [],
                "section": "Conclusion",
                "sec_num": "6"
            }
        ],
        "back_matter": [],
        "bib_entries": {
            "BIBREF0": {
                "ref_id": "b0",
                "title": "Part-of-speech tagging of code-mixed social media content: Pipeline, stacking and joint modelling",
                "authors": [
                    {
                        "first": "Utsab",
                        "middle": [],
                        "last": "Barman",
                        "suffix": ""
                    },
                    {
                        "first": "Joachim",
                        "middle": [],
                        "last": "Wagner",
                        "suffix": ""
                    },
                    {
                        "first": "Jennifer",
                        "middle": [],
                        "last": "Foster",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "Proceedings of the Second Workshop on Computational Approaches to Code Switching",
                "volume": "",
                "issue": "",
                "pages": "30--39",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Utsab Barman, Joachim Wagner, and Jennifer Foster. 2016. Part-of-speech tagging of code-mixed social media content: Pipeline, stacking and joint mod- elling. In Proceedings of the Second Workshop on Computational Approaches to Code Switching, pages 30-39.",
                "links": null
            },
            "BIBREF1": {
                "ref_id": "b1",
                "title": "A simple rule-based part of speech tagger",
                "authors": [
                    {
                        "first": "Eric",
                        "middle": [],
                        "last": "Brill",
                        "suffix": ""
                    }
                ],
                "year": 1992,
                "venue": "Proceedings of the third conference on Applied natural language processing",
                "volume": "",
                "issue": "",
                "pages": "152--155",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Eric Brill. 1992. A simple rule-based part of speech tagger. In Proceedings of the third conference on Applied natural language processing, pages 152- 155. Association for Computational Linguistics.",
                "links": null
            },
            "BIBREF2": {
                "ref_id": "b2",
                "title": "A practical part-of-speech tagger",
                "authors": [
                    {
                        "first": "Doug",
                        "middle": [],
                        "last": "Cutting",
                        "suffix": ""
                    },
                    {
                        "first": "Julian",
                        "middle": [],
                        "last": "Kupiec",
                        "suffix": ""
                    },
                    {
                        "first": "Jan",
                        "middle": [],
                        "last": "Pedersen",
                        "suffix": ""
                    },
                    {
                        "first": "Penelope",
                        "middle": [],
                        "last": "Sibun",
                        "suffix": ""
                    }
                ],
                "year": 1992,
                "venue": "Third Conference on Applied Natural Language Processing",
                "volume": "",
                "issue": "",
                "pages": "133--140",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Doug Cutting, Julian Kupiec, Jan Pedersen, and Pene- lope Sibun. 1992. A practical part-of-speech tagger. In Third Conference on Applied Natural Language Processing, pages 133-140.",
                "links": null
            },
            "BIBREF3": {
                "ref_id": "b3",
                "title": "Automatic part-of-speech tagging for bengali: An approach for morphologically rich languages in a poor resource scenario",
                "authors": [
                    {
                        "first": "Sandipan",
                        "middle": [],
                        "last": "Dandapat",
                        "suffix": ""
                    },
                    {
                        "first": "Sudeshna",
                        "middle": [],
                        "last": "Sarkar",
                        "suffix": ""
                    },
                    {
                        "first": "Anupam",
                        "middle": [],
                        "last": "Basu",
                        "suffix": ""
                    }
                ],
                "year": 2007,
                "venue": "Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions",
                "volume": "",
                "issue": "",
                "pages": "221--224",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Sandipan Dandapat, Sudeshna Sarkar, and Anupam Basu. 2007. Automatic part-of-speech tagging for bengali: An approach for morphologically rich lan- guages in a poor resource scenario. In Proceedings of the 45th Annual Meeting of the ACL on Interactive Poster and Demonstration Sessions, pages 221-224. Association for Computational Linguistics.",
                "links": null
            },
            "BIBREF4": {
                "ref_id": "b4",
                "title": "Automatic detection of subject/object drops in bengali",
                "authors": [
                    {
                        "first": "A",
                        "middle": [],
                        "last": "Das",
                        "suffix": ""
                    },
                    {
                        "first": "U",
                        "middle": [],
                        "last": "Garain",
                        "suffix": ""
                    },
                    {
                        "first": "A",
                        "middle": [],
                        "last": "Senapati",
                        "suffix": ""
                    }
                ],
                "year": 2014,
                "venue": "2014 International Conference on Asian Language Processing (IALP)",
                "volume": "",
                "issue": "",
                "pages": "91--94",
                "other_ids": {
                    "DOI": [
                        "10.1109/IALP.2014.6973488"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "A. Das, U. Garain, and A. Senapati. 2014. Automatic detection of subject/object drops in bengali. In 2014 International Conference on Asian Language Pro- cessing (IALP), pages 91-94.",
                "links": null
            },
            "BIBREF5": {
                "ref_id": "b5",
                "title": "Automatic stochastic tagging of natural language texts",
                "authors": [
                    {
                        "first": "Evangelos",
                        "middle": [],
                        "last": "Dermatas",
                        "suffix": ""
                    },
                    {
                        "first": "George",
                        "middle": [],
                        "last": "Kokkinakis",
                        "suffix": ""
                    }
                ],
                "year": 1995,
                "venue": "Computational Linguistics",
                "volume": "21",
                "issue": "2",
                "pages": "137--163",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Evangelos Dermatas and George Kokkinakis. 1995. Automatic stochastic tagging of natural language texts. Computational Linguistics, 21(2):137-163.",
                "links": null
            },
            "BIBREF6": {
                "ref_id": "b6",
                "title": "Grammatical category disambiguation by statistical optimization",
                "authors": [
                    {
                        "first": "J",
                        "middle": [],
                        "last": "Steven",
                        "suffix": ""
                    },
                    {
                        "first": "",
                        "middle": [],
                        "last": "Derose",
                        "suffix": ""
                    }
                ],
                "year": 1988,
                "venue": "Computational linguistics",
                "volume": "14",
                "issue": "1",
                "pages": "31--39",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Steven J DeRose. 1988. Grammatical category disam- biguation by statistical optimization. Computational linguistics, 14(1):31-39.",
                "links": null
            },
            "BIBREF7": {
                "ref_id": "b7",
                "title": "Comparison of different pos tagging techniques (n-gram, hmm and brills tagger) for bangla",
                "authors": [
                    {
                        "first": "Naushad",
                        "middle": [],
                        "last": "Fahim Muhammad Hasan",
                        "suffix": ""
                    },
                    {
                        "first": "Mumit",
                        "middle": [],
                        "last": "Uzzaman",
                        "suffix": ""
                    },
                    {
                        "first": "",
                        "middle": [],
                        "last": "Khan",
                        "suffix": ""
                    }
                ],
                "year": 2007,
                "venue": "Advances and innovations in systems, computing sciences and software engineering",
                "volume": "",
                "issue": "",
                "pages": "121--126",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Fahim Muhammad Hasan, Naushad UzZaman, and Mumit Khan. 2007. Comparison of different pos tagging techniques (n-gram, hmm and brills tagger) for bangla. In Advances and innovations in systems, computing sciences and software engineering, pages 121-126. Springer.",
                "links": null
            },
            "BIBREF8": {
                "ref_id": "b8",
                "title": "Constraint Grammar: a language-independent system for parsing unrestricted text",
                "authors": [
                    {
                        "first": "Fred",
                        "middle": [],
                        "last": "Karlsson",
                        "suffix": ""
                    },
                    {
                        "first": "Atro",
                        "middle": [],
                        "last": "Voutilainen",
                        "suffix": ""
                    },
                    {
                        "first": "Juha",
                        "middle": [],
                        "last": "Heikkilae",
                        "suffix": ""
                    },
                    {
                        "first": "Arto",
                        "middle": [],
                        "last": "Anttila",
                        "suffix": ""
                    }
                ],
                "year": 2011,
                "venue": "",
                "volume": "4",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Fred Karlsson, Atro Voutilainen, Juha Heikkilae, and Arto Anttila. 2011. Constraint Grammar: a language-independent system for parsing unre- stricted text, volume 4. Walter de Gruyter.",
                "links": null
            },
            "BIBREF9": {
                "ref_id": "b9",
                "title": "Computing krippendorff's alpha-reliability",
                "authors": [
                    {
                        "first": "Klaus",
                        "middle": [],
                        "last": "Krippendorff",
                        "suffix": ""
                    }
                ],
                "year": 2011,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Klaus Krippendorff. 2011. Computing krippendorff's alpha-reliability.",
                "links": null
            },
            "BIBREF10": {
                "ref_id": "b10",
                "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 Cn",
                        "middle": [],
                        "last": "Pereira",
                        "suffix": ""
                    }
                ],
                "year": 2001,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "John Lafferty, Andrew McCallum, and Fernando CN Pereira. 2001. Conditional random fields: Prob- abilistic models for segmenting and labeling se- quence data.",
                "links": null
            },
            "BIBREF11": {
                "ref_id": "b11",
                "title": "Tagging english text with a probabilistic model",
                "authors": [
                    {
                        "first": "Bernard",
                        "middle": [],
                        "last": "Merialdo",
                        "suffix": ""
                    }
                ],
                "year": 1994,
                "venue": "Computational linguistics",
                "volume": "20",
                "issue": "2",
                "pages": "155--171",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Bernard Merialdo. 1994. Tagging english text with a probabilistic model. Computational linguistics, 20(2):155-171.",
                "links": null
            },
            "BIBREF12": {
                "ref_id": "b12",
                "title": "Post: Using probabilities in language processing",
                "authors": [
                    {
                        "first": "Marie",
                        "middle": [],
                        "last": "Meteer",
                        "suffix": ""
                    },
                    {
                        "first": "M",
                        "middle": [],
                        "last": "Richard",
                        "suffix": ""
                    },
                    {
                        "first": "Ralph",
                        "middle": [
                            "M"
                        ],
                        "last": "Schwartz",
                        "suffix": ""
                    },
                    {
                        "first": "",
                        "middle": [],
                        "last": "Weischedel",
                        "suffix": ""
                    }
                ],
                "year": 1991,
                "venue": "IJCAI",
                "volume": "",
                "issue": "",
                "pages": "960--965",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Marie Meteer, Richard M Schwartz, and Ralph M Weischedel. 1991. Post: Using probabilities in lan- guage processing. In IJCAI, pages 960-965.",
                "links": null
            },
            "BIBREF13": {
                "ref_id": "b13",
                "title": "Neural network approach to word category prediction for english texts",
                "authors": [
                    {
                        "first": "Masami",
                        "middle": [],
                        "last": "Nakamura",
                        "suffix": ""
                    },
                    {
                        "first": "Katsuteru",
                        "middle": [],
                        "last": "Maruyama",
                        "suffix": ""
                    },
                    {
                        "first": "Takeshi",
                        "middle": [],
                        "last": "Kawabata",
                        "suffix": ""
                    },
                    {
                        "first": "Kiyohiro",
                        "middle": [],
                        "last": "Shikano",
                        "suffix": ""
                    }
                ],
                "year": 1990,
                "venue": "Proceedings of the 13th conference on Computational linguistics",
                "volume": "3",
                "issue": "",
                "pages": "213--218",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Masami Nakamura, Katsuteru Maruyama, Takeshi Kawabata, and Kiyohiro Shikano. 1990. Neural net- work approach to word category prediction for en- glish texts. In Proceedings of the 13th conference on Computational linguistics-Volume 3, pages 213- 218. Association for Computational Linguistics.",
                "links": null
            },
            "BIBREF14": {
                "ref_id": "b14",
                "title": "Experiments with pos tagging code-mixed indian social media text",
                "authors": [
                    {
                        "first": "B",
                        "middle": [],
                        "last": "Prakash",
                        "suffix": ""
                    },
                    {
                        "first": "Raj",
                        "middle": [
                            "Nath"
                        ],
                        "last": "Pimpale",
                        "suffix": ""
                    },
                    {
                        "first": "",
                        "middle": [],
                        "last": "Patel",
                        "suffix": ""
                    }
                ],
                "year": 2016,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {
                    "arXiv": [
                        "arXiv:1610.09799"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Prakash B Pimpale and Raj Nath Patel. 2016. Exper- iments with pos tagging code-mixed indian social media text. arXiv preprint arXiv:1610.09799.",
                "links": null
            },
            "BIBREF15": {
                "ref_id": "b15",
                "title": "Comparing a linguistic and a stochastic tagger",
                "authors": [
                    {
                        "first": "Christer",
                        "middle": [],
                        "last": "Samuelsson",
                        "suffix": ""
                    },
                    {
                        "first": "Atro",
                        "middle": [],
                        "last": "Voutilainen",
                        "suffix": ""
                    }
                ],
                "year": 1997,
                "venue": "Proceedings of the 35th Annual Meeting of the Association for Computational Linguistics and Eighth Conference of the European Chapter of the Association for Computational Linguistics",
                "volume": "",
                "issue": "",
                "pages": "246--253",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Christer Samuelsson and Atro Voutilainen. 1997. Comparing a linguistic and a stochastic tagger. In Proceedings of the 35th Annual Meeting of the As- sociation for Computational Linguistics and Eighth Conference of the European Chapter of the Associa- tion for Computational Linguistics, pages 246-253. Association for Computational Linguistics.",
                "links": null
            },
            "BIBREF16": {
                "ref_id": "b16",
                "title": "Part-of-speech tagging for codemixed indian social media text at icon",
                "authors": [
                    {
                        "first": "Kamal",
                        "middle": [],
                        "last": "Sarkar",
                        "suffix": ""
                    }
                ],
                "year": 2015,
                "venue": "",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {
                    "arXiv": [
                        "arXiv:1601.01195"
                    ]
                },
                "num": null,
                "urls": [],
                "raw_text": "Kamal Sarkar. 2016. Part-of-speech tagging for code- mixed indian social media text at icon 2015. arXiv preprint arXiv:1601.01195.",
                "links": null
            },
            "BIBREF17": {
                "ref_id": "b17",
                "title": "Parts of speech tagging using morphological analysis in bangla",
                "authors": [
                    {
                        "first": "",
                        "middle": [],
                        "last": "Md Hanif Seddiqui",
                        "suffix": ""
                    },
                    {
                        "first": "",
                        "middle": [],
                        "last": "Rana",
                        "suffix": ""
                    }
                ],
                "year": 2003,
                "venue": "Proceeding of the 6th International Conference on Computer and Information Technology (ICCIT)",
                "volume": "",
                "issue": "",
                "pages": "",
                "other_ids": {},
                "num": null,
                "urls": [],
                "raw_text": "Md Hanif Seddiqui, AKMS Rana, Abdullah Al Mah- mud, and Taufique Sayeed. 2003. Parts of speech tagging using morphological analysis in bangla. In Proceeding of the 6th International Conference on Computer and Information Technology (ICCIT).",
                "links": null
            }
        },
        "ref_entries": {
            "FIGREF0": {
                "uris": null,
                "num": null,
                "text": "1 https://pypi.org/project/twint/ Language Tagging Module.",
                "type_str": "figure"
            },
            "FIGREF1": {
                "uris": null,
                "num": null,
                "text": "Back transliteration model",
                "type_str": "figure"
            },
            "TABREF1": {
                "html": null,
                "num": null,
                "type_str": "table",
                "content": "<table/>",
                "text": "Example of Language Tagging."
            },
            "TABREF3": {
                "html": null,
                "num": null,
                "type_str": "table",
                "content": "<table><tr><td colspan=\"3\">Switch Count Freq &gt;500 Freq &gt;1000</td></tr><tr><td>EN-BN 17,758</td><td>199</td><td>88</td></tr><tr><td>BN-EN 17,562</td><td>166</td><td>53</td></tr><tr><td>EN-EN 43,859</td><td>539</td><td>203</td></tr><tr><td>BN-BN 16,535</td><td>98</td><td>39</td></tr></table>",
                "text": "Statistics of tweets after cleaning and Language Tagging."
            },
            "TABREF4": {
                "html": null,
                "num": null,
                "type_str": "table",
                "content": "<table><tr><td>language POS tagger for the final tagging. Two</td></tr><tr><td>different POS tagging systems were used for En-</td></tr><tr><td>glish and Bengali. For POS tagging the English</td></tr><tr><td>Segments we used the Stanford POS tagger 2 and</td></tr><tr><td>the output was recorded.</td></tr></table>",
                "text": "Language Switch Analysis."
            },
            "TABREF8": {
                "html": null,
                "num": null,
                "type_str": "table",
                "content": "<table/>",
                "text": "Mapping of Bengali POS tags to the universal tagset. Text in bold and italics denotes the universal tag, while the other defines the Stanford POS tags"
            },
            "TABREF9": {
                "html": null,
                "num": null,
                "type_str": "table",
                "content": "<table><tr><td>POS</td><td>Man.</td><td>Syst.</td><td>Diff. &amp;</td></tr><tr><td>Tag</td><td>Tag</td><td>Tag</td><td>Conf.</td></tr><tr><td>NOUN</td><td>522</td><td>538</td><td>16 ADJ VERB</td></tr><tr><td>VERB</td><td>286</td><td>259</td><td>27 NOUN PRON</td></tr><tr><td>ADJ</td><td>169</td><td>141</td><td>28 NOUN VERB</td></tr><tr><td>PRON</td><td>104</td><td>118</td><td>14 ADJ ADV</td></tr><tr><td>ADV</td><td>93</td><td>63</td><td>30 VERB ADV</td></tr><tr><td>SYM</td><td>59</td><td>60</td><td>1 NUM</td></tr><tr><td>CONJ</td><td>58</td><td>49</td><td>9 NOUN VERB</td></tr><tr><td>DET</td><td>54</td><td>53</td><td>1 VERB</td></tr><tr><td>ADP</td><td>54</td><td>49</td><td>5 PRT</td></tr><tr><td>PRT</td><td>21</td><td>18</td><td>3 ADJ</td></tr><tr><td>DEM</td><td>10</td><td>11</td><td>1 NOUN</td></tr><tr><td>NUM</td><td>9</td><td>9</td><td>0</td></tr><tr><td>INTF</td><td>3</td><td>6</td><td>3 VERB</td></tr><tr><td>RDP</td><td>1</td><td>1</td><td>0</td></tr><tr><td>UN</td><td>0</td><td>606</td><td>606</td></tr><tr><td>K's \\alpha (Interval)</td><td/><td/><td>0.7522</td></tr></table>",
                "text": ""
            }
        }
    }
}