Small Navigation Menu

Primary Menu

Syntactic Computation as Labelled Deduction: WH a case study

Citation: Kempson, Ruth and Meyer-Viol, Wilfried and Gabbay, Dov (2000) Syntactic Computation as Labelled Deduction: WH a case study.

This paper addresses the question "Why do WH phenomena occur with the particular cluster of properties observed across languages -- long-distance dependencies, WH-in situ, partial movement constructions, reconstruction, crossover etc." These phenomena have been analysed by invoking a number of discrete principles and categories, but have so far resisted a unified treatment. The explanation proposed is set within a model of natural language understanding in context, where the task of understanding is taken to be the incremental building of a structure over which the semantic content is defined. The formal model is a composite of a labelled type-deduction system, a modal tree logic, and a set of rules for describing the process of interpreting the string as a set of transition states. A dynamic concept of syntax results, in which in addition to an output structure associated with each string (analogous to the level of LF), there is in addition an explicit meta-level description of the process whereby this incremental process takes place. This paper argues that WH-related phenomena can be unified by adopting this dynamic perspective. The main focus of the paper is on WH-initial structures, WH in situ structures, partial movement phenomena, and crossover phenomena. In each case, an analysis is proposed which emerges from the general characterisatioan of WH structures without construction-specific stipulation.Article

Additional Information: Citation: In R. Borsley and I. Roberts (eds.), "Syntactic Categories".
Creators: Kempson, Ruth and Meyer-Viol, Wilfried and Gabbay, Dov and
Subjects: Philosophy
Keywords: Dynamic syntax, Syntactic computation
Divisions: Institute of Philosophy
Collections: London Philosophy Papers
Dates:
  • 2000 (published)
Comments and Suggestions:
Description/Provenance: Submitted by Mark McBride (mark.mcbride@sas.ac.uk) on 2008-01-12T20:23:10Z No. of bitstreams: 1 R_Kempson_Computation.pdf: 172442 bytes, checksum: 4c61ee500a143732a85a644f8d1bda2b (MD5); Description/Provenance: Made available in DSpace on 2008-01-12T20:23:10Z (GMT). No. of bitstreams: 1 R_Kempson_Computation.pdf: 172442 bytes, checksum: 4c61ee500a143732a85a644f8d1bda2b (MD5) Previous issue date: 2000. Date accessioned: 2008-01-12T20:23:10Z; Date available: 2008-01-12T20:23:10Z; Date issued: 2000.

Statistics

View details