-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathWordPicker.cpp
220 lines (172 loc) · 4.84 KB
/
WordPicker.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
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
#include "stdafx.h"
using namespace std;
enum class DictType
{
Freq, OpenOffice
};
//////////////////////////////////////////////////////////////////////////
///
vector<wstring> ReadWordsFreq()
{
#ifdef _DEBUG
string dictPath = R"(data\freqrnc2011_crop.csv)";
#else
string dictPath = R"(data\freqrnc2011.csv)";
#endif
wifstream input(dictPath);
if (!input)
{
cerr << "Dictionary not found in \"" + dictPath + "\"!" << endl;
throw runtime_error("dictionary not found");
}
// An instance of codecvt is deleted by the locale object.
locale utf8(locale::empty(), new codecvt_utf8<wchar_t>);
input.imbue(utf8);
// Store frequency as a first field to use standard sorting order
typedef pair<double, wstring> Cell;
vector<Cell> table;
wregex mask(LR"(^(.+)\ts\t([0-9]+\.[0-9]+).*)");
wsmatch mr;
wstring line;
while (getline(input, line))
{
if (regex_match(line, mr, mask))
{
wstring word = mr[1].str();
double freq = boost::lexical_cast<double>(mr[2].str());
table.push_back(make_pair(freq, move(word)));
}
}
// Sort words by descending frequency
sort(table.begin(), table.end(), greater<>());
vector<wstring> words(table.size());
transform(table.begin(), table.end(), words.begin(),
[](const Cell& cell) { return move(cell.second); });
return words;
}
//////////////////////////////////////////////////////////////////////////
///
vector<wstring> ReadWordsOpenOffice()
{
#ifdef _DEBUG
string dictPath = R"(data\ru_RU_crop.dic)";
#else
string dictPath = R"(data\ru_RU.dic)";
#endif
wifstream input(dictPath);
if (!input)
{
cerr << "Dictionary not found in \"" + dictPath + "\"!" << endl;
throw runtime_error("dictionary not found");
}
// An instance of codecvt is deleted by the locale object.
locale utf8(locale::empty(), new codecvt_utf8<wchar_t>);
input.imbue(utf8);
vector<wstring> words;
wregex mask(L"([а-я]+)(/.*)?");
wsmatch mr;
wstring line;
while (getline(input, line))
{
if (regex_match(line, mr, mask))
{
wstring word = mr[1].str();
words.push_back(move(word));
}
}
return words;
}
vector<wstring> ReadWords(DictType type)
{
vector<wstring> words;
cout << "Reading dictionary..." << endl;
auto start = chrono::steady_clock::now();
switch (type)
{
case DictType::Freq:
words = ReadWordsFreq();
break;
case DictType::OpenOffice:
words = ReadWordsOpenOffice();
break;
default:
throw logic_error("Unknown dictionary type!");
}
auto finish = chrono::steady_clock::now();
cout << "Done " << words.size() << " words in " <<
chrono::duration_cast<chrono::milliseconds>(finish - start).count() << "ms" << endl;
return words;
}
//////////////////////////////////////////////////////////////////////////
///
void FindWordNumberPatterns(const vector<wstring>& in_words)
{
static const vector<wstring> digits = { L"н", L"к", L"л", L"т", L"ч", L"п", L"[шщ]", L"с", L"в", L"д" };
static const int count = digits.size();
static const wstring vowels = L"[аеёиоуыэюя]";
cout << endl;
wcout << L"Списки слов для мнемонического запоминания цифр через согласные:" << endl;
for (int i = 0; i < count; ++i)
{
wcout << i << ": " << digits[i] << endl;
}
cout << endl;
for (int i = 0; i < count; ++i)
{
for (int j = 0; j < count; ++j)
{
cout << "-------------------------------------------------------------------------------" << endl;
wcout << i << j << L" - " << digits[i] << digits[j] << ":" << endl;
// Words with first two consonant letters equal to selected
wregex mask(vowels + L"*" + digits[i] + vowels + L"*" + digits[j] + L".*");
for (const auto& word : in_words)
{
if (regex_match(word, mask))
{
wcout << word << endl;
}
}
cout << endl;
}
}
}
//////////////////////////////////////////////////////////////////////////
///
void MatchPattern(const vector<wstring>& in_words, const std::wstring& in_str)
{
// Words with first two consonant letters equal to selected
wregex mask(in_str);
wcout << L"Слова по регулярному выражению \"" << in_str << L"\":" << endl;
for (const auto& word : in_words)
{
if (regex_match(word, mask))
{
wcout << word << endl;
}
}
}
//////////////////////////////////////////////////////////////////////////
///
int _tmain(int argc, _TCHAR* argv[])
{
// Set locale to old school cp866 used for console IO
setlocale(LC_ALL, "Russian_Russia.866");
try
{
// Initialize words list
auto words = ReadWords(DictType::OpenOffice);
if (argc < 2)
{
FindWordNumberPatterns(words);
}
else
{
MatchPattern(words, argv[1]);
}
}
catch (std::exception&)
{
return 1;
}
return 0;
}