In order to clarify the monitoring strategy we will now consider how an attachment ambiguity may be avoided. The following German sentence constitutes a simplified example of the sort of attachment ambiguity shown in (25).
Suppose indeed that the generator, as a first possibility, constructs this sentence in order to realize the (simplified) semantic representation:
The corresponding derivation tree is the left tree in figure 5.8.
Figure 5.8: Derivation trees of the simple attachment example
To find out whether this sentence is ambiguous the parser is called. The parser will find two results, indicating that the sentence is ambiguous. For the alternative reading the right derivation tree shown in figure 5.8 is found. The derivation tree of the result of generation is then compared with the trees assigned to the alternative readings (in this case only one), given rise to the marked derivation tree shown in figure 5.9.
Figure 5.9: Marked tree of German example
The monitored generation will then try to find alternative possibilities at these marked nodes. However, no such alternatives exist. Therefore, the markers are pushed up one level, obtaining the derivation tree given in figure 5.10.
Figure: Markers are pushed one level upward
At this point the monitored generator again tries to find alternatives for the marked nodes, this time successfully yielding:
At this point we can stop. However, note that if we ask for further possibilities we will eventually obtain all possible results. For example, if the markers are pushed to the root node of the derivation tree we will also obtain
