-
Notifications
You must be signed in to change notification settings - Fork 0
/
SpellingAssistantTool.cpp
138 lines (101 loc) · 2.19 KB
/
SpellingAssistantTool.cpp
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
#include <iostream>
#include <map>
#include <fstream>
#include<string>
using namespace std;
bool hammingish(string s, string s1);
pair<string, int> compare(string s, map<string, int> dictionary);
int main(int argc, char* argv[]){
string s1= argv[1];
fstream f(s1);
map<string, int> dict;
string word;
int counter;
while(!f.eof()) {
f >> word >> counter;
dict[word] = counter;
}
f.close();
map<string,int>::iterator it; //iterator for the map
string s;
while(cin >> s){
it = dict.find(s);
if (it != dict.end()) {
cout<<s<<" "<<dict[s]<<endl;
dict[s]=dict[s]+1;
}
else{
pair<string,int> output = compare(s,dict);
if(output.first=="-"){
dict[s]=1;
cout<<"-"<<endl;
}
else{
cout<<output.first<<" "<<output.second<<endl;
}
}
}
}
bool hammingish(string s, string s1){
int a=s.length(); //function to check for the edit distance
int b=s1.length();
if((a-b)>1){
return false;
}
else if((a-b)>1){
return false;
}
int hammingish=0;
int c=0;
int d=0;
while(c<a && d<b){
if(s[c]!=s1[d]){
if(hammingish==1){
return false;
}
if(a<b){
d=d+1;
}
else if(b<a){
c=c+1;
}
else{
c=c+1;
d=d+1;
}
hammingish=hammingish+1;
}
else {
c=c+1;
d=d+1;
}
}
if(c<a || d<b) {
hammingish=hammingish+1;
}
if(hammingish==1){
return true;
}
return false;
}
pair<string, int> compare(string s, map<string, int> dictionary){
map<string,int>::iterator it;
if(dictionary.count(s)==1){
pair<string, int> retVal = make_pair(s, dictionary[s]);
return retVal;
}
pair<string, int> temp = make_pair("-",0);
map<string, int> dict1;
for(it = dictionary.begin(); it != dictionary.end(); it++) {
if(hammingish(s, it->first) == true) {
dict1[it->first] = it->second;
}
}
for(it = dict1.begin(); it != dict1.end(); it++) {
if(it->second > temp.second){
temp.first=it->first;
temp.second=it->second;
}
}
return temp;
}