WeightedSumNode.hpp

Go to the documentation of this file.

/*==========================================================================
 * Copyright (c) 2004 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.lemurproject.org/license.html
 *
 *==========================================================================
 */

//
// WeightedSumNode
//
// 31 March 2004 -- tds
//
// Implements the InQuery #wsum operator.
//
// Note that this class transforms the probabilities
// out of log space and back into log space, which
// could cause a loss of precision.
//

#ifndef INDRI_WEIGHTEDSUMNODE_HPP
#define INDRI_WEIGHTEDSUMNODE_HPP

#include "indri/BeliefNode.hpp"
#include <vector>
#include "indri/greedy_vector"
#include "indri/ScoredExtentResult.hpp"
namespace indri
{
  namespace infnet
  {
    
    class WeightedSumNode : public BeliefNode {
    private:
      std::vector<BeliefNode*> _children;
      std::vector<double> _weights;
      indri::utility::greedy_vector<indri::api::ScoredExtentResult> _scores;
      indri::utility::greedy_vector<bool> _matches;
      std::string _name;

    public:
      WeightedSumNode( const std::string& name );

      lemur::api::DOCID_T nextCandidateDocument();
      void indexChanged( indri::index::Index& index );
      double maximumScore();
      double maximumBackgroundScore();

      const indri::utility::greedy_vector<indri::api::ScoredExtentResult>& score( lemur::api::DOCID_T documentID, indri::index::Extent &extent, int documentLength );
      void annotate( class Annotator& annotator, lemur::api::DOCID_T documentID, indri::index::Extent &extent );
      bool hasMatch( lemur::api::DOCID_T documentID );
      const indri::utility::greedy_vector<bool>& hasMatch( lemur::api::DOCID_T documentID, const indri::utility::greedy_vector<indri::index::Extent>& extents );
      void addChild( double weight, BeliefNode* child );
      const std::string& getName() const;

      virtual void setSiblingsFlag(int f);

    };
  }
}


#endif // INDRI_WEIGHTEDSUMNODE_HPP

---