A New Architecture for Functional Grammar (Functional Grammar Series)

(backadmin) #1

348 Dik Bakker and Anna Siewierska


(13) (M 6 : [INFRM [(A 6 : [DECL (P 1 )S (P 2 )A
(C 6 : [R 1 (x 1 )TOP R 2 (x 8 :CLASS)FOC T 1 (f 1 : GO INTO)])])]])


Now semantics will kick in and start working on this structure. Seman-
tic representations will be created for the referents of R 2 and T 1 by
searching the lexicon and by adding the operators which are relevant given
the grammar and the different types of background information such as the
ongoing discourse and the script. We will not go into the details of this un-
doubtedly very complicated process of translating cognitive structures into
semantic ones, precisely because we lack a representation for the former,
and a theory about the translation process. The result in working memory
will be as in (14).^19


(14) (p 1 : [(past e 1 : [hab f 1 : come [V] (def x 1 )AG ] (gen sg x 8 : class [N])ILLAT )])


This will be passed on to the expression component. In parallel, parts of
(13) have been handed to the expression component as well. This might be
something like the information in (15).


(15) [DECL (P 1 )S (P 2 )A (C 6 : [(x 1 )TOP (x 8 )FOC (f 1 )])]


Here, unlike in the version introduced in Section 1 where we used the
traditional multi-layered underlying clause, we are dealing with two struc-
tures for expression, (14) and (15). Several options are now open. One is to
merge these two structures into one structure, which will give us something
like the traditional underlying clause. The variables shared by the two
structures should make this possible. However, this would mean reintro-
ducing the upward layering procedure. Also, in order to be combinable, the
two structures should be complete in the sense of the traditional underlying
clause. It seems to be more interesting to see whether we could also main-
tain the parallelism in the model during expression by keeping the two
structures apart. This can be accomplished by extending the Config field of
the top node – and other nodes for that matter – such that it can hold both
the pragmatic structure of type (15) and the semantic one of type (14). The
top node for the expression will then look like (16).

Free download pdf