diff options
| author | Paul Baltescu <pauldb89@gmail.com> | 2013-11-26 16:08:41 +0000 |
|---|---|---|
| committer | Paul Baltescu <pauldb89@gmail.com> | 2013-11-26 16:17:45 +0000 |
| commit | 8f65daa5bdaddaac24cea4df70049757536d6080 (patch) | |
| tree | 314b9fa170ef58cbff1c24136ae56ad8219f382f /extractor/precomputation.cc | |
| parent | 304103565d3b79cc9c98c1ee0356a8824fc982c2 (diff) | |
| parent | f528ac27dab11770f01595b043675dba2947a263 (diff) | |
Merge branch 'master' of github.com:pauldb89/cdec
Diffstat (limited to 'extractor/precomputation.cc')
| -rw-r--r-- | extractor/precomputation.cc | 3 |
1 files changed, 2 insertions, 1 deletions
diff --git a/extractor/precomputation.cc b/extractor/precomputation.cc index 3e58e2a9..b79daae3 100644 --- a/extractor/precomputation.cc +++ b/extractor/precomputation.cc @@ -91,6 +91,7 @@ vector<vector<int>> Precomputation::FindMostFrequentPatterns( } } + shared_ptr<DataArray> data_array = suffix_array->GetData(); // Extract the most frequent patterns. vector<vector<int>> frequent_patterns; while (frequent_patterns.size() < num_frequent_patterns && !heap.empty()) { @@ -98,7 +99,7 @@ vector<vector<int>> Precomputation::FindMostFrequentPatterns( int len = heap.top().second.second; heap.pop(); - vector<int> pattern(data.begin() + start, data.begin() + start + len); + vector<int> pattern = data_array->GetWordIds(start, len); if (find(pattern.begin(), pattern.end(), DataArray::END_OF_LINE) == pattern.end()) { frequent_patterns.push_back(pattern); |