|
Joshua
open source statistical hierarchical phrase-based machine translation system
|
Public Member Functions | |
| HyperEdge (Rule rule, double bestDerivationLogP, Double transitionLogP, List< HGNode > antNodes, SourcePath srcPath) | |
| Rule | getRule () |
| SourcePath | getSourcePath () |
| List< HGNode > | getAntNodes () |
| double | getTransitionLogP (boolean forceCompute) |
| void | setTransitionLogP (double transitionLogP) |
Public Attributes | |
| double | bestDerivationLogP = Double.NEGATIVE_INFINITY |
Private Attributes | |
| Double | transitionLogP = null |
| Rule | rule |
| SourcePath | srcPath = null |
| List< HGNode > | antNodes = null |
this class implement Hyperedge
| joshua.decoder.hypergraph.HyperEdge.HyperEdge | ( | Rule | rule, |
| double | bestDerivationLogP, | ||
| Double | transitionLogP, | ||
| List< HGNode > | antNodes, | ||
| SourcePath | srcPath | ||
| ) |
| double joshua.decoder.hypergraph.HyperEdge.getTransitionLogP | ( | boolean | forceCompute | ) |
| void joshua.decoder.hypergraph.HyperEdge.setTransitionLogP | ( | double | transitionLogP | ) |
List<HGNode> joshua.decoder.hypergraph.HyperEdge.antNodes = null [private] |
If antNodes is null, then this edge corresponds to a rule with zero arity. Aslo, the nodes appear in the list as per the index of the Foreign side non-terminal
| double joshua.decoder.hypergraph.HyperEdge.bestDerivationLogP = Double.NEGATIVE_INFINITY |
the 1-best logP of all possible derivations: best logP of ant hgnodes + transitionlogP
Rule joshua.decoder.hypergraph.HyperEdge.rule [private] |
SourcePath joshua.decoder.hypergraph.HyperEdge.srcPath = null [private] |
Double joshua.decoder.hypergraph.HyperEdge.transitionLogP = null [private] |
this remembers the stateless + non_stateless logP assocated with the rule (excluding the best-logP from ant nodes)