A directed graph.
An edge of a directed graph.
An edge of a directed graph.
index of the node at the edge's tail
index of the node at the edge's head
a labeling of this edge
A node of a directed graph.
A node of a directed graph.
a labeling of this node
A Position is a essentially a pointer to a node in a rooted, directed tree.
A Position is a essentially a pointer to a node in a rooted, directed tree. It is a sequence of non-negative integers.
It is probably easiest to describe the concept by example. The root of the tree is the empty sequence. The first child of the root is Seq(0) (we count from zero). The third child of the first child of the root is Seq(2, 0). The seventh child of the third child of the first child of the root is Seq(6, 2, 0). Etc.
the sequence of integers corresponding to a node's position in a tree
A PositionTree is a rooted, directed tree, implemented as a map from positions to nodes.
A PositionTree is a rooted, directed tree, implemented as a map from positions to nodes.
a sequence of (position, node) pairs
A node of a position tree.
A node of a position tree.
a map from label names to label values
A Sentence is a sequence of tokens.
A Sentence is a sequence of tokens.
the sequence of tokens in the sentence
A data source for Sentence object.
A Token is the basic atom of a sentence.
A Token is the basic atom of a sentence.
the surface form of the token
The NexusToken is the "zeroth" token of a dependency parse.
A directed graph.
The index of a node is its position in the
nodes
list (counting from 0).the nodes of the directed graph
each node's outgoing edges