The aim of this book is to present results of the Collaborative Research Center 'Linguistic Foundations for Computational Linguistics' at the universities of Stuttgart and Tübingen. The goal of the Center has been to foster interaction between theoretical and computational linguistics. Its point of departure was the idea that on the one hand, computational linguistics and its applications should be based on a theoretically sound analysis of natural language; and that, on the other, the work in natural language processing can and should contribute to the development of theoretical linguistics.
The papers gathered in the volume cover the following areas: Syntax, Syntax-Semantics Interface, Syntax-Pragmatics Interface, Discourse, Formal Properties of Grammars and Probabilistic Methods for Lexicon Induction. All the papers endeavor to present their results in a form exact enough that they could in principle be implemented. Only a few papers, however, are based on actual implementations.
An important role plays the idea that linguistic description involves not just one level but several at once and that each level comes with its own representations. The interfaces between the levels are as much an integral part of the theory as the representations between which they mediate.
The relationship between syntax and semantics in this volume is explored mainly within the context of Discourse Representation Theory (DRT), because this semantic framework has been the formal conceptual background for a good part of the work in semantics and pragmatics within the Center. One of the central tenets of DRT is that the 'unit of analysis' for a theory of meaning is the discourse rather than the single sentence.
One of the most serious challenges for natural language processing is ambiguity. Parsers for grammars with large coverage often produce a huge number of syntactic analyses for one sentence. In this volume the problem of ambiguity is examined from an optimality-theoretic point of view and from a probabilistic one. The authors show the close relation between optimality-theoretic disambiguation and probabilistic language models. In addition the use of partial, or underspecified representations in syntax and semantics is explored.
Classical complexity questions remain important for practical as well as theoretical reasons. Two papers investigate the complexity of syntactic theories belonging to the Government and Binding family.
and are professors at the Institute for Computational Linguistics (IMS) of the University of Stuttgart. is a senior researcher at the IMS.
- 1 Introduction 1
Christian Rohrer, Antje Rossdeutshcer and Hans Kamp
Part I: German Syntax 27
- 2 Case Assignment in Partially Fronted Constituents 29
Walt Demtar Meurers and Kordula de Kuthy
- 3 Wh-Scope Marking and Partial Movement 65
Part II: Syntax-Semantics/Pragmatics Interface 109
- 4 The Role of Syntactic Features in the Analysis of Dialogue 111
Part III: Syntax-Semantics Interface 143
- 5 Semantic vs. Syntactic Reconstruction 145
- 6 On a Certain Scope Asymmetries in VP Ellipsis Contexts 183
Part IV: Discourse 205
- 7 The Importance of Presupposition 207
- 8 Temporal Underspecification in Discourse 255
Uwe Reyle and Antje Rossdeutscher
Part V: Formal Properties of Grammar 285
- 9 On Minimalist AGs and MTTs 287
Jens Michaelis, Uwe Mönnich and Frank Morawietz
- 10 Minimalist Grammars and Recognition 327
Edward P. Stabler
- 11 Computational Optimality-theoretic Syntax 353
Part VI: Probabalistic Methods for Lexicon Induction 387
- 12 Statistical Grammar Models and Lexicon Acquisition 389
Sabine Schulte Im Walde. Helmut Schmid, Mats Rooth, Stefan Riezler, Detlef Prescher
- Index of Subjects 441
- Index of Names 447