CBA-2: Difference between revisions

From English Grammar
Jump to navigation Jump to search
No edit summary
 
(25 intermediate revisions by the same user not shown)
Line 1: Line 1:
<font face="Arial, Helvetica, sans-serif">
<font face="Arial, Helvetica, sans-serif">
<font size="3">
<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 ==
== Constraint-based Syntax 2 ==
Line 38: Line 46:
Oral presentation or written work (5 pages) for the seminar which is not the subject of the module examination.
Oral presentation or written work (5 pages) for the seminar which is not the subject of the module examination.


=== Links to Class Materials ===


=== Week 1 ===
[[CBA-2_Week_1|Week 1]]
Week 2


==== New Feature Geometry ====


The geometry of the feature structures of Ginzburg and Sag (from here on simply GS) differs slightly from that of Pollard and Sag (1994). Here is the general structure of a sign:


[[File:GS-feature-geometry.jpg|center|The feature geometry of Ginsburg and Sag (2000)]]
=== Week 2 ===
 
We find the following differences from the earlier feature geometry:
 
# Instead of a SUBCAT list, there is now an ARG-ST. Only signs of type ''word'' have this list-valued attribute. Like SUBCAT, it contains all the syntactic arguments of a word. Unlike SUBCAT, this list is not used for head-driven phrase formation, however! It is used, among others, for the Binding Theory.
# As part of the ''category'' information of the sign, we now find the 3 valence attributes SUBJ, SPR, and COMPS. Together with combinatorial schemas, they drive phrase formation from the information in the head daughter. They have the following properties:
* SUBJ: the list contains 0-1 ''synsem'' objects
* SPR: the list contains 0-1 ''synsem'' object
* Comps: the list contains 0-3 ''synsem'' objects
 
==== Some Words in the New Feature Geometry ====
 
The word ''I'':
 
[[File:Word_I.jpg|The word ''I'']]
 
The word ''a'':
 
[[File:Word_a.jpg|The word ''a'']]
 
 
==== Phrases ====
 
Unlike Pollard and Sag (1994), GS give subtypes to the type ''phrase'' which reflect the functional relationship between the head daughter and the non-head daughter(s). The following phrase types exist:
 
[[File:GS-p32-nr30.jpg]]
 
===== Head-Complement Phrases =====
 
A Head-Complement Phrase is formed from a word and one phrase for each of the ''synsems'' on the head's COMPS list. There has to be a 1:1 relation between the selected ''synsems'' and the phrases:
 
[[File:GS-hd-comp-ph.jpg]]
 
 
===== Head-Specifier Phrases =====
 
In a Head-Specifier Phrase a head combines with a phrase whose ''synsem'' is token-identical to the ''synsem'' on the head's SPR list:
 
[[File:GS-hd-spr-ph.jpg]]
 
===== Head-Subject Phrases =====
 
In a Head-Subject Phrase a head combines with a phrase whose ''synsem'' is token-identical to the ''synsem'' on the head's SUBJ list:
 
[[File:GS-hd-subj-ph.jpg]]
 
Note that unlike in Pollard and Sag (1994), subjects of verbs combine with the head in a Head-Subject Phrase, whereas determiners combine with the nominal they specify in a Head-Specifier Phrase!


=== Homework for next time ===
# Read p. 17-38 in GS (ignore the section on lexemes at the beginning!
# Study the type definitions in these pages and make sure you understand them!
=== Week 2 ===


==== The Argument Realization Principle (ARP) ====
==== The Argument Realization Principle (ARP) ====
Line 164: Line 118:
| type="{}" }
| type="{}" }


<a> &oplus; <b> &oplus; <c> =  < { a,b,c  _8} >  
<> &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>
</quiz>
Line 176: Line 149:
# [SPR  <>]
# [SPR  <>]


Now solve the following equations in accordance with the '''Argument Realization Principle'''.
 


<quiz display=simple>
<quiz display=simple>
{ Solve the equation!
{ 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="{}" }
| type="{}" }


<NP> &oplus; <> &oplus; <PP> =  < { NP,PP _8} >  
[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>


[SUBJ < { NP _8} >]
<quiz display=simple>
[SPR  < { _8} >]
{ Fill in the empty boxes in accordance with the '''Argument Realization Principle'''.
[COMPS  < { PP _8} >]
 
| type="{}" }


[ARG-ST  <NP,PP>]
[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>
</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>
<quiz display=simple>
{ Solve the equation!
{ Fill in the empty boxes in accordance with the '''Argument Realization Principle'''.


| type="{}" }
| type="{}" }


<NP> &oplus; <> &oplus; <> =  < { NP _8} >  
[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>


<quiz display=simple>
<quiz display=simple>
{ Solve the equation!
{ Fill in the empty boxes in accordance with the '''Argument Realization Principle'''.


| type="{}" }
| type="{}" }


<NP> &oplus; <> &oplus; < { PP _8} > =  < NP,PP >  
[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>


<quiz display=simple>
<quiz display=simple>
{ Solve the equation!
{ Fill in the empty boxes in accordance with the '''Argument Realization Principle'''.


| type="{}" }
| type="{}" }


< { NP _8} > &oplus; <> &oplus; < { NP,AP _8} > =  < NP,NP,AP >  
[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>


<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>




-->




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"