#include #include #include #include #include #include #include "fast.h" #include "cleanup.h" static AikSaurusFAST Thesaurus; void maximizeClass(vector& meaning, int place) { const vector& synonyms = Thesaurus.getSynonyms( meaning[place] ); for(int i = 0;i < synonyms.size();++i) { const vector& subsyns = Thesaurus.getSynonyms( synonyms[i] ); sort( meaning.begin(), meaning.end() ); if (includes(subsyns.begin(), subsyns.end(), meaning.begin(), meaning.end())) { meaning.push_back(synonyms[i]); } } } bool wordAlreadyInClass( const vector >& classes, const string& word) { for(int i = 0;i < classes.size();++i) { for(vector::const_iterator x = classes[i].begin(); x != classes[i].end(); ++x) { if ((*x) == word) return true; } } return false; } int equivs(const string& word) { const vector& topsyns = Thesaurus.getSynonyms(word); vector< vector > classes; for(int i = 0;i < topsyns.size();++i) { if (!wordAlreadyInClass(classes, topsyns[i])) { classes.push_back(vector()); int index = classes.size() - 1; classes[index].reserve(10); classes[index].push_back(word); classes[index].push_back(topsyns[i]); maximizeClass(classes[index], 1); sort(classes[index].begin(), classes[index].end()); // copy(classes[index].begin(), classes[index].end(), // ostream_iterator(cout, " ")); // cout << endl; } } vector< vector > output; cleanup(classes, output); for(int i = 0;i < output.size();++i) { copy(output[i].begin(), output[i].end(), ostream_iterator(cout, " ")); cout << endl; } return 0; } #include int main() { ifstream fin("thesaurus.in"); time_t start = time(NULL); while(start == time(NULL)); start = time(NULL); string index, shit; while(fin >> index >> shit) { cout << "# " << index << endl; equivs(index); } time_t end = time(NULL); cout << "start = " << start << ", end = " << end << endl; cout << "elapsed = " << end - start << endl; return 0; }