CBA-2: Difference between revisions

From English Grammar
Jump to navigation Jump to search
(Created page with "== Constraint-based Analysis - Syntax 2 ==")
 
No edit summary
 
(84 intermediate revisions by the same user not shown)
Line 1: Line 1:
== Constraint-based Analysis - Syntax 2 ==
<font face="Arial, Helvetica, sans-serif">
<font size="5">
 
This page is outdated and has been replaced by [[Constraint_based_Syntax_2|Constraint-based Syntax 2]] .
 
 
 
</font>
 
<!--
 
== Constraint-based Syntax 2 ==
 
=== Welcome and Prospect ===
 
This course continues the course Constraint-based Analysis taught by Prof. Webelhuth in the previous semester. Constraint-based Analysis introduced the major theoretical techniques of the theory of Head-Driven Phrase Structure Grammar: types and type hierarchies, feature structures, constraints, and the six syntactic schemata proposed in Pollard and Sag (1994).
 
Constraint-based Syntax 2 focuses less on techniques and more on the structure of English. It illustrates that the techniques acquired by the students in the previous course are sufficient to develop concrete and insightful analyses of many English constructions, including the following: interrogative and relative clauses, passive sentences, and several varieties of infinitives.
 
=== Readings ===
 
We will read several chapters from the following book:
 
Ginzburg, Jonathan and Ivan Sag (2000). ''Interrogative Investigations: The Form, Meaning and Use of English Interrogatives.'' Stanford: CSLI.
 
=== Online Grammars ===
 
In order to prove the consistency and precision of the theory, we will again work with online grammars. These are available permanently. Here are the links to the grammars:
 
