Tanl Linguistic Pipeline

tag/Tanlpos/linear_interpolated_lm.h

/*
**  Tanl
**  tag/TanlPos/linear_interpolated_lm.h
**  ----------------------------------------------------------------------
**  Copyright (c) 2005  Giuseppe Attardi (attardi@di.unipi.it).
**  ----------------------------------------------------------------------
**
**  This file is part of Tanl.
**
**  Tanl is free software; you can redistribute it and/or modify it
**  under the terms of the GNU General Public License, version 3,
**  as published by the Free Software Foundation.
**
**  Tanl is distributed in the hope that it will be useful,
**  but WITHOUT ANY WARRANTY; without even the implied warranty of
**  MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.  See the
**  GNU General Public License for more details.
**
**  You should have received a copy of the GNU General Public License
**  along with this program.  If not, see <http://www.gnu.org/licenses/>.
**  ----------------------------------------------------------------------
*/

#ifndef Tanl_POS_linear_interpolated_lm_H
#define Tanl_POS_linear_interpolated_lm_H

#include "serialization.h"

// standard
#include <tr1/unordered_map>
#include <vector>
#include <stdexcept>

namespace Tanl { namespace POS {
    
class ProbError : public std::runtime_error {
public:
    ProbError(const std::string& s)
    : std::runtime_error(s)
    { }
};

template <class CT>
struct Context
{
  typedef std::tr1::unordered_map<int, Context<CT>*>    CMap;   // context map
  typedef std::tr1::unordered_map<CT, double>   WordFreq;       // word map
    
  unsigned      freq;           
  CMap          childs;         
  WordFreq      words;          

  Context() :
    freq(0)
  { }

  ~Context()
  {
    typename CMap::iterator it = childs.begin();
    for (; it != childs.end(); ++it)
      delete it->second;
  }
    
  void          serialize(std::ostream &out);
    
  void          serialize(std::istream &in);

  void          add_word(std::vector<int>::const_iterator context, int n, CT& word);
    
  WordFreq&     get_words() { return words; }
  unsigned      total_context_freq() { return freq; }
  size_t        word_count_at_context() { return words.size(); }
    
  std::vector<double> calculate_lambdas(int level);

  void          counts_to_prob(std::vector<double>& lambdas);

  double        wordprob(CT const& word, std::vector<int>& context);
    
private:
  void          estimate_at_context(WordFreq& parent_words,
                                    std::vector<double>::const_iterator lambdas);

  void          adjust_lambdas(std::vector<double>& lambdas,
                               std::vector<Context<CT>*>& context_nodes,
                               int max_level);
};

template <class CT>
struct ProbLM : public Context<CT>
{
    static const int bos = -1;
};
    
} // namespace POS
} // namespace Tanl

#include "linear_interpolated_lm.cpp"

#endif // Tanl_POS_linear_interpolated_lm_H

 

Copyright © 2005-2011 G. Attardi. Generated on 4 Mar 2011 by doxygen 1.6.1.