String eTerm = eVocab_f2e.get(e);

      //      LOG.info("Pr("+eTerm+"|"+token+")="+probEF);

        // assuming our bilingual dictionary is learned from normally segmented text, but we want to use bigram tokenizer for CLIR purposes

        // then we need to convert the translations of each source token into a sequence of bigrams

        // we can distribute the translation probability equally to the each bigram

        if (bigramSegment) {

          String[] eTokens = docLangTokenizer.processContent(eTerm);

    // in SCFG rule such as a b X1 X2 c --> X1 d e X2 f, we want to find out the src/trg tokens that are aligned to some trg/src token, ignoring the X variable

    // we can then decide if we want to include it as a multi-token phrase in our query representation based on various heuristics (e.g., only include if no X in between of tokens)

    String fPhrase = "";

    int f=0;

    for (; f < lhs.length; f++) {

      String fTerm = lhs[f];

      if (queryLangTokenizer.isStopWord(fTerm) || fTerm.matches("\\[X,\\d+\\]") || fTerm.matches("<s>") || fTerm.matches("</s>")) {

        continue;

      }

      srcTokenCnt.increment(fTerm);

      sourceTokenIds.add(f);

      if (isPassThrough){

      }else {

        ids = one2manyAlign.get(f);

      }

        continue;

      }

      // find phrase in LHS and match to phrase in RHS

      if (isMany2Many) {

        fPhrase += fTerm + " ";

        targetTokenIds = targetTokenIds.mergeNoDuplicates(ids);       

      }

      String eTerm = null;

      for (int e : ids) {

        eTerm = rhs[e];

        // assumption: if this is pass-through rule, re-stem token in doc-language

        if (isPassThrough || (unknownWords != null && unknownWords.contains(fTerm))) {

          eTerm = stemmed2Stemmed.get(eTerm);

        }

        if (eTerm == null || docLangTokenizer.isStopWord(eTerm)) {

          //          LOG.info("Skipped trg token " + eTerm);

          eTerm = null;

          continue;     

        }

        bagOfTargetTokens.add(eTerm);

        if (isOne2Many <= 1) {

          if (probDist.containsKey(fTerm)) {

            HMapSFW eToken2Prob = probDist.get(fTerm);

            eToken2Prob.increment(eTerm, weight);

          }else {

            HMapSFW eToken2Prob = new HMapSFW();

            eToken2Prob.put(eTerm, weight);

            probDist.put(fTerm, eToken2Prob);

          }

        }

      }

      if (isOne2Many == 2) {

        // if ids.size() > 1 eTerm is a multi-token expression

        // even if eTerm is overwritten here, we need to do above loop to update bagOfTargetTokens

          eTerm = isConsecutiveWithStopwords(ids, rhs, docLangTokenizer);     // <---- heuristic

        }

        // no proper translation on target-side (e.g., stopword OR non-consecutive multi-word translation), let's skip

        if (eTerm == null) {

      int f = Integer.parseInt(alPair[0]);

      int e = Integer.parseInt(alPair[1]);

      if(!one2manyAlign.containsKey(f)){

      }

      one2manyAlign.get(f).add(e);

    }

    // for each source token id, sort ids of its translations in ascending order

    for(Integer f : one2manyAlign.keySet()) {

      one2manyAlign.put(f, lst);

    }

    return one2manyAlign;

  }

      // Remember, token position is numbered started from one...

      if (positions.containsKey(term)) {

        positions.get(term).add(i + 1);

      } else {

        positions.put(term, l);

      }

    }

    int doclength = 0;

    Iterator<Map.Entry<String, ArrayListOfInts>> it = positions.entrySet().iterator();

    Map.Entry<String, ArrayListOfInts> e;

    while (it.hasNext()) {

      e = it.next();

      positionsList = e.getValue();

      // We're storing tfs as shorts, so check for overflow...

        // There are a few ways to handle this... If we're getting such a high tf, then it most

        // likely means that this is a junk doc.

        LOG.warn("Error: tf of " + e.getValue()

            + " will overflow max short value. docno=" + doc.getDocid() + ", term="

            + e.getKey());

        it.remove();

      } else {

      }

    }

    if ( positions.size() == 0 ) {

      return positions;

    }

    return positions;

  }

    int size = 100000;

    Random r = new Random();

    double[] doubles = new double[size];

    for (int i = 0; i < size; i++) {

      int k = r.nextInt(size);

      doubles[i] = k + 0.1;

    }

    for (int i = 0; i < size; i++) {

      assertEquals(doubles[i], v, 0.0);

    }

  }

    int size = 100000;

    Random r = new Random();

    double[] doubles = new double[size];

    for (int i = 0; i < size; i++) {

      int k = r.nextInt(size);

      doubles[i] = k + 0.1;

    }

    for (int i = 0; i < size; i++) {

    }

    for (int i = 0; i < size; i++) {

      assertEquals(doubles[i] + 1.0, v, 0.0);

    }

  }

  }

  @Test

  public void testBasic() throws IOException {

    double value;

    assertTrue(value == 5.0);

    assertTrue(value == 22.0);

  }

  }

  @Test

  public void testPlus() throws IOException {

    m1.plus(m2);

    assertEquals(m1.size(), 3);

    assertTrue(m1.get(1) == 9);

  }

  @Test

  public void testDot() throws IOException {

    double s = m1.dot(m2);

    assertTrue(s == 10.93);

  }

  }

  @Test

  public void testLengthAndNormalize() throws IOException {

  }