Identification structure is illustrated in Fig. 5.22 and Fig. 5.23.

Figure 5.22. Identification structure I

Figure 5.23. Identification structure II

Root node of an identification structure. The root of an identification structure is the node representing the descriptor. If the identifying expression does not contain a noun in prepositionless case and it occurs at the surface level without any descriptor, a new node is added to the tectogrammatical tree in the position of the root of the identification structure, with the t-lemma substitute #Idph. The root node of the identification structure is assigned a functor depending on its position in the sentence structure.

Effective root node of an identifying expression. The effective root nodes of the identifying expression, which all have the functor ID are dependent on the root of the identification structure. The effective roots of an identifying expression are nodes representing expressed governing nodes of the identifying expression not dependent on any other node. This means that a possible case of ellipsis of the governing element is not represented with identifying expressions.

The effective root of an identifying expression is usually identical with the root of an identifying expression. The effective root nodes of an identifying expression are not identical with the root of the identifying expression only in cases where the identifying expression has more governing nodes, which are paratactically connected. Identifying expressions can also have more roots: when the identifying expression has more governing elements (effective roots), which are not paratactically connected.

Items of an identifying expression. All nodes representing the individual words of an identifying expression are the items of the identifying expression. The structure of identifying expressions undergoes further analysis. Unless stated otherwise, the rule is that the elements dependent on the effective root nodes of an identifying expression are annotated according to the standard annotation rules and their functor is assigned according to the nature of their dependency.

Modifiers of identification structures. Identifying expressions can be further modified (as a whole). The root of the modifier is always an immediate daughter node of the root of the identification structure.

Examples:

Figure 5.24. Identifying expression

Guess Who's Coming to Dinner is fun.

Figure 5.25. Identifying expression

Kerouac's On the Road