On The Representation Of Subjacency Duplex Structure

Martin & Doran (2023: 38-9):

One way to simplify tables (or trees) incorporating subjacency duplex structure would be to relax the ‘function realised by class’ requirement and allow duplex structures to directly realise grammatical functions.⁹ Example (32) is revised along these lines as (33) below. This is a more economical analysis for publication purposes, but would need to be seen as a simplification. 

⁹ SFL’s expanded realisation statement operator (Matthiessen and Halliday 2009: 98) sets a precedent in this regard, although managing a completely different type of phenomenon (e.g. expansion of the English Mood function as Subject and Finite).

Blogger Comments:

[1] To be clear, the revision of (32) as (33) is simply the removal of the words 'subjacency duplex'. A simpler solution, if the notion of 'subjacency duplex' had any validity, would be to provide different representations of structure for each rank, clause and group, as in Halliday ± Matthiessen (1985, 1994, 2004, 2014).

[2] To be clear, this realisation statement is concerned with layering functions such as Mood element as Subject and Finite. It is not concerned with layering what the authors consider to be form (subjacency duplex) and function (#β α).