analysis defines additional analytic attributes specifying alternate structural arrangements for the components of a text. equiv equivalent specifies the identifiers of elements considered structurally equivalent to the one bearing the attribute. IDREFS one or more valid SGML identifiers for elements in the current document separated by white space. #IMPLIED exclude specifies the identifiers of elements that are considered excluded from the structure when the element bearing this attribute is selected. IDREFS one or more valid SGML identifiers for elements in the current document separated by white space. #IMPLIED select specifies which of several mutually exclusive elements actually occurs in a structure. IDREFS one or more valid SGML identifiers for elements in the current document separated by white space. #IMPLIED additional tag set for analysis and interpretation arc encodes an arc, the connection from one node to another in a graph. label gives a label for an arc. CDATA A character string. #IMPLIED label2 gives a second label for an arc. CDATA A character string. #IMPLIED

Use this attribute together with the label attribute if a transducer is being encoded. from gives the ID of the node which is adjacent from this arc. IDREF The ID of a node. #REQUIRED to gives the ID of the node which is adjacent to this arc. IDREF The ID of a node. #REQUIRED ]]>

The arc element must be used if the arcs are labeled. Otherwise, arcs can be encoded using the adj, adjTo and adjFrom attributes on the node tags in the graph. Both arc tags and adjacency attributes can be used, but the resulting encoding would be highly redundant. additional tag set for graphs, networks, and trees empty graph EMPTY ]]> ]]> certainty defines additional attributes which are enabled for all elements when the additional tag set for certainty and uncertainty is selected. additional tag set for certainty chunk includes all elements which can occur between, but not within, paragraphs and other chunks.

This element class does not contain all those elements which can appear between chunks: the class inter contains a set of elements which can appear either within or between chunks. Unlike elements of that class, chunks cannot occur within chunks. In prose, this means the elements in this class can appear between but not within paragraphs. base tag set for common core features common common chunk- and inter-level elements.

This class defines the set of chunk- and inter-level elements available in all bases; it is used in defining the standard models chunk.seq and specialPara in the general and mixed bases. base tag set for common core features eLeaf Leaf of an embedding tree. provides explicitly for a leaf of an embedding tree, which may also be encoded with the eTree element. label gives a label for a leaf of an embedding tree. CDATA A character string. #IMPLIED value provides the value of an embedding leaf, which is a feature structure or other analytic element. IDREF A valid identifier of a feature structure or other analytic element. #IMPLIED ]]>

The eTree tag may be used if the encoder does not wish to distinguish by name between nonleaf and leaf nodes in embedding trees; they are distinguished by their arrangement. additional tag set for graphs, networks, and trees empty eTree triangle EMPTY ]]> ]]> eTree embedding tree provides an alternative to tree element for representing ordered rooted tree structures. label gives a label for an embedding tree. CDATA A character string. #IMPLIED value provides the value of an embedding tree, which is a feature structure or other analytic element. IDREF A valid identifier of a feature structure or other analytic element. #IMPLIED ]]> additional tag set for graphs, networks, and trees zero or more embedding trees, triangles, or embedding leafs. eTree forest triangle eLeaf eTree triangle ]]> ]]> forest provides for groups of rooted trees. type identifies the type of the forest. CDATA A character string. #IMPLIED additional tag set for graphs, networks, and trees One or more trees, embedding trees, or underspecified embedding trees (triangles). forestGrp eTree tree triangle ]]> ]]> forestGrp Forest group provides for groups of forests. type identifies the type of the forest group. CDATA A character string. #IMPLIED ]]> additional tag set for graphs, networks, and trees One or more forests. forest ]]> ]]> fs feature-structures defines additional attributes for all elements, which are enabled when the additional tag set for feature-structure notation is selected.

