-
Notifications
You must be signed in to change notification settings - Fork 0
/
SentimentAnalysis.py
1166 lines (1064 loc) · 46.1 KB
/
SentimentAnalysis.py
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
import nltk
import nltk.corpus
from nltk.classify import MaxentClassifier
import numpy as np
from random import shuffle
from collections import defaultdict
from math import log, exp, sqrt
from nltk.corpus import treebank
from nltk.tag.util import untag # Untags a tagged sentence.
"""POS tagging for the dataset
"""
unknown_token = "<UNK>" # unknown word token.
start_token = "<S>" # sentence boundary token.
end_token = "</S>" # sentence boundary token.
# Remove trace tokens and tags from the treebank as these are not necessary.
def TreebankNoTraces():
return [[x for x in sent if x[1] != "-NONE-"] for sent in treebank.tagged_sents()]
def PreprocessText(dataset, vocab):
"""
the function for preprocessing the text:
1. Add the start token and the end token of each sentence in the dataset
2. Check whether the word is in the vocabulary. If not, replace it with unknown token.
"""
new_set = []
for sentence in dataset:
if len(sentence) == 0:
print sentence, dataset.index(sentence)
tmpSentence = list(sentence)
for i in range(len(tmpSentence)):
if tmpSentence[i][0] not in vocab:
tmpSentence[i] = (unknown_token, sentence[i][1])
tmp_sent = [(start_token, start_token)] + tmpSentence + [(end_token, end_token)]
new_set.append(tmp_sent)
return new_set
def PreprocessVocab(dataset):
"""
Get the vocabulary from the dataset.
"""
vocab_dict = defaultdict(int)
vocabulary = set([])
for sentence in dataset:
for word in sentence:
vocab_dict[word[0]] += 1
for word in vocab_dict.iterkeys():
if vocab_dict[word] > 1:
vocabulary.add(word)
return vocabulary
class BigramHMM:
"""
hidden markove model for bigram from the training set for tag determination of each words in the dataset
"""
def __init__(self):
""" Implement:
self.transitions, the A matrix of the HMM: a_{ij} = P(t_j | t_i)
self.emissions, the B matrix of the HMM: b_{ii} = P(w_i | t_i)
self.dictionary, a dictionary that maps a word to the set of possible tags
"""
self.transitions = defaultdict(float)
self.emissions = defaultdict(float)
self.dictionary = defaultdict(set)
def Train(self, training_set):
"""
1. Estimate the A matrix a_{ij} = P(t_j | t_i)
2. Estimate the B matrix b_{ii} = P(w_i | t_i)
3. Compute the tag dictionary
"""
unigram_tag = defaultdict(float)
for sentence in training_set:
for i in range(len(sentence)):
word = sentence[i][0]
tag = sentence[i][1]
if word not in self.dictionary:
self.dictionary[word] = set()
self.dictionary[word].add(tag)
unigram_tag[tag] += 1
self.emissions[sentence[i]] += 1
if i < len(sentence) - 1:
self.transitions[(tag, sentence[i + 1][1])] += 1
for bigram in self.transitions.keys():
self.transitions[bigram] = self.transitions[bigram] / unigram_tag[bigram[0]]
for unigram in self.emissions.keys():
self.emissions[unigram] = self.emissions[unigram] / unigram_tag[unigram[1]]
return None
def ComputePercentAmbiguous(self, data_set):
"""
Compute the percentage of tokens in data_set that have more than one tag according to self.dictionary.
"""
tag_dict = defaultdict(set)
total_token = 0.0
ambiguous_token = 0.0
for sentence in data_set:
for word in sentence:
total_token += 1.0
if len(self.dictionary[word[0]]) > 1:
ambiguous_token += 1.0
percent_ambiguous = ambiguous_token / total_token
print "There are %s tags for unknown_token." %len(self.dictionary[unknown_token])
print "The tags for the unknown token are ", list(self.dictionary[unknown_token])
return (100 * percent_ambiguous)
def JointProbability(self, sent):
"""
Compute the joint probability of the words and tags of a tagged sentence.
"""
probability = 1
for i in range(1, len(sent)):
current_tag = sent[i][1]
prev_tag = sent[i-1][1]
probability = probability * self.transitions[(prev_tag, current_tag)] * self.emissions[sent[i]]
return probability
def findMax(self, viterbi_dict, current_state, current_word, state):
"""
Find the maximum viterbi value in viterbi algorithm, and return the corresponding viterbi value and the previous state
"""
maxViterbi = 0.0
maxPrevState = state[0]
for prev_state in state:
tmp_viterbi = viterbi_dict[prev_state] * self.transitions[(prev_state, current_state)] * self.emissions[(current_word, current_state)]
if maxViterbi < tmp_viterbi:
maxViterbi = tmp_viterbi
maxPrevState = prev_state
return (maxViterbi, maxPrevState)
def Viterbi(self, sent):
"""
Utilize the viterbi algorithm to find the probability and identity of the most likely tag sequence given the sentence.
"""
# Preprocess to get the list of states
tmp_sent = sent[1:-1]
state = set()
for word in tmp_sent:
state.update(self.dictionary[word[0]])
state = list(state)
viterbi_matrix = []
backpointers = []
# Initialization step
tag_dict = defaultdict(float)
back_dict = defaultdict(str)
for current_state in state:
prev_state = sent[0][1]
current_word = sent[1][0]
tag_dict[current_state] = self.transitions[(prev_state, current_state)] * self.emissions[(current_word, current_state)]
back_dict[current_state] = prev_state
viterbi_matrix.append(tag_dict)
backpointers.append(back_dict)
# Recursion step
for t in range(1, len(tmp_sent)):
tag_dict = defaultdict(float)
back_dict = defaultdict(str)
current_word = tmp_sent[t][0]
for current_state in state:
(tag_dict[current_state], back_dict[current_state]) = self.findMax(viterbi_matrix[-1], current_state, current_word, state)
viterbi_matrix.append(tag_dict)
backpointers.append(back_dict)
# termination step
(current_word, current_state) = sent[-1]
tag_dict = defaultdict(float)
back_dict = defaultdict(str)
(tag_dict[current_state], back_dict[current_state]) = self.findMax(viterbi_matrix[-1], current_state, current_word, state)
viterbi_matrix.append(tag_dict)
backpointers.append(back_dict)
# Get the backtrace by the backpointers
backpointers.reverse()
backtrace = [sent[-1][1]]
for search_dict in backpointers:
tag = search_dict[backtrace[-1]]
backtrace.append(tag)
backtrace.reverse()
if viterbi_matrix[-1].values()[0] == 0:
return "incorrect"
else:
return backtrace
def Predict(self, test_set):
"""
Use Viterbi algorithm to build models and predict the most likely tag sequence for every sentence.
Return a re-tagged test_set.
"""
predict_set = []
flag = 1
for sentence in test_set:
backtrace = self.Viterbi(sentence)
if backtrace == "incorrect":
predict_set.append(sentence)
continue
predict_sentence = list(sentence)
for i in range(len(predict_sentence)):
predict_sentence[i] = (predict_sentence[i][0], backtrace[i])
predict_set.append(predict_sentence)
return predict_set
def ConfusionMatrix(self, test_set, test_set_predicted):
"""
Build the confusion matrix for assessing the performance of the model
"""
#preprocess the data
tag_set = set()
for tags in self.dictionary.values():
tag_set.update(tags)
tag_list = list(tag_set)
size = len(tag_list)
confusion_matrix = [[0.0 for x in range(size)] for y in range(size)] # In the confusion matrix, the first index is real tag, second is the predict tag
total_tagerror = 0.0
# Updating the confusion matrix
for i in range(len(test_set)):
real_sent = test_set[i]
predict_sent = test_set_predicted[i]
if test_set_predicted[i] == "incorrect":
continue
for j in range(len(real_sent)):
real_tag = real_sent[j][1]
predict_tag = predict_sent[j][1]
if real_tag != predict_tag:
total_tagerror += 1.0
real_position = tag_list.index(real_tag)
predict_position = tag_list.index(predict_tag)
confusion_matrix[real_position][predict_position] += 1.0
for i in range(size):
for j in range(size):
confusion_matrix[i][j] = 100 * confusion_matrix[i][j] / total_tagerror
# Extract the most confused classes
error_list = []
for num_list in confusion_matrix:
for num in num_list:
if num > 5:
error_list.append(num)
# print the output
error_list.sort()
error_list.reverse()
for num in error_list:
print "---------------------------------"
print "The error percentage is %.2f%%." %num,
for i in range(size):
if num in confusion_matrix[i]:
real_tag = tag_list[i]
j = confusion_matrix[i].index(num)
predict_tag = tag_list[j]
break
print "The tags are ", real_tag, "->", predict_tag
return None
def ComputeAccuracy(test_set, test_set_predicted):
"""
Using the gold standard tags in test_set, compute the sentence and tagging accuracy of test_set_predicted.
"""
correct_sent = 0
correct_tag = 0
total_sent = len(test_set)
total_tag = 0
for i in range(len(test_set)):
if test_set_predicted[i] == "incorrect":
continue
total_tag += len(test_set[i])
total_tag -= 2
flag = 1
for j in range(1, (len(test_set[i]) -1)):
if test_set[i][j][1] == test_set_predicted[i][j][1]:
correct_tag += 1
else:
flag = 0
if flag == 1:
correct_sent += 1
sent_accuracy = float(correct_sent) / float(total_sent)
tag_accuracy = float(correct_tag) / float(total_tag)
print "sentence accuracy is %.2f%%." %(100 * sent_accuracy)
print "tag accuracy is %.2f%%." %(100 * tag_accuracy)
return None
"""
Import Dataset
Tokenization
"""
class PolaritySents:
"""
Preprocess the dataset to divide the into two groups: positive and negative according to the labels of each sentences
"""
def __init__(self):
self.posSents = []
self.negSents = []
# example: dataset = nltk.corpus.product_reviews_2.raw()
def preprocess_dataset(self, dataset):
"""
Divide the sentences according to each label
"""
dataset = nltk.corpus.product_reviews_2
reviews = dataset.reviews()
features = []
sents = []
# Preprocess the sentence to remove the sentence with no labels
for review in reviews:
lines = review.review_lines
for line in lines:
if len(line.features) == 0:
continue
features.append(line.features)
sents.append(line.sent)
# Divide the preprocessed_sents into two lists according to the label
for i in range(len(features)):
feature = features[i]
sent_sentiment = 0
if sents[i] == []:
continue
for item in feature:
num = int(item[1])
sent_sentiment += num
if sent_sentiment > 0:
self.posSents.append(sents[i])
elif sent_sentiment < 0:
self.negSents.append(sents[i])
else:
continue
return
"""
Preprocess the dataset:
Divde the dataset into training set and test set
Find the best feature from the vocabulary of the dataset
label for positive sentence: 1
label for negative sentence: 0
"""
class Preprocess_Data_unigram:
"""
Preprocess the dataset with splitting into training set and test set
The feature used here is the unigram(single word)
"""
def __init__(self):
self.X_train = []
self.Y_train = []
self.X_test = []
self.Y_test = []
self.word_features = set()
def extract_sentence(self, polarity_sents):
"""
Extract the sentences from the preprocessed dataset (polarity dataset)
"""
# Get the minimum value of the size
pos_size = len(polarity_sents.posSents)
neg_size = len(polarity_sents.negSents)
min_size = min(pos_size, neg_size)
pos_sentence = polarity_sents.posSents
neg_sentence = polarity_sents.negSents
pos_sentence = pos_sentence[:min_size]
neg_sentence = neg_sentence[:min_size]
return (pos_sentence, neg_sentence)
def divide_dataset(self, fold_index, fold_num, pos_sentence, neg_sentence):
"""
Divide the dataset into training set and test set by cross validation method
"""
if fold_index >= fold_num:
print "error when dividing the dataset in cross validation"
return None
size = len(pos_sentence)
fold_size = int(size / fold_num)
if fold_index == fold_size - 1:
end_index = size
else:
end_index = fold_size * (fold_index + 1)
start_index = fold_size * fold_index
training_input = pos_sentence[:start_index] + pos_sentence[end_index:] + neg_sentence[:start_index] + neg_sentence[end_index:]
test_input = pos_sentence[start_index:end_index] + neg_sentence[start_index:end_index]
training_output = [1] * (size - (end_index - start_index)) + [-1] * (size - (end_index - start_index))
test_output = [1] * (end_index - start_index) + [-1] * (end_index - start_index)
return (training_input, training_output, test_input, test_output)
def transform_dataset(self, fold_index, fold_num, polarity_sents):
"""
Convert the form of the dataset into different list like X_train, etc and add the words from training set into word_feature set
"""
(pos_sentence, neg_sentence) = self.extract_sentence(polarity_sents)
(training_input, training_output, test_input, test_output) = self.divide_dataset(fold_index, fold_num, pos_sentence, neg_sentence)
self.Y_train = training_output
self.Y_test = test_output
for sentence in training_input:
instance = {}
for word in sentence:
self.word_features.add(word)
instance[word] = 1
self.X_train.append(instance)
for sentence in test_input:
instance = dict.fromkeys(sentence, 1)
self.X_test.append(instance)
def filter_dataset(self, num):
"""
filtering the words in the dataset to remove the words which are not in word_features
"""
word_list = filter_words(self, num)
self.word_features = set(word_list)
for sentence in self.X_train:
for word in sentence.keys():
if word not in self.word_features:
del sentence[word]
class Preprocess_Data_unigram_POS:
"""
Preprocess the dataset with splitting into training set and test set
The feature used here is the unigram and the tags for each word
"""
def __init__(self):
self.X_train =[]
self.Y_train = []
self.X_test = []
self.Y_test = []
self.word_features = set()
def extract_sentence(self, polarity_sents, vocab):
"""
Extract the sentences from the preprocessed dataset (polarity dataset)
"""
# Get the minimum value of the size
pos_size = len(polarity_sents.posSents)
neg_size = len(polarity_sents.negSents)
min_size = min(pos_size, neg_size)
pos_sentence = polarity_sents.posSents
neg_sentence = polarity_sents.negSents
pos_sentence = pos_sentence[:min_size]
neg_sentence = neg_sentence[:min_size]
# Add the tags fro each words in the sentences
new_pos_sentence = []
new_neg_sentence = []
for i in range(len(pos_sentence)):
sentence1 = pos_sentence[i]
tmp_list1 = [1 for j in range(len(sentence1))]
tmp_sentence1 = zip(sentence1, tmp_list1)
new_pos_sentence.append(tmp_sentence1)
sentence2 = neg_sentence[i]
tmp_list2 = [1 for j in range(len(sentence2))]
tmp_sentence2 = zip(sentence2, tmp_list2)
new_neg_sentence.append(tmp_sentence2)
pos_sentence_prep = PreprocessText(new_pos_sentence, vocab)
neg_sentence_prep = PreprocessText(new_neg_sentence, vocab)
return (pos_sentence_prep, neg_sentence_prep)
def divide_dataset(self, fold_index, fold_num, pos_sentence, neg_sentence):
"""
Divide the dataset into training set and test set by cross validation method
"""
if fold_index >= fold_num:
print "error when dividing the dataset in cross validation"
return None
size = len(pos_sentence)
fold_size = int(size / fold_num)
if fold_index == fold_size - 1:
end_index = size
else:
end_index = fold_size * (fold_index + 1)
start_index = fold_size * fold_index
training_input = pos_sentence[:start_index] + pos_sentence[end_index:] + neg_sentence[:start_index] + neg_sentence[end_index:]
test_input = pos_sentence[start_index:end_index] + neg_sentence[start_index:end_index]
training_output = [1] * (size - (end_index - start_index)) + [-1] * (size - (end_index - start_index))
test_output = [1] * (end_index - start_index) + [-1] * (end_index - start_index)
return (training_input, training_output, test_input, test_output)
def transform_dataset(self, fold_index, fold_num, polarity_sents, bigram_hmm, vocab):
"""
Convert the form of the dataset into different list like X_train, etc and add the tags for each one
"""
(pos_sentence, neg_sentence) = self.extract_sentence(polarity_sents, vocab)
(training_input, training_output, test_input, test_output) = self.divide_dataset(fold_index, fold_num, pos_sentence, neg_sentence)
self.Y_train = training_output
self.Y_test = test_output
adjective_words = set(['JJ', 'JJR', 'JJS'])
noun_words = set(['NN', 'NNP', 'NNPS', 'NNS'])
pred_training_sents = bigram_hmm.Predict(training_input)
pred_test_sents = bigram_hmm.Predict(test_input)
for sentence in pred_training_sents:
instance = {}
for i in range(1, len(sentence)):
current_word = sentence[i][0]
current_tag = sentence[i][1]
prev_word = sentence[i - 1][0]
prev_tag = sentence[i - 1][1]
self.word_features.add(current_word)
instance[current_word] = 1
if prev_tag in adjective_words and current_tag in noun_words:
bigram = (prev_word, current_word)
instance[bigram] = 1
self.X_train.append(instance)
for sentence in pred_test_sents:
instance = {}
for i in range(1, len(sentence)):
current_word = sentence[i][0]
current_tag = sentence[i][1]
prev_word = sentence[i - 1][0]
prev_tag = sentence[i - 1][1]
self.word_features.add(current_word)
instance[current_word] = 1
if prev_tag in adjective_words and current_tag in noun_words:
bigram = (prev_word, current_word)
instance[bigram] = 1
self.X_test.append(instance)
def filter_dataset(self, num):
"""
filtering the words in the dataset
"""
word_list = filter_words(self, num)
self.word_features = set(word_list)
for sentence in self.X_train:
for word in sentence.keys():
if word not in self.word_features:
del sentence[word]
class Preprocess_Data_bigram:
"""
Preprocess the dataset with splitting into training set and test set
The feature used here is the unigram and bigram (two neighboring words)
"""
def __init__(self):
self.X_train = []
self.Y_train = []
self.X_test = []
self.Y_test = []
self.word_features = set()
def extract_sentence(self, polarity_sents):
"""
Extract the sentences from the preprocessed dataset (polarity dataset)
"""
# Get the minimum value of the size
pos_size = len(polarity_sents.posSents)
neg_size = len(polarity_sents.negSents)
min_size = min(pos_size, neg_size)
pos_sentence = polarity_sents.posSents
neg_sentence = polarity_sents.negSents
pos_sentence = pos_sentence[:min_size]
neg_sentence = neg_sentence[:min_size]
return (pos_sentence, neg_sentence)
def divide_dataset(self, fold_index, fold_num, pos_sentence, neg_sentence):
"""
Divide the dataset into training set and test set by cross validation method
"""
if fold_index >= fold_num:
print "error when dividing the dataset in cross validation"
return None
size = len(pos_sentence)
fold_size = int(size / fold_num)
if fold_index == fold_size - 1:
end_index = size
else:
end_index = fold_size * (fold_index + 1)
start_index = fold_size * fold_index
training_input = pos_sentence[:start_index] + pos_sentence[end_index:] + neg_sentence[:start_index] + neg_sentence[end_index:]
test_input = pos_sentence[start_index:end_index] + neg_sentence[start_index:end_index]
training_output = [1] * (size - (end_index - start_index)) + [-1] * (size - (end_index - start_index))
test_output = [1] * (end_index - start_index) + [-1] * (end_index - start_index)
return (training_input, training_output, test_input, test_output)
def transform_dataset(self, fold_index, fold_num, polarity_sents):
"""
Convert the form of the dataset into different list like X_train, etc and add the bigrams for each sentence
"""
(pos_sentence, neg_sentence) = self.extract_sentence(polarity_sents)
(training_input, training_output, test_input, test_output) = self.divide_dataset(fold_index, fold_num, pos_sentence, neg_sentence)
self.Y_train = training_output
self.Y_test = test_output
for sentence in training_input:
instance = {}
for i in range(len(sentence)):
word = sentence[i]
self.word_features.add(word)
instance[word] = 1
if i == 0:
continue
bigram = (sentence[i - 1], word)
self.word_features.add(bigram)
instance[bigram] = 1
self.X_train.append(instance)
for sentence in test_input:
instance = {}
for i in range(len(sentence)):
word = sentence[i]
instance[word] = 1
if i == 0:
continue
bigram = (sentence[i - 1], word)
instance[bigram] = 1
self.X_test.append(instance)
def filter_dataset(self, num):
"""
filtering the words in the dataset
"""
word_list = filter_words(self, num)
self.word_features = set(word_list)
for sentence in self.X_train:
for word in sentence.keys():
if word not in self.word_features:
del sentence[word]
class Preprocess_Data_bigram_POS:
"""
Preprocess the dataset with splitting into training set and test set
The feature used here is the unigram, bigram (two neighboring words), and tags for each word
"""
def __init__(self):
self.X_train = []
self.Y_train = []
self.X_test = []
self.Y_test = []
self.word_features = set()
def extract_sentence(self, polarity_sents, vocab):
"""
Extract the sentences from the preprocessed dataset (polarity dataset)
"""
# Get the minimum value of the size
pos_size = len(polarity_sents.posSents)
neg_size = len(polarity_sents.negSents)
min_size = min(pos_size, neg_size)
pos_sentence = polarity_sents.posSents
neg_sentence = polarity_sents.negSents
pos_sentence = pos_sentence[:min_size]
neg_sentence = neg_sentence[:min_size]
new_pos_sentence = []
new_neg_sentence = []
for i in range(len(pos_sentence)):
sentence1 = pos_sentence[i]
tmp_list1 = [1 for j in range(len(sentence1))]
tmp_sentence1 = zip(sentence1, tmp_list1)
new_pos_sentence.append(tmp_sentence1)
sentence2 = neg_sentence[i]
tmp_list2 = [1 for j in range(len(sentence2))]
tmp_sentence2 = zip(sentence2, tmp_list2)
new_neg_sentence.append(tmp_sentence2)
pos_sentence_prep = PreprocessText(new_pos_sentence, vocab)
neg_sentence_prep = PreprocessText(new_neg_sentence, vocab)
return (pos_sentence_prep, neg_sentence_prep)
def divide_dataset(self, fold_index, fold_num, pos_sentence, neg_sentence):
"""
Divide the dataset into training set and test set by cross validation method
"""
if fold_index >= fold_num:
print "error when dividing the dataset in cross validation"
return None
size = len(pos_sentence)
fold_size = int(size / fold_num)
if fold_index == fold_size - 1:
end_index = size
else:
end_index = fold_size * (fold_index + 1)
start_index = fold_size * fold_index
training_input = pos_sentence[:start_index] + pos_sentence[end_index:] + neg_sentence[:start_index] + neg_sentence[end_index:]
test_input = pos_sentence[start_index:end_index] + neg_sentence[start_index:end_index]
training_output = [1] * (size - (end_index - start_index)) + [-1] * (size - (end_index - start_index))
test_output = [1] * (end_index - start_index) + [-1] * (end_index - start_index)
return (training_input, training_output, test_input, test_output)
def transform_dataset(self, fold_index, fold_num, polarity_sents, bigram_hmm, vocab):
"""
Convert the form of the dataset and add the unigrams, bigrams from the training set into word_feature
"""
(pos_sentence, neg_sentence) = self.extract_sentence(polarity_sents, vocab)
(training_input, training_output, test_input, test_output) = self.divide_dataset(fold_index, fold_num, pos_sentence, neg_sentence)
self.Y_train = training_output
self.Y_test = test_output
verb_words = set(['VB', 'VBD', 'VBG', 'VBN', 'VBP', 'VBZ'])
adjective_words = set(['JJ', 'JJR', 'JJS'])
noun_words = set(['NN', 'NNP', 'NNPS', 'NNS'])
pred_training_sents = bigram_hmm.Predict(training_input)
pred_test_sents = bigram_hmm.Predict(test_input)
for sentence in pred_training_sents:
instance = {}
for i in range(1, len(sentence)):
current_word = sentence[i][0]
current_tag = sentence[i][1]
self.word_features.add(current_word)
instance[current_word] = 1
prev_word1 = sentence[i - 1][0]
prev_tag1 = sentence[i - 1][1]
bigram = (prev_word1, current_word)
self.word_features.add(bigram)
instance[bigram] = 1
if i > 1:
prev_word0 = sentence[i - 2][0]
prev_tag0 = sentence[i - 2][1]
if prev_tag0 in verb_words and prev_tag1 in adjective_words and current_tag in noun_words:
trigram = (prev_word0, prev_word1, current_word)
instance[trigram] = 1
self.X_train.append(instance)
for sentence in pred_test_sents:
instance = {}
for i in range(1, len(sentence)):
current_word = sentence[i][0]
current_tag = sentence[i][1]
self.word_features.add(current_word)
instance[current_word] = 1
prev_word1 = sentence[i - 1][0]
prev_tag1 = sentence[i - 1][1]
bigram = (prev_word1, current_word)
self.word_features.add(bigram)
instance[bigram] = 1
if i > 1:
prev_word0 = sentence[i - 2][0]
prev_tag0 = sentence[i - 2][1]
if prev_tag0 in verb_words and prev_tag1 in adjective_words and current_tag in noun_words:
trigram = (prev_word0, prev_word1, current_word)
instance[trigram] = 1
self.X_test.append(instance)
def filter_dataset(self, num):
"""
filtering the words in the dataset
"""
word_list = filter_words(self, num)
self.word_features = set(word_list)
for sentence in self.X_train:
for word in sentence.keys():
if word not in self.word_features:
del sentence[word]
"""
baseline algorithm:
Use the words in opinion-lexicon-English to determine whether the sentence is positive or negative
"""
# build the dictionary of the positive words and negative words
path = "opinion-lexicon-English/"
pos_filename = "positive-words.txt"
neg_filename = "negative-words.txt"
filename = path + pos_filename
with open(filename, 'r') as f:
lines = f.readlines()
pos_lexicons = set()
for line in lines:
if line.startswith(";"):
continue
word = line.strip()
pos_lexicons.add(word)
filename = path + neg_filename
with open(filename, 'r') as f:
lines = f.readlines()
neg_lexicons = set()
for line in lines:
if line.startswith(";"):
continue
word = line.strip()
neg_lexicons.add(word)
def baseline_algorithm(pos_lexicons, neg_lexicons, test_input):
"""
use the lexical ratio to determine whether it is negative or postive
"""
pred_labels = []
for i in range(len(test_input)):
sentence = test_input[i].keys()
pos_count = 0
neg_count = 0
for word in sentence:
if word in pos_lexicons:
pos_count += 1
elif word in neg_lexicons:
neg_count += 1
else:
continue
if pos_count >= neg_count:
pred_labels.append(1)
else:
pred_labels.append(-1)
return pred_labels
def calculate_confusionMatrix(pred_labels, labels):
"""
Build the confusion matrix according to the prediction result of the baseline algorithm
"""
confusionMatrix = defaultdict(float)
for i in range(len(labels)):
if labels[i] == 1:
if pred_labels[i] == 1:
confusionMatrix['TP'] += 1.0
elif pred_labels[i] == -1:
confusionMatrix['FN'] += 1.0
else:
continue
else:
if pred_labels[i] == 1:
confusionMatrix['FP'] += 1.0
elif pred_labels[i] == -1:
confusionMatrix['TN'] += 1.0
else:
continue
return confusionMatrix
def evaluation(confusionMatrix):
"""
Evaluate the algorithm performance from the confusion matrix
"""
total = sum(confusionMatrix.values())
TP = confusionMatrix['TP']
TN = confusionMatrix['TN']
FP = confusionMatrix['FP']
FN = confusionMatrix['FN']
accuracy = (TP + TN) / float(total)
cc = TP * TN - FP * FN
tmp = sqrt((TP + FN) * (TP + FP) * (TN + FP) * (TN + FN))
cc = float(cc) / float(tmp)
return (accuracy, cc)
"""
Training the dataset with naive bayes model
"""
class Multinomial_NaiveBayesModel:
"""
Multinomial naive bayes model:
Use the words in dataset to calcualte the prior probability
"""
def __init__(self):
self.prior = defaultdict(float) #prior probaility p(c) = count(c) / total_count
self.cond_prob = defaultdict(float) # conditional probability: p(word|c) = (count(c, word) + 1) / (count(c) + |v|)
self.vocabulary = set()
self.total_word_count = 0.0
self.label_word_count = defaultdict(float) # count(c) key: label, value: number of words
self.tuple_word_count = defaultdict(float) # count(c, word) key: (label, word), value: number of words
def train(self, dataset):
self.vocabulary = dataset.word_features
training_input = dataset.X_train
training_output = dataset.Y_train
# Count the frequency of the label and word
for i in range(len(training_input)):
label = training_output[i]
sentence = training_input[i].keys()
for word in sentence:
if word not in self.vocabulary:
continue
self.total_word_count += 1.0
self.label_word_count[label] += 1.0
item = (label, word)
self.tuple_word_count[item] += 1.0
# Calculate the logaritmic value of probability
label_set = set(training_output)
for label in label_set:
self.prior[label] = log(self.label_word_count[label] / self.total_word_count)
for word in self.vocabulary:
item = (label, word)
self.cond_prob[item] = log((self.tuple_word_count[item] + 1.0) / (self.label_word_count[label] + float(len(self.vocabulary))))
self.check_disribution()
return
def check_disribution(self):
"""
Check the distribution of the probability before prediction to avoid using wrong models
"""
# Check the total probability
assert(self.total_word_count == (self.label_word_count[1] + self.label_word_count[-1])), "distribution of total is incorrect"
# Check the probability of each label
label_set = set(self.label_word_count.keys())
for label in label_set:
num = 0.0
for word in self.vocabulary:
item = (label, word)
num += self.tuple_word_count[item]
assert(num == self.label_word_count[label]), "distribution of single label is not correct"
def classify(self, input):
pred_output = []
for sentence in input:
max_prob = 0.0
pred_label = -1
for label in [-1, 1]:
pred_prob = self.prior[label]
for word in sentence.keys():
item = (label, word)
if item not in self.cond_prob:
continue
tmp_prob = self.cond_prob[item]
pred_prob += tmp_prob
pred_prob = exp(pred_prob)
if pred_prob > max_prob:
max_prob = pred_prob
pred_label = label
pred_output.append(pred_label)
return pred_output
class Bernoulli_NaiveBayesModel:
"""
Bernoulli naive bayes model:
Use the words in each sentence to calcualte the prior probability
"""
vocabulary = set() # set of words in the training set
total_sent_count = 0.0 # count(sents)
label_sent_count = defaultdict(float) # count(label) of sentences: count(label)
tuple_sent_count = defaultdict(float) # count(label, word) of sentences: count(label, word)
prior = defaultdict(float) # prior probability: p(c) = count(label) / count(sents)
cond_prob = defaultdict(float) # conditional probability: p(word|c) = (count(label, word) + 1) / (count(label) + 2)
def __init__(self):
self.vocabulary = set() # set of words in the training set
self.total_sent_count = 0.0 # count(sents)
self.label_sent_count = defaultdict(float) # count(label) of sentences: count(label)
self.tuple_sent_count = defaultdict(float) # count(label, word) of sentences: count(label, word)
self.prior = defaultdict(float) # prior probability: p(c) = count(label) / count(sents)
self.cond_prob = defaultdict(float) # conditional probability: p(word|c) = (count(label, word) + 1) / (count(label) + 2)
def train(self, dataset):
self.vocabulary = dataset.word_features
training_input = dataset.X_train
training_output = dataset.Y_train
for i in range(len(training_input)):
sentence = training_input[i].keys()
label = training_output[i]
self.label_sent_count[label] += 1.0
self.total_sent_count += 1.0
sentence_set = set()
for word in sentence:
if word not in self.vocabulary:
continue
item = (label, word)
if item in sentence_set:
continue
sentence_set.add(item)
self.tuple_sent_count[item] += 1.0
# Calculate the logaritmic value of probability
label_set = set(training_output)
for label in label_set:
self.prior[label] = log(self.label_sent_count[label] / self.total_sent_count)
for word in self.vocabulary:
item = (label, word)
self.cond_prob[item] = log((self.tuple_sent_count[item] + 1.0) / (self.label_sent_count[label] + 2.0))
self.check_disribution()
return
def check_disribution(self):
"""
Check the distribution of the model after training
"""
# Check the label
assert(self.total_sent_count == (self.label_sent_count[1] + self.label_sent_count[-1])), "distribution of labels are incorrect"
def classify(self, input):
pred_output = []
for sentence in input:
max_prob = 0.0
pred_label = -1
for label in [-1, 1]:
sentence_set = set()
pred_prob = self.prior[label]
for word in sentence.keys():
item = (label, word)
if item not in self.cond_prob:
continue
tmp_prob = self.cond_prob[item]
pred_prob += tmp_prob
pred_prob = exp(pred_prob)
if pred_prob > max_prob:
max_prob = pred_prob
pred_label = label
pred_output.append(pred_label)
return pred_output
"""
Use the informtion gain to filter features
"""
# Calculate entropy
def CalculateEntropy(output_set):
count = defaultdict(float)
for label in output_set:
count[label] += 1.0
entropy = 0.0