org.allenai.nlpstack.parse.poly.polyparser
Given an initial state, this returns the "best" sequence of Transitions that one should apply to the initial state in order to get a polytree parse.
Given an initial state, this returns the "best" sequence of Transitions that one should apply to the initial state in order to get a polytree parse. The adjective "best" depends on the specific implementation of the TransitionParser.
the sentence you want to parse
a set of ParserConstraint objects, which constrain the choices the parser may make
the "best" list of Transitions you should apply to the initial state (or None if a parse failure occurs)
Returns all possible arc labels for this transition parser.
Returns all possible arc labels for this transition parser.
TODO: currently this is hard-coded for Stanford labels. This should be revised to get these labels from the trained models.
the set of all possible arc labels that the parser might use