libvspell/posgen.cpp

   1 #include "posgen.h"             // -*- tab-width: 2 mode: c++ -*-
   2
   3 using namespace std;
   4
   5 void Generator::init(const Sentence &_st)
   6 {
   7         int nr_misspelled,len;
   8         nr_misspelled = 3;              // REMEMBER THIS NUMBER
   9         len = _st.get_syllable_count();
  10         pgen.init(len,nr_misspelled);
  11 }
  12
  13 void Generator::done()
  14 {
  15         pgen.done();
  16 }
  17
  18 /**
  19         Generate every possible 3-misspelled-positions.
  20         Then call WFST::generate_misspelled_words.
  21  */
  22
  23 bool Generator::step(vector<uint> &_pos,uint &_len)
  24 {
  25         return pgen.step(_pos,_len);
  26 }
  27
  28 void PosGen::init(uint len_,uint n_)
  29 {
  30         n = n_;
  31         len = len_;
  32
  33         pos.resize(n);
  34         run = true;
  35
  36         // initialize
  37         for (i = 0;i < n;i ++)
  38                 pos[i] = i;
  39
  40         i = 0;
  41 }
  42
  43 void PosGen::done()
  44 {
  45 }
  46
  47 /**
  48         Generate every possible 3-misspelled-positions.
  49         Then call WFST::generate_misspelled_words.
  50  */
  51
  52 bool PosGen::step(vector<uint> &_pos,uint &_len)
  53 {
  54         while (run) {
  55
  56                 // move to the next counter
  57                 if (i+1 < n && pos[i] < len) {
  58                         i ++;
  59
  60                         // do something here with misspelled_pos[i]
  61                         _pos = pos;
  62                         _len = i;
  63                         return true;
  64                 }
  65
  66                 // the last counter is not full
  67                 if (pos[i] < len) {
  68                         // do something here with misspelled_pos[nr_misspelled]
  69                         _pos = pos;
  70                         _len = n;
  71                         pos[i] ++;
  72                         return true;
  73                 }
  74
  75                 // the last counter is full, step back
  76                 while (i >= 0 && pos[i] == len) i --;
  77                 if (i < 0)
  78                         run = false;
  79                 else {
  80                         pos[i] ++;
  81                         for (ii = i+1;ii < n;ii ++)
  82                                 pos[ii] = pos[ii-1]+1;
  83                 }
  84         }
  85         return false;
  86 }
  87