edu.stanford.nlp.trees
Class DeepTree

java.lang.Object
  edu.stanford.nlp.trees.DeepTree

public class DeepTree
extends java.lang.Object

A tree combined with a map from subtree to SimpleMatrix vectors.

Author:

Richard Socher

Field Summary

static java.util.Comparator<DeepTree>	DESCENDING_COMPARATOR A comparator that can be used with Collections.sort() that puts the highest scoring tree first
double	score

Constructor Summary

DeepTree(Tree tree, java.util.IdentityHashMap<Tree,org.ejml.simple.SimpleMatrix> vectors, double score)

Method Summary

double	getScore()
Tree	getTree()
java.util.IdentityHashMap<Tree,org.ejml.simple.SimpleMatrix>	getVectors()
void	setScore(double score)
void	setTree(Tree tree)
void	setVectors(java.util.IdentityHashMap<Tree,org.ejml.simple.SimpleMatrix> vectors)

Methods inherited from class java.lang.Object

clone, equals, finalize, getClass, hashCode, notify, notifyAll, toString, wait, wait, wait

Field Detail

score

public double score

DESCENDING_COMPARATOR

public static final java.util.Comparator<DeepTree> DESCENDING_COMPARATOR

A comparator that can be used with Collections.sort() that puts the highest scoring tree first

Constructor Detail

DeepTree

public DeepTree(Tree tree,
                java.util.IdentityHashMap<Tree,org.ejml.simple.SimpleMatrix> vectors,
                double score)

Method Detail

getTree

public Tree getTree()

setTree

public void setTree(Tree tree)

getVectors

public java.util.IdentityHashMap<Tree,org.ejml.simple.SimpleMatrix> getVectors()

setVectors

public void setVectors(java.util.IdentityHashMap<Tree,org.ejml.simple.SimpleMatrix> vectors)

getScore

public double getScore()

setScore

public void setScore(double score)