-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathDistributions.java
More file actions
97 lines (82 loc) · 2.64 KB
/
Copy pathDistributions.java
File metadata and controls
97 lines (82 loc) · 2.64 KB
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
/*
* File: Distributions.java
* Author: Jackson Davenport
*
* Class to manage, hold, and modify the distributions. The distributions are
* comprised of two hashmaps. The first is a hashmap of the word, the counts,
* and additionally the total count to determine the distributions.
* The second is is the hashmap of hashmaps for the bigram distribution.
*/
import java.io.Serializable;
import java.util.Hashtable;
public class Distributions implements Serializable{
public Hashtable<String, Integer> unigramDistribution;
public Hashtable<String, BigramElement> bigramDistribution;
public String subreddit;
public int totalUni;
public Distributions(String s){
bigramDistribution = new Hashtable<String, BigramElement>();
unigramDistribution = new Hashtable<String, Integer>();
subreddit = s;
totalUni = 0;
}
public Distributions(String subreddit, int totalUni, Hashtable<String, Integer> unigramDistribution, Hashtable<String, BigramElement> bigramDistribution){
this.subreddit = subreddit;
this.totalUni = totalUni;
this.unigramDistribution = unigramDistribution;
this.bigramDistribution = bigramDistribution;
}
public void bigramAddWord(String wordPrev, String wordBase){
// Bigram handling
if(!bigramDistribution.containsKey(wordBase)){
bigramDistribution.put(wordBase, new BigramElement(wordBase));
}
bigramDistribution.get(wordBase).addWord(wordPrev);
}
public void bigramAddWord(String wordPrev, String wordBase, int count){
// Bigram handling
if(!bigramDistribution.containsKey(wordBase)){
bigramDistribution.put(wordBase, new BigramElement(wordBase));
}
bigramDistribution.get(wordBase).addWord(wordPrev, count);
}
public void unigramAddWord(String wordBase){
// Unigram handling
if(!unigramDistribution.containsKey(wordBase)){
unigramDistribution.put(wordBase, 1);
}
else{
unigramDistribution.put(wordBase, unigramDistribution.get(wordBase) + 1);
}
}
public void unigramAddWord(String wordBase, int count){
// Unigram handling
if(!unigramDistribution.containsKey(wordBase)){
unigramDistribution.put(wordBase, count);
}
else{
unigramDistribution.put(wordBase, unigramDistribution.get(wordBase) + count);
}
}
public void setTotalUnigramCount(int count){
totalUni = count;
}
public void incrementTotalUnigramCount(){
totalUni++;
}
/*
* Getter methods
*/
public Hashtable<String, BigramElement> getBigramDistribution(){
return bigramDistribution;
}
public Hashtable<String, Integer> getUnigramDistribution(){
return unigramDistribution;
}
public String getSubreddit(){
return subreddit;
}
public int getTotalUni(){
return totalUni;
}
}