On The Timing Of The Application Of Realisation Rules

Fawcett (2010: 66-7):

In practice the simplest workable solution is that no realisation rules should be applied until the traversal of the network has been completed, and to make the resulting selection expression of features available to each realisation rule, as it is applied. This is what is done in the Cardiff Grammar and, as we shall see in the next chapter, in the computer implementation of Halliday's grammar too.

Blogger Comments:

To be clear, here Fawcett confuses system networks, the SFL formalism that models human language as potential, with the flowcharts he uses for text generation by computer.  In doing so, he presents his solution to his own technical problem as a solution to a non-existent theoretical problem (as demonstrated in previous posts).