An interface which defines a transition type in the shift-reduce parser.
Transition that makes a binary parse node in a partially finished tree.
Combines multiple feature factories into one feature factory
Transition that makes a compound unary parse node in a partially finished tree.
Featurizes words based only on their distributional similarity classes.
Transition that finishes the processing of a state
Transition that literally does nothing
A second attempt at making an oracle.
A shift-reduce constituency parser.
Transition that moves a single item from the front of the queue to the top of the stack without making any other changes.
A class which encodes the current state of the parsing.
Tally and output the number of each type of transition used.
Outputs either binarized or debinarized trees to a given filename.
Transition that makes a unary parse node in a partially finished tree.
Stores one row of the sparse matrix which makes up the multiclass perceptron.
Used to describe the relative location of separators to the head of a subtree
Stanford NLP Group