org.allenai.nlpstack.parse.poly
The ApplicabilitySignature is a ClassificationTask for which we are trying to predict the next transition, given that only a subset of possible transitions are applicable.
The ArcEagerGuidedCostFunction uses a gold parse tree to make deterministic decisions about which transition to apply in any given state.
The ArcEagerInvertedLeftArc operator creates an inverse arc from the next buffer item to the stack top and then performs a Reduce (see above).
The ArcEagerInvertedRightArc operator creates an inverse arc from the stack top to the next buffer item and then performs a Shift (see above).
The ArcEagerLeftArc operator creates an arc from the next buffer item to the stack top and then performs a Reduce (see above).
The ArcEagerRightArc operator creates an arc from the stack top to the next buffer item and then performs a Shift (see above).
The ArcInverter takes a PolytreeParse and inverts arcs whose labels are in the argument set
inverseArcLabels.
A BreadcrumbRef is a StateRef (see above) whose apply operation returns the breadcrumb of
the indexth element of the stack, if it exists.
Maps the tokens of a neighborhood to their respective Brown clusters.
A BufferRef is a StateRef (see above) whose apply operation returns the indexth element of
the buffer, if it exists.
Generates a feature for each neighborhood histogram and transform in the argument list.
Iterates through all neighborhoods from all parses in a PolytreeParseSource.
Creates a data source from a file of parse trees.
A ForbiddenArcLabel constraints designates a transition as illegal if it would directly create an arc (in either direction) with the specified label between the tokens at the given indices.
A ForbiddenEdge constraint designates a transition as illegal if it would directly create an arc (in either direction) between the tokens at the given indices.
A GoldParseSource reduces parse trees to states of a finite-state machine.
A GoldParseTrainingVectorSource reduces a gold parse tree to a set of feature vectors for classifier training.
The KeywordFeature maps a token to its word representation, if its word appears in the
argument set keywords.
The KeywordTransform maps a token to its word representation, if its word appears in the
argument set keywords.
Scores parses based on a linear combination of features.
Gets the n-best greedy parses for a given sentence.
A Neighborhood is a sequence of tokens, generally taken from a parse tree.
Collects statistics over "neighborhood events.
Maps a parse tree to an iterator over its neighborhoods.
A data source for neighborhoods.
A NeighborhoodTransform maps a Neighborhood into an "event" (a sequence of strings).
The NumChildrenToTheLeft transform maps a token to how many of its children appear to its
left in the state's tokens sequence.
The NumChildrenToTheRight transform maps a token to how many of its children appear to its
right in the state's tokens sequence.
A ParsePool is a collection of parse candidates for the same input sentence.
A data source for ParsePool objects.
Contains the key components of a parser (for serialization purposes).
A PolytreeParse is a polytree-structured dependency parse.
Maps a scored parse into a feature vector.
A PolytreeParseFeatureUnion merges the output of a list of features.
A data source for PolytreeParse objects.
The PrefixFeature maps a token to the set of its prefixes that are contained in a set of "key" prefixes.
The PrefixTransform maps a token to the set of its prefixes that are contained in a set of "key" prefixes.
A RequestedArc constraint requests that the output parse MUST contain the requested arc.
Uses the parser model to create an n-best list, then chooses the best parse from this n-best list (according to the reranking function).
Extracts neighborhoods of the form (node, breadcrumb, grandcrumb, .
A StackRef is a StateRef (see above) whose apply operation returns the indexth element of
the stack, if it exists.
A StateRef allows you to figure out the token that corresponds to a particular aspect of a TransitionParserState.
The StateRefProperty is a ClassificationTask for which we are trying to predict the next transition, given that we know some property of a particular token of the parser state.
The StateRefPropertyIdentifier identifies the ClassificationTask of a parser state according to the coarse part-of-speech tag of a particular word of the state (as identified by a StateRef).
The SuffixFeature maps a token to the set of its suffixes that are contained in a set of "key" suffixes.
The SuffixTransform maps a token to the set of its suffixes that are contained in a set of "key" suffixes.
Maps the tokens of a neighborhood to a particular property in their token's property map.
The TokenPropertyFeature maps a token to one of its properties.
The TokenPropertyTransform maps a token to one of its properties.
A TokenTransform is a function that maps a token to a set of symbols.
A TokenTransformFeature creates a TransitionParserFeature from a TokenTransform and a StateRef.
A TransitionParser implements a parsing algorithm for a transition-based parser.
A TransitionParserState captures the current state of a transition-based parser (i.
The ApplicabilitySignatureIdentifier identifies the ClassificationTask of a parser state according to the state's applicability signature.
The ArcEagerReduce operator pops the top stack item.
The ArcEagerShift operator pops the next buffer item and pushes it onto the stack.
Simply passes along the original score of the parse as a feature.
The BreadcrumbAssigned transform maps a token to whether its breadcrumb has been assigned.
Extracts neighborhoods of the form (node, breadcrumb) from a parse tree.
Extracts neighborhoods of the form (node, child1, .
A FirstRef is a StateRef (see above) whose apply operation returns the first element of the sentence.
The IsBracketedTransform maps a token to a symbol which is 'yes if its word appears between a pair of parentheses, 'no if it is outside of all parentheses pairs, '( if it is a left paren and ') if it is a right paren.
A LastRef is a StateRef (see above) whose apply operation returns the final element of the sentence.
Extracts neighborhoods of the form (node, leftChild1, .
Extracts neighborhoods of the form (node, parent1, .
Extracts neighborhoods of the form (node, rightChild1, .
Simply passes along the length of the sentence as a feature.
The WordFeature maps a token to its word representation.
The WordTransform maps a token to its word representation.