edu.stanford.nlp.parser.shiftreduce

Class CompoundUnaryTransition

java.lang.Object

edu.stanford.nlp.parser.shiftreduce.CompoundUnaryTransition

All Implemented Interfaces:

Transition, java.io.Serializable

public class CompoundUnaryTransition
extends java.lang.Object
implements Transition

Transition that makes a compound unary parse node in a partially finished tree. It potentially adds multiple unary layers to the current tree.

Author:

John Bauer

See Also:

Serialized Form

Field Summary

Fields

Modifier and Type	Field and Description
boolean	isRoot root transitions are illegal in the middle of the tree, naturally
java.lang.String[]	labels labels[0] is the top of the unary chain.

Constructor Summary

Constructors

Constructor and Description
CompoundUnaryTransition(java.util.List<java.lang.String> labels, boolean isRoot)

Method Summary

Modifier and Type	Method and Description
State	apply(State state) Add a unary node to the existing node on top of the stack
State	apply(State state, double scoreDelta) Add a unary node to the existing node on top of the stack
boolean	equals(java.lang.Object o)
int	hashCode()
boolean	isLegal(State state, java.util.List<ParserConstraint> constraints) Legal as long as there is at least one item on the state's stack and that item has not already been unary transformed.
java.lang.String	toString()

Methods inherited from class java.lang.Object

clone, finalize, getClass, notify, notifyAll, wait, wait, wait

Field Detail

labels

public final java.lang.String[] labels

labels[0] is the top of the unary chain. A unary chain that results in a ROOT will have labels[0] == ROOT, for example.

isRoot

public final boolean isRoot

root transitions are illegal in the middle of the tree, naturally

Constructor Detail

CompoundUnaryTransition

public CompoundUnaryTransition(java.util.List<java.lang.String> labels,
                               boolean isRoot)

Method Detail

isLegal

public boolean isLegal(State state,
                       java.util.List<ParserConstraint> constraints)

Legal as long as there is at least one item on the state's stack and that item has not already been unary transformed.

Specified by:

isLegal in interface Transition

apply

public State apply(State state)

Add a unary node to the existing node on top of the stack

Specified by:

apply in interface Transition

apply

public State apply(State state,
                   double scoreDelta)

Add a unary node to the existing node on top of the stack

Specified by:

apply in interface Transition

equals

public boolean equals(java.lang.Object o)

Overrides:

equals in class java.lang.Object

hashCode

public int hashCode()

Overrides:

hashCode in class java.lang.Object

toString

public java.lang.String toString()

Overrides:

toString in class java.lang.Object