26.01.2014 Views

existence: semantics and syntax - Institut für Linguistik/Germanistik ...

existence: semantics and syntax - Institut für Linguistik/Germanistik ...

existence: semantics and syntax - Institut für Linguistik/Germanistik ...

SHOW MORE
SHOW LESS

You also want an ePaper? Increase the reach of your titles

YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.

TOWARDS ADYNAMIC ACCOUNT OF BE IN ENGLISH 25<br />

Tn(a), ?Ty(t) ↦→ ?Ty(t)<br />

〈↑ * 〉Tn(a), ?Ty(e), ?∃x.T n(x)<br />

Figure 5. Introducing an unfixed node<br />

Tn(0), ?Ty(t)<br />

〈↑ *<br />

〉Tn(0),Ty(e),<br />

Fo(Mary ′ )<br />

Ty(e),Fo(John ′ ) ?Ty(e → t)<br />

?Ty(e), ♦<br />

Ty(e → e → t),<br />

Fo(Dislike ′ )<br />

Figure 6. Parsing Mary, John dislikes<br />

Analysing the string Mary, John dislikes in these terms is illustrated in Figure<br />

2 with an initially projected unfixed node <strong>and</strong> the pointer at the object position. At<br />

the point in the parse at which all words in the string have been processed, there<br />

remains outst<strong>and</strong>ing an unfixed node <strong>and</strong> a requirement to construct a node of type<br />

e. In this environment, a process of MERGE may take place which identifies the<br />

unfixed treenode with the node currently under construction. 17 MERGE is defined<br />

as a process that unifies the descriptions (sets of labels) of two nodes, the unfixed<br />

node <strong>and</strong> the current node. The process is therefore successful just in case no contradictory<br />

decorations result from the combination of the descriptions of the two<br />

nodes. 18 MERGE (indicated by a dashed curved line) applied to Figure 6 satisfies<br />

the outst<strong>and</strong>ing requirements on the fixed <strong>and</strong> unfixed nodes: the unfixed node provides<br />

the necessary type <strong>and</strong> formula decorations, while the fixed node provides<br />

the appropriate treenode address for the unfixed tree. Ultimately, completion of the<br />

tree yields a Ty(t) Formula value, Dislike ′ (Mary ′ )(John ′ ) decorating the topnode,<br />

with all requirements fulfilled.<br />

In Dynamic Syntax, the interaction of computational, lexical <strong>and</strong> pragmatic<br />

processes determines the interpretation of a string. A wellformed string is one for<br />

17 Note that this process is not the same, technically or conceptually, as the process of the same name<br />

in the Minimalist Program (Chomsky 1995).<br />

18 Well-formed treenode descriptions are thus rather like the categories of Generalised Phrase Structure<br />

Grammar which are defined as partial functions from attributes to values (Gazdar et al. 1985).

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!