-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathfeaturemanager.cpp
181 lines (166 loc) · 6.51 KB
/
featuremanager.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
//
// Created by ngs on 13/06/2018.
//
#include "featuremanager.h"
#include <iostream>
#include <tuple>
#include <fstream>
#include <sstream>
Feature::Feature(std::vector<std::string> *ptr_observ_vector, std::vector<std::string> *ptr_tag_vector,
std::map<std::string, int> *ptr_x_corpus_map, std::map<int,std::string> *ptr_tag_map_reverse, int num_of_seq) {
ptr_feature_map_ = new std::unordered_map<std::pair<int ,int >, int,boost::hash<std::pair<int, int>>>;
ptr_reverse_feature_map_ = new std::unordered_map<int, std::pair<int ,int >>;
CreateFeatureMap(ptr_observ_vector, ptr_tag_vector, ptr_x_corpus_map, ptr_tag_map_reverse, num_of_seq);
ptr_w_vector_ = new std::vector<double>(ptr_feature_map_->size());
std::fill(ptr_w_vector_->begin(),ptr_w_vector_->end(), 0.0);
//for test only
/*
double array[12] = {0.65,0.2,0.5,0.25,0.45,0.15,0.35,0.4,0.6,0.3,0.1,0.15};
for(int i=0; i<ptr_feature_map_->size(); ++i){
(*ptr_w_vector_)[i] = array[i];
}
*/
}
Feature::Feature(const char *feature_file_name) {
ptr_feature_map_ = new std::unordered_map<std::pair<int ,int >, int,boost::hash<std::pair<int, int>>>;
ptr_reverse_feature_map_ = new std::unordered_map<int, std::pair<int ,int >>;
CreateFeatureMap(feature_file_name);
ptr_w_vector_ = new std::vector<double>(ptr_feature_map_->size());
std::fill(ptr_w_vector_->begin(),ptr_w_vector_->end(),0);
}
Feature::~Feature() {
delete ptr_w_vector_;
delete ptr_feature_map_;
delete ptr_reverse_feature_map_;
}
//create feature map from feature file during test phase
void Feature::CreateFeatureMap(const char *feature_file_name) {
std::ifstream ifs(feature_file_name);
std::string str;
while(getline(ifs,str)){
std::stringstream ss(str);
int x;
int index = 0;
int data[3]; // data[0], data[1], data[2] are feature index, y_i_1(x_i) and y_i, respectively.
while(ss >> x){
data[index++] = x;
}
InsertFeature(std::make_pair(data[1],data[2]),&data[0],0,NULL,true);
}
}
//create feature map from training dataset during training phase.
void Feature::CreateFeatureMap(std::vector<std::string> *ptr_observ_vector, std::vector<std::string> *ptr_tag_vector,
std::map<std::string, int> *ptr_x_corpus_map,
std::map<int, std::string> *ptr_tag_map_reverse, int num_of_seq) {
std::ofstream *ptr_of = new std::ofstream("featuremap.txt");
int index_offset = 0;
for (int i = 0; i < ptr_tag_map_reverse->size(); ++i) {
for (int j = 0; j < ptr_tag_map_reverse->size(); ++j) {
InsertFeature(std::make_pair(i,j),&index_offset, 0, ptr_of,false);
}
}
feature_size_edge_ = index_offset;
index_offset = 0;
int cout = 0;
for (int i = 0; i < ptr_observ_vector->size(); ++i) {
cout++;
for (int j = 0; j < ptr_tag_map_reverse->size(); ++j) {
int ob1 = ptr_x_corpus_map->find((*ptr_observ_vector)[i])->second + FEATURE_CODE_OFFSET;
InsertFeature(std::make_pair(ob1, j), &index_offset, feature_size_edge_, ptr_of, false);
}
}
feature_size_node_= index_offset;
index_offset = 0;
//for start_node
//int start_node_flg = START_NODE_FLAG;
for (int seq_no = 0; seq_no < num_of_seq; ++seq_no) {
for (int k = 0; k < ptr_tag_map_reverse->size() ; ++k) {
InsertFeature(std::make_pair(START_NODE_FLAG-seq_no,k),&index_offset,feature_size_edge_+feature_size_node_, ptr_of, false);
}
// start_node_flg--;
}
//for stop_node
//int stop_node_flg = STOP_NODE_FLAG;
for (int seq_no = 0; seq_no < num_of_seq; ++seq_no) {
for (int k = 0; k < ptr_tag_map_reverse->size(); ++k) {
InsertFeature(std::make_pair(k, STOP_NODE_FLAG-seq_no), &index_offset, feature_size_edge_ + feature_size_node_, ptr_of, false);
}
//stop_node_flg--;
}
feature_size_start_stop_ = index_offset;
feature_size_ = feature_size_edge_ + feature_size_node_ + feature_size_start_stop_;
delete ptr_of;
}
void Feature::InsertFeature(std::pair<int, int> feature_pair, int *index, int offset, std::ofstream *ptr_of, bool istest) {
if (ptr_feature_map_->find(feature_pair) == ptr_feature_map_->end()) {
ptr_reverse_feature_map_->insert(std::make_pair((*index) + offset, feature_pair));
ptr_feature_map_->insert(std::make_pair(feature_pair, (*index) + offset));
//write file in training phase
if(!istest){
(*ptr_of) << std::to_string((*index) + offset) + " " + std::to_string(feature_pair.first) + " " +
std::to_string(feature_pair.second);
(*ptr_of) << std::endl;
(*index)++;
}
}
}
/*
void Feature::CalcCost(Node *ptrnode) {
double cost = DEFAULT_COST_VALUE;
int observation = ptrnode->GetX();
int y = ptrnode->GetY();
int index = GetFeatureIndex(std::make_pair(observation,y));
if(FEATURE_NO_EXIST != index){
double weight = (*ptr_w_vector_)[index];
// cost = exp(weight);
cost = weight;
} else{
// std::cout << "index error"<<std::endl;
}
ptrnode->SetCost(cost);
}
void Feature::CalcCost(Path *ptrpath) {
double cost = DEFAULT_COST_VALUE;
int lnodeY = ptrpath->GetLNode()->GetY();
int rnodeY = ptrpath->GetRNode()->GetY();
int index = GetFeatureIndex(std::make_pair(lnodeY, rnodeY));
if (FEATURE_NO_EXIST != index) {
//for the pair like (START, y)
double weight = (*ptr_w_vector_)[index];
// cost = exp(weight);
cost = weight;
} else{
// std::cout << "index error"<<std::endl;
}
ptrpath->SetCost(cost);
}
*/
std::vector<double>* Feature::GetWeightVector() {
return ptr_w_vector_;
}
int Feature::GetFeatureSize() {
return feature_size_;
}
/*
std::unordered_map<std::pair<int, int>, int>* Feature::GetFeatureMap() {
return ptr_feature_map_;
}
std::unordered_map<int, std::pair<int, int>> * Feature::GetReverseFeatureMap() {
return ptr_reverse_feature_map_;
}
*/
std::unordered_map<std::pair<int ,int >, int,boost::hash<std::pair<int, int>>>* Feature::GetFeatureMap() {
return ptr_feature_map_;
}
std::unordered_map<int, std::pair<int ,int >> * Feature::GetReverseFeatureMap() {
return ptr_reverse_feature_map_;
}
void Feature::SetWeightVector(int index, double weight) {
(*ptr_w_vector_)[index] = weight;
}
int Feature::GetFeatureSizeEdge() {
return feature_size_edge_;
}
int Feature::GetFeatureSizeNode() {
return feature_size_node_;
}