encodes an arc, the connection from one node to another in a graph. [] gives the identifier of the node which is adjacent from this arc. gives the identifier of the node which is adjacent to this arc. (leaf or terminal node of an embedding tree) provides explicitly for a leaf of an embedding tree, which may also be encoded with the eTree element. [] provides the value of an embedding leaf, which is a feature structure or other analytic element. (embedding tree) provides an alternative to tree element for representing ordered rooted tree structures. [] provides the value of an embedding tree, which is a feature structure or other analytic element. provides for groups of rooted trees. [] identifies the type of the forest. encodes a graph, which is a collection of nodes, and arcs which connect the nodes. [] describes the type of graph. Suggested values include: 1] undirected; 2] directed; 3] transitionNetwork; 4] transducer undirected undirected graph directed directed graph transitionNetwork a directed graph with distinguished initial and final nodes transducer a transition network with up to two labels on each arc states the order of the graph, i.e., the number of its nodes. states the size of the graph, i.e., the number of its arcs. (intermediate (or internal) node) represents an intermediate (or internal) node of a tree. [] provides the value of an intermediate node, which is a feature structure or other analytic element. provides a list of identifiers of the elements which are the children of the intermediate node. provides the identifier of the element which is the parent of this node. (ordered) indicates whether or not the internal node is ordered. provides an identifier of the element which this node follows. gives the out degree of an intermediate node, the number of its children. encodes the leaves (terminal nodes) of a tree. [] provides a pointer to a feature structure or other analytic element. provides the identifier of parent of a leaf. provides an identifier of an element which this leaf follows. provides for lists of forests. [] identifies the type of the forest group. encodes a node, a possibly labeled point in a graph. [] provides the value of a node, which is a feature structure or other analytic element. provides a type for a node. Suggested values include: 1] initial; 2] final initial initial node in a transition network final final node in a transition network (adjacent to) gives the identifiers of the nodes which are adjacent to the current node. (adjacent from) gives the identifiers of the nodes which are adjacent from the current node. (adjacent) gives the identifiers of the nodes which are both adjacent to and adjacent from the current node. gives the in degree of the node, the number of nodes which are adjacent from the given node. gives the out degree of the node, the number of nodes which are adjacent to the given node. gives the degree of the node, the number of arcs with which the node is incident. (root node) represents the root node of a tree. [] provides the value of the root, which is a feature structure or other analytic element. provides a list of identifiers of the elements which are the children of the root node. (ordered) indicates whether or not the root is ordered. gives the out degree of the root, the number of its children. encodes a tree, which is made up of a root, internal nodes, leaves, and arcs from root to leaves. [] gives the maximum number of children of the root and internal nodes of the tree. (ordered) indicates whether or not the tree is ordered, or if it is partially ordered. true indicates that all of the branching nodes of the tree are ordered. partial indicates that some of the branching nodes of the tree are ordered and some are unordered. false indicates that all of the branching nodes of the tree are unordered. gives the order of the tree, i.e., the number of its nodes. (underspecified embedding tree, so called because of its characteristic shape when drawn) provides for an underspecified eTree, that is, an eTree with information left out. [] provides the value of a triangle, which is the identifier of a feature structure or other analytic element.