---

StructQryDocRep.hpp

Go to the documentation of this file.

/*==========================================================================
 * Copyright (c) 2002 University of Massachusetts.  All Rights Reserved.
 *
 * Use of the Lemur Toolkit for Language Modeling and Information Retrieval
 * is subject to the terms of the software license set forth in the LICENSE
 * file included with this software, and also available at
 * http://www.cs.cmu.edu/~lemur/license.html
 *
 *==========================================================================
*/

#ifndef _STRUCTQRYDOCREP_HPP
#define _STRUCTQRYDOCREP_HPP
#include "DocumentRep.hpp"
class StructQryDocRep : public DocumentRep {
public:
  StructQryDocRep(int docID, double *idfValue, int docLength, int docCount,
                  double docLengthAverage, double db) : 
    DocumentRep(docID), did(docID), idf(idfValue), end(docLength),
    docEnd(docLength), size(docLength), start(0),
    dla(docLengthAverage), defaultBelief(db) {
    oneMinusDB = 1 - defaultBelief;
    denom = log(docCount + 1.0);
    numer = docCount + 0.5;
  }
  virtual ~StructQryDocRep() {}
  virtual double termWeight(int termID, DocInfo *info) { return 0;}
  virtual double termWeight(int termID, double dtf, int df) {
    if (idf)
      return beliefScore(dtf, idf[termID]);
    else
      return beliefScore(dtf, computeIdfScore(df));
  }
  virtual double scoreConstant() { return 0;}

  void startPassageIteration(int sz) {
    size = sz;
    increment = size/2;
    start = 0;
    end = size < docEnd ? size : docEnd;
  }
  bool hasMorePassage() {
    // still some terms in the list.
    return(start < docEnd);
  }

  void nextPassage() {
    if(start + increment < docEnd)
      start += increment;
    else
      start = docEnd;
    end = (start + size) < docEnd ? (start + size) : docEnd;
  }

  double computeIdfScore(double df) {
    return log(numer/df)/denom;
  }

  double beliefScore(double df, double idf) {
    return (defaultBelief + oneMinusDB
            * (df / (df + 0.5 + 1.5* ((end - start)/dla))) * idf);
  }

  int did;
  int start; 
  int end;

private:
  double *idf;
  int size; 
  int increment; 
  int docEnd;  
  double dla;
  double numer, denom;
  double defaultBelief, oneMinusDB;
};
#endif

---