Publications

Abstract

In present-day spoken German, subordinate clauses introduced by the connector weil ‘because’ occur with two orders of subject, finite verb, and object(s). In addition to weil clauses with verb-final word order (“VF”; standard in subordinate clauses) one often hears weil clauses with SVO, the standard order of main clauses (“verb-second”, V2). The “weil-V2” phenomenon is restricted to sentences where the weil clause follows the main clause, and is virtually absent from formal (written, edited) German, occurring only in extemporaneous speech. Extant accounts of weil-V2 focus on the interpretation of weil-V2 clauses by the hearer, in particular on the type of discourse relation licensed by weil-V2 vs. weil-VF: causal/propositional or inferential/epistemic. Focusing instead on the production of weil clauses by the speaker, we examine a collection of about 1,000 sentences featuring a causal connector (weil, da or denn) after the main clause, all extracted from a corpus of spoken German dialogues and annotated with tags denoting major prosodic and syntactic boundaries, and various types of disfluencies (pauses, hesitations). Based on the observed frequency patterns and on known linguistic properties of the connectors, we propose that weil-V2 is caused by miscoordination between the mechanisms for lexical retrieval and grammatical encoding: Due to its high frequency, the lexical item weil is often selected prematurely, while the grammatical encoder is still working on the syntactic shape of the weil clause. Weil-V2 arises when pragmatic and processing factors drive the encoder to discontinue the current sentence, and to plan the clause following weil in the form of the main clause of an independent, new sentence. Thus, the speaker continues with a V2 clause, seemingly in violation of the VF constraint imposed by the preceding weil. We also explore implications of the model regarding the interpretation of sentences containing causal connectors.

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.