mirror of
https://github.com/moses-smt/mosesdecoder.git
synced 2024-10-27 03:49:57 +03:00
47 lines
1.1 KiB
C++
47 lines
1.1 KiB
C++
// -*- c++ -*-
|
|
// Phrase scorer that rewards the number of phrase pair occurrences in a bitext
|
|
// with the asymptotic function j/(j+x) where x > 0 is a function
|
|
// parameter that determines the steepness of the rewards curve
|
|
// written by Ulrich Germann
|
|
|
|
#include "sapt_pscore_base.h"
|
|
#include <boost/dynamic_bitset.hpp>
|
|
|
|
namespace sapt {
|
|
|
|
// asymptotic provenance feature n/(n+x)
|
|
template<typename Token>
|
|
class
|
|
PScoreProvenance : public SingleRealValuedParameterPhraseScorerFamily<Token>
|
|
{
|
|
public:
|
|
|
|
virtual ~PScoreProvenance() {}
|
|
PScoreProvenance(std::string const& spec)
|
|
{
|
|
this->m_tag = "prov";
|
|
this->init(spec);
|
|
}
|
|
|
|
bool
|
|
isLogVal(int i) const { return false; }
|
|
|
|
void
|
|
operator()(Bitext<Token> const& bt,
|
|
PhrasePair<Token>& pp,
|
|
std::vector<float> * dest = NULL) const
|
|
{
|
|
if (!dest) dest = &pp.fvals;
|
|
size_t i = this->m_index;
|
|
BOOST_FOREACH(float const x, this->m_x)
|
|
(*dest).at(i++) = pp.joint/(x + pp.joint);
|
|
}
|
|
|
|
bool
|
|
allowPooling() const
|
|
{ return false; }
|
|
|
|
};
|
|
} // namespace sapt
|
|
|