[No attributes declared yet.] additional tag set for analysis and interpretation global defines attributes common to all elements in the TEI encoding scheme. id identifier provides a unique identifier for the element bearing the ID value. ID any valid SGML name (in the reference concrete syntax, a name must begin with a letter and contain only letters, numeric digits, hyphen, and full stop). #IMPLIED Paragraph with the ID names....

Paragraph with the ID dates.... ]]>

The id attribute may be used to specify a canonical reference for an element; see section . n number, name, etc. gives a number (or other label) for an element, which is not necessarily unique within the document. CDATA any string of characters; often, but not necessarily, numeric. #IMPLIED

The n attribute may be used to specify the numbering of chapters, sections, list items, etc.; it may also be used in the specification of a standard reference system for the text. lang language indicates the language of the element content, usually using a two- or three-letter code from ISO 639. IDREF The value must be the identifier specified for a writing system declaration declared in the TEI header, as described in section . %INHERITED The only surviving work by Ari (died 1148) is the ten-page Íslendingabók</> (<title lang=LA>Libellus Islandorum</>), written in the early twelfth century. ]]> <!-- Carol J. Clover, The Medieval Saga (Ithaca: Cornell --> <!-- University Press, 1982), p. 149. --> </eg> <remarks><p>If no value is specified for <att>lang</att>, the <att>lang</att> value for the immediately enclosing element is inherited; for this reason, a value should always be specified on the outermost element (<gi>tei.2</gi>). </attDef> <!-- ................................................... rend --> <attDef usage=opt> <attname>rend <name>rendition or presentation <desc>indicates how the element in question was rendered or presented in the source text. <datatype>CDATA <valdesc>any string of characters; if the typographic rendition of a text is to be systematically recorded, a systematic set of values for the <att>rend</att> attribute should be defined. <default>#IMPLIED <eg><![ CDATA [ ]]> </eg> <remarks><p>These Guidelines make no binding recommendations for the values of the <att>rend</att> attribute; the characteristics of visual presentation vary too much from text to text and the decision to record or ignore individual characteristics varies too much from project to project. Some potentially useful conventions are noted from time to time at appropriate points in the Guidelines. <!-- and with luck the casebook will have a couple good examples. --> </attDef> </attlist> <remarks><p>The global attributes described here are made part of the attribute definition list declaration of each element by including the string <q>%a.global</q> in each such declaration. Some global attributes are made available when certain base or additional tag sets are selected; these are incorporated into the global attributes by references to the appropriate parameter entities. When the tag sets in question have not been selected, the parameter entities in question expand to the empty string. <part>base tag set for common core features</part> <classes names='clterm cllink clana clfs clcert clspoken'> <files names=""> <xref target=STga> </classdoc> <tagDoc id=graph usage=rwa> <gi>graph</gi> <desc>encodes a graph, which is a collection of nodes, and arcs which connect the nodes. <attList> <attDef id=grtype usage=rec> <attName>type <desc>describes the type of graph. <dataType>CDATA <valList type=semi> <val>undirected <desc>undirected graph <val>directed <desc>directed graph <val>transition network <desc>a directed graph with distinguished initial and final nodes <val>transducer <desc>a transition network with up to two labels on each arc </valList> <default>#IMPLIED <remarks><p>If <att>type=undirected</att>, then the distinction between the <att>to</att> and <att>from</att> attributes of the <gi>arc</gi> tag is neutralized. Also, the <att>adj</att> attribute, rather than the <att>adjFrom</att> and <att>adjTo</att> attributes, should be used to encode pointers to the ends of the arcs. If <att>type=directed</att> (or any other value which implies directionality), then the <att>adjFrom</att> and <att>adjTo</att> attributes should be used, instead of the <att>adj</att> attribute. </attDef> <attDef id=grlab usage=rwa> <attName>label <desc>gives a label for a graph. <dataType>CDATA <valDesc>A character string. <default>#IMPLIED </attDef> <attDef id=grorder usage=opt> <attName>order <desc>states the order of the graph, i.e., the number of its nodes. <dataType>NUMBER <valDesc>A positive integer. <default>#IMPLIED </attDef> <attDef id=grsize usage=opt> <attName>size <desc>states the size of the graph, i.e., the number of its arcs. <dataType>NUMBER <valDesc>A nonnegative integer. <default>#IMPLIED </attDef> </attList> <exemplum> <eg><![ CDATA [ <graph type=undirected id=cug1 label='Airline Connections in Southwestern USA' rend='LABEL-PLACE bottom center NODE-FRAME none ARC solid line' order=5 size=4> <node label=LAX id=LAX degree=2> <node label=LVG id=LVG degree=2> <node label=PHX id=PHX degree=3> <node label=TUS id=TUS degree=1> <node label=CIB id=CIB degree=0> <arc from=LAX to=LVG> <arc from=LAX to=PHX> <arc from=LVG to=PHX> <arc from=PHX to=TUS> </graph> ]]> </eg></exemplum> <exemplum><eg><![ CDATA [ <graph type=directed id=rdg2 label='Selected Airline Routes in Southwestern USA' rend='LABEL-PLACE bottom center NODE-FRAME none ARC solid line with arrowhead' order=5 size=5> <node label=LAX id=LAX inDegree=1 outDegree=1 adjTo=LVG adjFrom=PHX> <node label=LVG id=LVG inDegree=1 outDegree=1 adjFrom=LAX adjTo=PHX> <node label=PHX id=PHX inDegree=2 outDegree=2 adjTo='LAX TUS' adjFrom='LVG TUS'> <node label=TUS id=TUS inDegree=1 outDegree=1 adjTo=PHX adjFrom=PHX> <node label=CIB id=CIB inDegree=0 outDegree=0> </graph> ]]> </eg></exemplum> <part>additional tag set for graphs, networks, and trees</part> <classes names=chunk> <!-- --> <files names=""> <dataDesc>One or more nodes and zero or more arcs in any order. <parents> </parents> <children>arc node </children> <elemDecl> <![ CDATA [ <!ELEMENT graph - - ((node)+ & (arc)*) > ]]> </elemdecl> <attldecl> <![ CDATA [ <!ATTLIST graph %a.global; type CDATA #IMPLIED label CDATA #IMPLIED order NUMBER #IMPLIED size NUMBER #IMPLIED > ]]> </attldecl> <xref type=div1 target=GD> </tagDoc> <tagDoc id=inode usage=rwa> <gi>iNode</gi> <name>intermediate (or internal) node <desc>represents an intermediate (or internal) node of a tree. <attList> <attDef id=inlab usage=opt> <attName>label <desc>gives a label for an intermediate node. <dataType>CDATA <valDesc>A character string. <default>#IMPLIED </attDef> <attDef id=invalue usage=rwa> <attName>value <desc>provides the value of an intermediate node, which is a feature structure or other analytic element. <dataType>IDREF <valDesc>A valid identifier of a feature structure or other analytic element. <default>#IMPLIED </attDef> <attDef id=inchild usage=req> <attName>children <desc>provides a list of IDs of the elements which are the children of the intermediate node. <dataType>IDREFS <valDesc>A list of IDs. <default>#REQUIRED </attDef> <attDef id=inpar usage=opt> <attName>parent <desc>provides the ID of the element which is the parent of this node. <dataType>IDREF <valDesc>The ID of the parent node. <default>#IMPLIED </attDef> <attDef id=inord usage=opt> <attName>ord <desc>indicates whether or not the internal node is ordered. <dataType>(Y | N) <valList type=closed> <val>Y <desc>indicates that the children of the intermediate node are ordered. <val>N <desc>indicates that the children of the intermediate node are unordered. </valList> <default>#IMPLIED <remarks><p>Use if and only if <att>ord=partial</att> is specified on the <gi>tree</gi> tag and the intermediate node has more than one child. </attDef> <attDef id=infol usage=rwa> <attName>follow <desc>provides an ID of the element which this node follows. <dataType>IDREF <valDesc>An ID of another intermediate node or leaf of the tree. <default>#IMPLIED <remarks><p>If the tree is unordered or partially ordered, this attribute has the property of fixing the relative order of the intermediate node and the element which is the value of the attribute. </attDef> <attDef id=inoutdg usage=opt> <attName>outDegree <desc>gives the out degree of an intermediate node, the number of its children. <dataType>NUMBER <valDesc>A nonnegative integer. <default>#IMPLIED <remarks><p>The in degree of an intermediate node is always 1. </attDef> </attList> <exemplum> <eg><![ CDATA [ <iNode label=PT id=PT1 parent=VB1 children=up1 outDegree=1 follow=PN1> ]]> </eg> </exemplum> <part>additional tag set for graphs, networks, and trees</part> <classes> <files names=""> <dataDesc>empty <parents>tree </parents> <children>EMPTY </children> <elemDecl> <![ CDATA [ <!ELEMENT iNode - O EMPTY > ]]> </elemdecl> <attldecl> <![ CDATA [ <!ATTLIST iNode %a.global; label CDATA #IMPLIED value IDREF #IMPLIED children IDREFS #REQUIRED parent IDREF #IMPLIED ord (Y | N) #IMPLIED follow IDREF #IMPLIED outDegree NUMBER #IMPLIED > ]]> </attldecl> <xref type=div2 target=GDtr> </tagDoc> <tagDoc id=leaf usage=rwa> <gi>leaf</gi> <desc>encodes the leaves (terminal nodes) of a tree. <attList> <attDef id=lflab usage=opt> <attName>label <desc>gives a label for a leaf. <dataType>CDATA <valDesc>A character string. <default>#IMPLIED </attDef> <attDef id=lfvalue usage=rwa> <attName>value <desc>provides the value of a leaf, which is a feature structure or other analytic element. <dataType>IDREF <valDesc>A valid identifier of a feature structure or other analytic element. <default>#IMPLIED </attDef> <attDef id=lfpar usage=opt> <attName>parent <desc>provides the ID of parent of a leaf. <dataType>IDREF <valDesc>The ID of the parent node. <default>#IMPLIED </attDef> <attDef id=lffol usage=rwa> <attName>follow <desc>provides an ID of an element which this leaf follows. <dataType>IDREF <valDesc>An ID of another intermediate node or leaf of the tree. <default>#IMPLIED <remarks><p>If the tree is unordered or partially ordered, this attribute has the property of fixing the relative order of the leaf and the element which is the value of the attribute. </attDef> </attList> <exemplum> <eg><![ CDATA [ <leaf id=peri1 parent=N1 label=periscope> ]]> </eg> </exemplum> <remarks><p>The in degree of a leaf is always 1, its out degree always 0. <part>additional tag set for graphs, networks, and trees</part> <classes> <files names=""> <dataDesc>empty <parents>tree </parents> <children>EMPTY </children> <elemDecl> <![ CDATA [ <!ELEMENT leaf - O EMPTY > ]]> </elemdecl> <attldecl> <![ CDATA [ <!ATTLIST leaf %a.global; label CDATA #IMPLIED value IDREF #IMPLIED parent IDREF #IMPLIED follow IDREF #IMPLIED > ]]> </attldecl> <xref type=div2 target=GDtr> </tagDoc> <classDoc id=cllink type=atts> <class>linking</class> <desc>defines additional attributes for hypertext and other linking, which are enabled for all elements when the additional tag set for linking is selected. <attlist> <attDef usage=opt> <attname>corresp <name>correspondents <desc>specifies the identifiers of corresponding elements. <datatype>IDREFS <valdesc>one or more valid SGML identifiers for elements in the current document separated by white space. <default>#IMPLIED <eg><![ CDATA [ ]]> </eg> <remarks> </attDef> <attDef usage=opt> <attname>link <name>link <desc>specifies the identifiers of elements that may be linked with this one to form an aggregate. <datatype>IDREFS <valdesc>one or more valid SGML identifiers for elements in the current document separated by white space. <default>#IMPLIED <eg><![ CDATA [ ]]> </eg> <remarks> </attDef> <attDef usage=opt> <attname>partof <desc>specifies the identifier of a <gi>join</gi> element in the current document representing an aggregate of which this element is a component part. <datatype>IDREF <valdesc>a valid SGML identifier attached to a <gi>join</gi> element. <default>#IMPLIED <eg><![ CDATA [ ]]> </eg> <remarks> </attDef> <attDef usage=opt> <attname>prev <name>previous <desc>specifies the identifier of an element which may be linked with the current element to form an aggregate, and which immediately precedes it in the aggregate. <datatype>IDREF <valdesc>a valid SGML identifier for an element in the current document. <default>#IMPLIED <eg><![ CDATA [ ]]> </eg> <remarks> </attDef> <attDef usage=opt> <attname>next <name>next <desc>specifies the identifier of an element which may be linked with the current element to form an aggregate, and which immediately follows it in the aggregate. <datatype>IDREF <valdesc>a valid SGML identifier for an element in the current document. <default>#IMPLIED <eg><![ CDATA [ ]]> </eg> <remarks> </attDef> </attlist> <part>additional tag set for analysis and interpretation</part> <classes> <files names=""> <xref target=SA> </classdoc> <tagDoc id=node usage=rwa> <gi>node</gi> <desc>encodes a node, a possibly labeled point in a graph. <attList> <attDef id=ndlab usage=opt> <attName>label <desc>gives a label for a node. <dataType>CDATA <valDesc>A character string. <default>#IMPLIED </attDef> <attDef usage=opt> <attName>label2 <desc>gives a second label for a node. <dataType>CDATA <valDesc>A character string. <default>#IMPLIED <remarks><p>Use this attribute together with the <att>label</att> attribute if a transducer is being encoded whose actions are associated with nodes rather than with arcs. </attDef> <attDef id=ndvalue usage=opt> <attName>value <desc>provides the value of a node, which is a feature structure or other analytic element. <dataType>IDREF <valDesc>A valid identifier. <default>#IMPLIED </attDef> <attDef id=ndtype usage=opt> <attName>type <desc>provides a type for a node. <dataType>CDATA <valList type=semi> <val>initial <desc>initial node in a transition network <val>final <desc>final node in a transition network </valList> <default>#IMPLIED </attDef> <attDef id=ndadjto usage=rwa> <attName>adjTo <desc>gives the IDs of the nodes which are adjacent to the current node. <dataType>IDREFS <valDesc>A list of IDs. <default>#IMPLIED </attDef> <attDef id=ndadjfm usage=rwa> <attName>adjFrom <desc>gives the IDs of the nodes which are adjacent from the current node. <dataType>IDREFS <valDesc>A list of IDs. <default>#IMPLIED </attDef> <attDef id=ndadj usage=rwa> <attName>adj <desc>gives the IDs of the nodes which are both adjacent to and adjacent from the current node. <dataType>IDREFS <valDesc>A list of IDs. <default>#IMPLIED <remarks><p>Use this attribute instead of the <att>adjTo</att> and <att>adjFrom</att> attributes when the graph is undirected and vice versa if the graph is directed. </attDef> <attDef id=ndindg usage=opt> <attName>inDegree <desc>gives the in degree of the node, the number of nodes which are adjacent from the given node. <dataType>NUMBER <valDesc>A nonnegative integer. <default>#IMPLIED </attDef> <attDef id=ndoutdg usage=opt> <attName>outDegree <desc>gives the out degree of the node, the number of nodes which are adjacent to the given node. <dataType>NUMBER <valDesc>A nonnegative integer. <default>#IMPLIED </attDef> <attDef id=nddg usage=opt> <attName>degree <desc>gives the degree of the node, the number of arcs with which the node is incident. <dataType>NUMBER <valDesc>A nonnegative integer. <default>#IMPLIED <remarks><p>Use this attribute instead of the <att>inDegree</att> and <att>outDegree</att> attributes when the graph is undirected and vice versa if the graph is directed. </attDef> </attList> <exemplum><eg> <![ CDATA [ <node id=t6 label='6' inDegree=2 outDegree=0 type='final'> ]]> </eg> </exemplum> <part>additional tag set for graphs, networks, and trees</part> <classes> <files names=""> <dataDesc>empty <parents>graph </parents> <children>EMPTY </children> <elemDecl> <![ CDATA [ <!ELEMENT node - O EMPTY > ]]> </elemdecl> <attldecl> <![ CDATA [ <!ATTLIST node %a.global; label CDATA #IMPLIED label2 CDATA #IMPLIED value IDREF #IMPLIED type CDATA #IMPLIED adjTo IDREFS #IMPLIED adjFrom IDREFS #IMPLIED adj IDREFS #IMPLIED inDegree NUMBER #IMPLIED outDegree NUMBER #IMPLIED degree NUMBER #IMPLIED > ]]> </attldecl> <xref type=div1 target=GD> </tagDoc> <tagDoc id=root usage=rwa> <gi>root</gi> <name>root node <desc>represents the root node of a tree. <attList> <attDef id=rtlab usage=rwa> <attName>label <desc>gives a label for a root node. <dataType>CDATA <valDesc>A character string. <default>#IMPLIED </attDef> <attDef id=rtvalue usage=rwa> <attName>value <desc>provides the value of the root, which is a feature structure or other analytic element. <dataType>IDREF <valDesc>A valid identifier of a feature structure or other analytic element. <default>#IMPLIED </attDef> <attDef id=rtchild usage=req> <attName>children <desc>provides a list of IDs of the elements which are the children of the root node. <dataType>IDREFS <valDesc>A list of valid identifiers. <default>#IMPLIED <remarks><p>If the root has no children (i.e., the tree is <soCalled>trivial</soCalled>), then the <att>children</att> attribute must be omitted. For technical reasons, it cannot be specified as <tag>root children=''</tag>. </attDef> <attDef id=rtord usage=rwa> <!--On usage, see also remarks. --> <attName>ord <desc>indicates whether or not the root is ordered. <dataType>(Y | N) <valList type=closed> <val>Y <desc>indicates that the children of the root are ordered. <val>N <desc>indicates that the children of the root are unordered. </valList> <default>#IMPLIED <remarks><p>Use if and only if <att>ord=partial</att> is specified on the <gi>tree</gi> tag and the root has more than one child. </attDef> <attDef id=rtoutdg usage=opt> <attName>outDegree <desc>gives the out degree of the root, the number of its children. <dataType>NUMBER <valDesc>A nonnegative integer. <default>#IMPLIED <remarks><p>The in degree of the root is always 0. </attDef> </attList> <exemplum> <eg><![ CDATA [ <root id=VP1 label=VP children='VB1 PN1' outDegree=2> ]]> </eg> </exemplum> <part>additional tag set for graphs, networks, and trees</part> <classes> <files names=""> <dataDesc>empty <parents>tree </parents> <children>EMPTY </children> <elemDecl> <![ CDATA [ <!ELEMENT root - O EMPTY > ]]> </elemdecl> <attldecl> <![ CDATA [ <!ATTLIST root %a.global; label CDATA #IMPLIED value IDREF #IMPLIED children IDREFS #IMPLIED ord (Y | N) #IMPLIED outDegree NUMBER #IMPLIED > ]]> </attldecl> <xref type=div2 target=GDtr> </tagDoc> <classDoc id=clspoken type=atts> <class>spoken</class> <desc>defines additional attributes which are enabled for all elements when the base tag set for transcription of spoken texts is selected. <attlist> </attlist> <part>additional tag set for spoken materials</part> <classes> <files names=""> <xref target=TS> </classdoc> <classDoc id=clterm type=atts> <class>terminology</class> <name>global attributes for terminological data. <desc>defines attributes for all elements in documents which use the base tag set for terminological data. <attlist> <!-- .................................................. group --> <attDef usage=opt> <attname>group <desc>indicates the group (term and related elements) to which this element should be associated by specifying a string matching the <att>n</att> attribute value on an appropriate element. <datatype>CDATA <valdesc>any string matching the <att>n</att> attribute value on the <gi>term</gi> element to which the group is attached. <default>#IMPLIED <eg><![ CDATA [ ]]> </eg> <remarks><p>The <att>group</att> attribute provides a specialized pointing mechanism for use within <gi>termEntry</gi> elements. </attDef> <!-- .................................................. grpPtr --> <attDef usage=opt><attname>grpPtr <desc>indicates the group (term and related elements) to which this element should be associated by specifying its unique identifier, where this is available. <datatype>IDREF <valdesc>the value specified must match a value supplied as the value for an <att>id</att> attribute on some <gi>term</gi> element in the current SGML document. <default>#IMPLIED <eg><![ CDATA [ ]]> </eg> <remarks><p>The <att>group</att> attribute provides a specialized pointing mechanism for use within <gi>termEntry</gi> elements. </attDef> <!-- ................................................. depend --> <attDef usage=opt> <attname>depend <desc>indicates the parent element to which this element should be associated by specifying a string matching the <att>n</att> attribute value on an appropriate element. <datatype>CDATA <valdesc>any string matching the <att>n</att> attribute value on the element to which the dependent element is attached. <default>#IMPLIED <eg><![ CDATA [ ]]> </eg> </attDef> <!-- .................................................. depPtr --> <attDef usage=opt><attname>depPtr <desc>indicates the parent element to which this element should be associated by specifying its unique identifier, where this is available. <datatype>IDREF <valdesc>the value specified must match a value supplied as the value for an <att>id</att> attribute on some <gi>term</gi> element in the current SGML document. <default>#IMPLIED <eg><![ CDATA [ ]]> </eg> <remarks> </attDef> </attlist> <remarks><p>The attributes shared by this element class are used for linking elements, possibly not adjacent in the record, which are related (e.g. a grammatical annotation and the term it describes). If no attribute is specified, the element is assumed to relate to the most recently specified <gi>term</gi> or <gi>otherForm</gi> element. <!-- The usual --> <!-- ID/IDREF-based pointing mechanisms are not used, primarily because the --> <!-- requirement that SGML ID values be unique within a document places an --> <!-- impractical burden on the encoder when terminological data from several --> <!-- sources are to be merged. --> <part>base tag set for terminological data</part> <classes> <files names=""> <xref target=TEta> <xref target=TEflne> <xref target=TEdt> </classdoc> <tagDoc id=tree usage=rwa> <gi>tree</gi> <desc>encodes a tree, which is made up of a root, internal nodes, leaves, and arcs from root to leaves. <attList> <attDef id=trlab usage=opt> <attName>label <desc>gives a label for a tree. <dataType>CDATA <valDesc>A character string. <default>#IMPLIED </attDef> <attDef id=trarity usage=opt> <attName>arity <desc>gives the maximum number of children of the root and internal nodes of the tree. <dataType>NUMBER <valDesc>A nonnegative integer. <default>#IMPLIED </attDef> <attDef id=trord usage=req> <attName>ord <desc>indicates whether or not the tree is ordered, or if it is partially ordered. <dataType>(Y | N | partial) <valList type=closed> <val>Y <desc>indicates that all of the branching nodes of the tree are ordered. <val>partial <desc>indicates that some of the branching nodes of the tree are ordered and some are unordered. <val>N <desc>indicates that all of the branching nodes of the tree are unordered. </valList> <default>Y </attDef> <attDef id=trorder usage=opt> <attName>order <desc>gives the order of the tree, i.e., the number of its nodes. <dataType>NUMBER <valDesc>A nonnegative integer. <default>#IMPLIED <remarks><p>The size of a tree is always one less than its order, hence there is no need for both a <att>size</att> and <att>order</att> attribute. </attDef> </attList> <exemplum> <eg><![ CDATA [ <tree n='ex2' ord=partial arity=2 order=13> <root label='/' id=div1 ord=Y children='plu1 exp1'> <iNode label='+' id=plu1 ord=N parent=div1 children='exp2 exp3'> <iNode label='**' id=exp1 ord=Y parent=div1 children='plu2 num2.3'> <iNode label='**' id=exp2 ord=Y parent=plu1 children='vara1 num2.1'> <iNode label='**' id=exp3 ord=Y parent=plu1 children='varb1 num2.2'> <iNode label='+' id=plu2 ord=N parent=exp1 children='vara2 varb2'> <leaf label='a' id=vara1 parent=exp2> <leaf label='2' id=num2.1 parent=exp2> <leaf label='b' id=varb1 parent=exp3> <leaf label='2' id=num2.2 parent=exp3> <leaf label='a' id=vara2 parent=plu2> <leaf label='b' id=varb2 parent=plu2> <leaf label='2' id=num2.3 parent=exp1> </tree> ]]> </eg> </exemplum> <part>additional tag set for graphs, networks, and trees</part> <classes names=chunk> <!-- --> <files names=""> <dataDesc>A root, and zero or more internal nodes and leaves, but if there is an internal node, there must also be at least one leaf. <parents>forest </parents> <children>iNode leaf root </children> <elemDecl> <![ CDATA [ <!ELEMENT tree - - ((leaf | iNode)*, root, (leaf | iNode)*) > ]]> </elemdecl> <attldecl> <![ CDATA [ <!ATTLIST tree %a.global; label CDATA #IMPLIED arity NUMBER #IMPLIED ord (Y | N | partial) Y order NUMBER #IMPLIED > ]]> </attldecl> <xref type=div2 target=GDtr> </tagDoc> <tagDoc id=triangle usage=opt> <gi>triangle</gi> <name>Underspecified embedding tree, so called because of its characteristic shape when drawn. <desc>provides for an underspecified <gi>eTree</gi>, that is, an <gi>eTree</gi> with information left out. <attList> <attDef usage=opt> <attName>label <desc>gives a label for an underspecified embedding tree. <dataType>CDATA <valDesc>A character string. <default>#IMPLIED </attDef> <attDef usage=rwa> <attName>value <desc>provides the value of a triangle, which is the SGML identifier of a feature structure or other analytic element. <dataType>IDREF <valDesc>A valid identifier of a feature structure or other analytic element. <default>#IMPLIED </attDef> </attList> <exemplum> <eg><![ CDATA [ <triangle label='NP'><eLeaf label='the periscope'></triangle> ]]> </eg> </exemplum> <part>additional tag set for graphs, networks, and trees</part> <classes> <files names=""> <dataDesc>An optional label or feature structure followed by zero or more embedding trees, triangles, or embedding leafs. <parents>eTree forest triangle </parents> <children>eLeaf eTree triangle </children> <elemDecl> <![ CDATA [ <!ELEMENT triangle - - ((eTree | triangle | eLeaf)*) > ]]> </elemdecl> <attldecl> <![ CDATA [ <!ATTLIST triangle %a.global; label CDATA #IMPLIED value IDREF #IMPLIED > ]]> </attldecl> <xref type=div2 target=GDat> </tagDoc>