-
Notifications
You must be signed in to change notification settings - Fork 0
/
ngram_corpus.py
159 lines (127 loc) · 3.86 KB
/
ngram_corpus.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
# -*- coding: utf-8 -*-
"""
Created on Wed May 16 01:51:13 2018
@author: Panangam
"""
from ct_io import c_encode_es, c_decode_es
from util import Vividict
import logging
from nltk.corpus import gutenberg
from nltk.util import ngrams
import re
import json
import pickle
import numbers
from numpy import log
import math
logger = logging.getLogger('__name__')
corporaList = [gutenberg.raw()]
# n-agnostic ngram frequency tree
# implemented using a Vividict
# accessed
class NgramTree(Vividict):
def addUp(self):
if not isinstance(self['f'], numbers.Number):
self['f'] = 0
for branchKey in self:
if branchKey != 'f':
self['f'] += self[branchKey].addUp()
return self['f']
def divideAllWith(self, val):
self['f'] = self['f']/val
for branchKey in self:
if branchKey != 'f':
self[branchKey].divideAllWith(val)
def normalize(self):
self.divideAllWith(self['f'])
def addGram(self, gram):
branch = self
for c in gram:
branch = branch[c_encode_es(c)]
if not isinstance(branch['f'], numbers.Number):
branch['f'] = 1
else:
branch['f'] += 1
# receive either string or array gram
def getGramFreq(self, gram):
branch = self
for c in gram:
if isinstance(c, numbers.Number):
branch = branch[c]
else:
branch = branch[c_encode_es(c)]
if not isinstance(branch['f'], numbers.Number):
branch['f'] = 0
return branch['f']
else:
return branch['f']
def evaluateLogProb(self, phrase, n):
prob = -log(self.getGramFreq([phrase[0]])) + log(self.getGramFreq(phrase[:n-1]))
for i, c in enumerate(phrase[:-n]):
prob += log(self.getGramFreq(phrase[i:i+n])) - log(self.getGramFreq(phrase[i:i+n-1]))
return prob/(len(phrase)-n)
# using just gutenberg for now
def getNgramFreqTree(n, retrain=False):
filename = 'data/%dgram_tree.pickle'%n
if not retrain:
try:
with open(filename, 'rb') as fin:
print('Trained frequency for n=%d found; Reading data...'%n)
ngramtree = pickle.load(fin)
return ngramtree
except FileNotFoundError:
pass
print('Training frequency tree for n=%d...'%n)
ngramtree = NgramTree()
corpus = gutenberg.raw()
corpus = re.sub('[^a-z. ]',' ', corpus.lower())
corpus = ' '.join(corpus.split())
corpus_ngram = ngrams(corpus, n)
for gram in corpus_ngram:
ngramtree.addGram(gram)
ngramtree.addUp()
ngramtree.normalize()
with open(filename, 'wb') as fout:
pickle.dump(ngramtree, fout)
return ngramtree
# get n-gram frequency from a corpus
# use string as dictionary index
# assume character set of a-z, [period], and [space]
# using just gutenberg corpus
def getNgramFreqDict(n, retrain=False):
if not retrain:
try:
with open('data/%dgram_freq.json'%n) as fin:
print('Trained frequency for n=%d found; Reading data...'%n)
ngram_freq = json.load(fin)
return ngram_freq
except FileNotFoundError:
pass
print('Training frequency for n=%d...'%n)
# using whole gutenberg corpus
corpus = gutenberg.raw()
corpus = re.sub('[^a-z. ]',' ', corpus.lower())
corpus = ' '.join(corpus.split())
corpus_ngram = ngrams(corpus, n)
ngram_freq = {}
for gram in corpus_ngram:
key = ''.join(gram)
if key in ngram_freq:
ngram_freq[key] += 1
else:
ngram_freq[key] = 1
sum_count = sum([tup[1] for tup in ngram_freq.items()])
for k in ngram_freq.keys():
ngram_freq[k] = ngram_freq[k]/sum_count
with open('data/%dgram_freq.json'%n, 'w') as fout:
json.dump(ngram_freq, fout)
return ngram_freq
if __name__ == '__main__':
ngramtree = NgramTree()
ngramtree.addGram('abc')
ngramtree.addGram('abb')
ngramtree.addUp()
ngramtree.normalize()
print(ngramtree)
trigramTree = getNgramFreqTree(3, retrain=False)
print(trigram)