[http://141.2.159.95:7001/wt/ Online Grammar for Chapter 2: HPSG Background]
 
=== OLAT ===
 
The OLAT course for CBA-2 is at [https://olat.server.uni-frankfurt.de/olat/auth/RepositoryEntry/4656037907/CourseNode/95248000257107?2 Constraint-based Syntax 2 on OLAT].
 
=== Course and Module Requirements ===
 
'''Constraint-based Syntax 2''' is Seminar A in the '''Core module Constraint-based Grammar''' (LING-CORE-CON). Seminar B is '''Constraint-based Semantics'''. The Modulhandbuch specifies the following requirements for the module:
 
1. Module Assessment
 
Seminar paper of about 15-20 standard pages (6,000-8,000 words, max. 4 weeks to complete / full time) or a 30-minute oral examination relating to seminar A or B. At the beginning of the seminar, the lecturer in charge will determine the possible forms of examinations.
 
2. Performance record
 
Oral presentation or written work (5 pages) for the seminar which is not the subject of the module examination.
 
=== Links to Class Materials ===
 
[[CBA-2_Week_1|Week 1]]
Week 2
 
 
 
=== Week 2 ===
 
 
==== The Argument Realization Principle (ARP) ====
 
Recall that in GS the syntactic arguments of a word are in a sense represented twice: once on the ARG-ST (argument structure) list which, among others, is used for Binding Theory, and again on one of the valence lists SUBJ, SPR, and COMPS.  Rather than being arbitrary, the relationship between the ARG-S and the valence lists is governed by the '''Argument Realization Principle''':
 
[[File:GS-p23-nr7.jpg]]<br>
 
In words, the principle says that the ARG-ST list is the result of merging the three valence lists into one list, with the elements of the SUBJ list coming first, followed by the elements on the SPR list, followed by the elements on the COMPS list.
 
Besides the ARP, the valence properties of words depend on their part of speech. Thus, all words of part of speech ''v'' must have a SUBJ list with exactly one element on it and a SPR list which is empty. In combination with the ARP, verbs of part of speech ''v'' thus must have the following properties:
 
# The ARG-ST must have at least one element on it.
# The first element of the ARG-ST is also the single element on the SUBJ list.
# If there are additional elements on the ARG-ST, then these elements also occur on the COMPS list.
# The elements which appear both on the ARG-ST and the COMPS list, appear in the same order on both lists.
 
The following exercises have the purpose of showing that the 4 statements above must be true.
 
==== Exercises on the  ''append'' relationship (&oplus;) ====
 
 
'''Solved example:'''
Solve the equation!
<a,b> &oplus; <c,d> = < ___________ >
Type "a,b,c,d" into the text box to get the correct solution:
Solution: < a,b,c,d >
<br>
 
'''Now it is your turn:'''
<br><br>
 
<quiz display=simple>
{ Solve the equation!
 
| type="{}" }
 
<a,b> &oplus; <d,c> =  < { a,b,d,c _8} >
 
</quiz>
 
<quiz display=simple>
{ Solve the equation!
 
| type="{}" }
 
<> &oplus; <d,c> =  < { d,c _8} >
 
</quiz>
 
<quiz display=simple>
{ Solve the equation!
 
| type="{}" }
 
<> &oplus; <> &oplus; <> =  < {  _8} >
 
</quiz>
 
<quiz display=simple>
{ Solve the equation!
 
| type="{}" }
 
<> &oplus; <d> &oplus; <> =  < { d _8} >
 
</quiz>
 
<quiz display=simple>
{ Solve the equation!
 
| type="{}" }
 
<> &oplus; <> &oplus; <d> =  < { d _8} >
 
</quiz>
 
 
<quiz display=simple>
{ Solve the equation!
 
| type="{}" }
 
<d> &oplus; <> &oplus; <> =  < { d _8} >
 
</quiz>
 
==== Exercises on the ARG-ST and the valence lists of words of part of speech ''v'' ====
 
 
Assume the following two constraints on the valence of words of part of speech ''v'':
 
# [SUBJ <synsem>]
# [SPR  <>]
 
 
 
<quiz display=simple>
{ Fill in the empty boxes in accordance with the '''Argument Realization Principle'''.
 
| type="{}" }
 
[HEAD  &nbsp;&nbsp;&nbsp;&nbsp; ''v'' ]
[SUBJ  &nbsp;&nbsp;&nbsp;&nbsp;< { NP _8} >]
[SPR    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;< { - _8} >]
[COMPS  < { PP _8} >]
<br>
[ARG-ST  <NP,PP>]
 
</quiz>
 
<quiz display=simple>
{ Fill in the empty boxes in accordance with the '''Argument Realization Principle'''.
 
| type="{}" }
 
[HEAD  &nbsp;&nbsp;&nbsp;&nbsp; ''v'' ]
[SUBJ  &nbsp;&nbsp;&nbsp;&nbsp;< { NP _8} >]
[SPR    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;< { - _8} >]
[COMPS  < { - _8} >]
<br>
[ARG-ST  <NP>]
 
</quiz>
 
<quiz display=simple>
{ Fill in the empty boxes in accordance with the '''Argument Realization Principle'''.
 
| type="{}" }
 
[HEAD  &nbsp;&nbsp;&nbsp;&nbsp; ''v'' ]
[SUBJ  &nbsp;&nbsp;&nbsp;&nbsp;< { NP _8} >]
[SPR    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;< { - _8} >]
[COMPS  < { NP _8} >]
<br>
[ARG-ST  <NP,NP>]
 
</quiz>
 
<quiz display=simple>
{ Fill in the empty boxes in accordance with the '''Argument Realization Principle'''.
 
| type="{}" }
 
[HEAD  &nbsp;&nbsp;&nbsp;&nbsp; ''v'' ]
[SUBJ  &nbsp;&nbsp;&nbsp;&nbsp;< NP >]
[SPR    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;<  >]
[COMPS  < AP >]
<br>
[ARG-ST  <{  _8}>]
 
</quiz>
 
 
==== Exercises on the ARG-ST and the valence lists of common nouns  ====
 
 
Assume the following two constraints on the valence of common nouns (words like ''cat, dog, student, table'':
 
# [SUBJ <>]
# [SPR  <synsem>]
 
Assume that all the following exercises involve common nouns!
 
<quiz display=simple>
{ Fill in the empty boxes in accordance with the '''Argument Realization Principle'''.
 
| type="{}" }
 
[HEAD  &nbsp;&nbsp;&nbsp;&nbsp; ''n'' ]
[SUBJ  &nbsp;&nbsp;&nbsp;&nbsp;< {-  _8} >]
[SPR    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;< { D _8} >]
[COMPS  < { - _8} >]
<br>
[ARG-ST  <D>]
 
</quiz>
 
<quiz display=simple>
{ Fill in the empty boxes in accordance with the '''Argument Realization Principle'''.
 
| type="{}" }
 
[HEAD  &nbsp;&nbsp;&nbsp;&nbsp; ''n'' ]
[SUBJ  &nbsp;&nbsp;&nbsp;&nbsp;< { - _8} >]
[SPR    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;< { D _8} >]
[COMPS  < { PP _8} >]
<br>
[ARG-ST  <D,PP>]
 
</quiz>
 
<quiz display=simple>
{ Fill in the empty boxes in accordance with the '''Argument Realization Principle'''.
 
| type="{}" }
 
[HEAD  &nbsp;&nbsp;&nbsp;&nbsp; ''n'' ]
[SUBJ  &nbsp;&nbsp;&nbsp;&nbsp;< >]
[SPR    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;< { D _8} >]
[COMPS  < { S _8} >]
<br>
[ARG-ST  < { D,S _8} >]
 
</quiz>
 
<quiz display=simple>
{ Fill in the empty boxes in accordance with the '''Argument Realization Principle'''.
 
| type="{}" }
 
[HEAD  &nbsp;&nbsp;&nbsp;&nbsp; ''n'' ]
[SUBJ  &nbsp;&nbsp;&nbsp;&nbsp;< - >]
[SPR    &nbsp;&nbsp;&nbsp;&nbsp;&nbsp;&nbsp;< D >]
[COMPS  < VP >]
<br>
[ARG-ST  <{ D,VP _8}>]
 
</quiz>
 
 
-->
 
 
 
 
 
 
 
 
 
 
 
 
 
 
 
</font>

Latest revision as of 15:49, 21 April 2017

This page is outdated and has been replaced by Constraint-based Syntax 2 .










Retrieved from "https://www.english-linguistics.de/grammarparadise/wiki/index.php?title=CBA-2&oldid=612"