LinearChainCTC.h 1.3 KB
Newer Older
Z
zhangjinchao01 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26
/* Copyright (c) 2016 Baidu, Inc. All Rights Reserve.

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. */

#pragma once

#include <vector>
#include "paddle/math/Matrix.h"

namespace paddle {

class LinearChainCTC {
public:
  LinearChainCTC(int numClasses, bool normByTimes);

  // Calculate the negative log probability as loss
27 28 29
  real forward(real* softmaxSeq,
               int softmaxSeqLen,
               int* labelSeq,
Z
zhangjinchao01 已提交
30 31 32
               int labelSeqLen);

  // calculate the gradient
33 34 35
  void backward(real* softmaxSeq,
                real* softmaxSeqGrad,
                int* labelSeq,
Z
zhangjinchao01 已提交
36 37 38 39 40 41 42 43 44 45 46 47 48 49 50
                int labelSeqLen);

protected:
  int numClasses_, blank_, totalSegments_, totalTime_;
  bool normByTimes_;
  bool isInvalid_;

  MatrixPtr logActs_, forwardVars_, backwardVars_, gradTerms_;

  real logProb_;

  void segmentRange(int& start, int& end, int time);
};

}  // namespace paddle