test_LinearChainCRF.cpp 2.2 KB
Newer Older
1
/* Copyright (c) 2016 PaddlePaddle Authors. All Rights Reserved.
Z
zhangjinchao01 已提交
2 3 4 5 6 7 8 9 10 11 12 13 14 15 16

Licensed under the Apache License, Version 2.0 (the "License");
you may not use this file except in compliance with the License.
You may obtain a copy of the License at

    http://www.apache.org/licenses/LICENSE-2.0

Unless required by applicable law or agreed to in writing, software
distributed under the License is distributed on an "AS IS" BASIS,
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
See the License for the specific language governing permissions and
limitations under the License. */

#include <gtest/gtest.h>
#include <vector>
X
Xin Pan 已提交
17
#include "paddle/legacy/gserver/layers/LinearChainCRF.h"
X
Xin Pan 已提交
18
#include "paddle/legacy/utils/Util.h"
Z
zhangjinchao01 已提交
19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38

using namespace paddle;  // NOLINT
using namespace std;     // NOLINT

static inline bool getNextSequence(vector<int>& seq, int numClasses) {
  for (auto& v : seq) {
    if (++v < numClasses) {
      return true;
    }
    v = 0;
  }
  return false;
}

TEST(LinearChainCRF, decoding) {
  const int numClasses = 4;
  CpuVector para(numClasses * (numClasses + 2));
  real* a = para.getData();
  real* b = para.getData() + numClasses;
  real* w = para.getData() + 2 * numClasses;
39
  LinearChainCRF crf(4, para.getData());
Z
zhangjinchao01 已提交
40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67
  for (int length : {1, 2, 3, 10}) {
    for (int tries = 0; tries < 10; ++tries) {
      CpuMatrix x(length, numClasses);
      x.randomizeUniform();
      para.randnorm(0, 2);
      vector<int> decodingResult(length);
      vector<int> bestResult(length);
      vector<int> testResult(length, 0);
      crf.decode(x.getData(), &decodingResult[0], length);
      real bestScore = -std::numeric_limits<real>::max();
      do {
        real score = a[testResult.front()] + b[testResult.back()];
        score += x.getElement(0, testResult.front());
        for (int k = 1; k < length; ++k) {
          score += x.getElement(k, testResult[k]) +
                   w[numClasses * testResult[k - 1] + testResult[k]];
        }
        if (score > bestScore) {
          bestScore = score;
          bestResult = testResult;
        }
      } while (getNextSequence(testResult, numClasses));
      for (int k = 0; k < length; ++k) {
        EXPECT_EQ(decodingResult[k], bestResult[k]);
      }
    }
  }
}