Publications

Abstract

In a paper entitled “Against markedness (and what to replace it with)”, Haspelmath argues “that the term ‘markedness’ is superfluous”, and that frequency asymmetries often explain structural (un)markedness asymmetries (Haspelmath 2006). We investigate whether this argument applies to Object and Verb orders in main (VO, marked) and subordinate (OV, unmarked) clauses of spoken and written German and Dutch, using English (without VO/OV alternation) as control. Frequency counts from six treebanks (three languages, two output modalities) do not support Haspelmath’s proposal. However, they reveal an unexpected phenomenon, most prominently in spoken Dutch and German: a small set of extremely high-frequent finite verbs with unspecific meanings populates main clauses much more densely than subordinate clauses. We suggest these verbs accelerate the start-up of grammatical encoding, thus facilitating sentence-initial output fluency

Abstract

In this exploratory study we test the hypothesis that the retrieval from memory of proper noun Agents (PNAs) under processing pressure causes a greater proportion of such semantic arguments to be placed to the right of the initial position in a clause than would be the case if such retrieval from memory were not necessary. This effect is manifest in sports commentary. Processing pressure on sports commentators is modulated by the speed at which the sport is played and reported. Non-initial placement is also facilitated by formulae which have slots in non-initial position. It follows that the non-initial placement of PNAs is not always semantically or pragmatically motivated. This finding therefore runs counter to a strong form of the functionalist hypothesis that syntactic choices available in the systemic structure of the syntax of a language offer solely semantic or pragmatic choices. It is an open question in a weak functionalist account of language and language use how processing and communicative functions interact in general.

Abstract

We present a quantitative model of word order and movement constraints that enables a simple and uniform treatment of a seemingly heterogeneous collection of linear order phenomena in English, Dutch and German complement constructions (Wh-extraction, clause union, extraposition, verb clustering, particle movement, etc.). Underlying the scheme are central assumptions of the psycholinguistically motivated Performance Grammar (PG). Here we describe this formalism in declarative terms based on typed feature unification. PG allows a homogenous treatment of both the within- and between-language variations of the ordering phenomena under discussion, which reduce to different settings of a small number of quantitative parameters.

Abstract

In this paper we present a definition of Performance Grammar (PG), a psycholinguistically motivated syntax formalism, in declarative terms. PG aims not only at describing and explaining intuitive judgments and other data concerning the well–formedness of sentences of a language, but also at contributing to accounts of syntactic processing phenomena observable in language comprehension and language production. We highlight two general properties of human sentence generation, incrementality and late linearization,which make special demands on the design of grammar formalisms claiming psychological plausibility. In order to meet these demands, PG generates syntactic structures in a two-stage process. In the first and most important ‘hierarchical’ stage, unordered hierarchical structures (‘mobiles’) are assembled out of lexical building blocks. The key operation at work here is typed feature unification, which also delimits the positional options of the syntactic constituents in terms of so-called topological features. The second, much simpler stage takes care of arranging the branches of the mobile from left to right by ‘reading–out’ one positional option of every constituent. In this paper we concentrate on the structure assembly formalism in PG’s hierarchical component. We provide a declarative definition couched in an HPSG–style notation based on typed feature unification. Our emphasis throughout is on linear order constraints.