CBA-2: Difference between revisions

From English Grammar
Jump to navigation Jump to search
No edit summary
 
(45 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 37: Line 45:


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 ===
[[CBA-2_Week_1|Week 1]]
Week 2




=== 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:
==== The Argument Realization Principle (ARP) ====


[[File:GS-feature-geometry.jpg|center|The feature geometry of Ginsburg and Sag (2000)]]
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>


We find the following differences from the earlier feature geometry:
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.


# 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.
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:
# 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 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 word ''I'':
The following exercises have the purpose of showing that the 4 statements above must be true.


[[File:Word_I.jpg|The word ''I'']]
==== Exercises on the  ''append'' relationship (&oplus;) ====


The word ''a'':


[[File:Word_a.jpg|The word ''a'']]
'''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>


==== Phrases ====
<quiz display=simple>
{ Solve the equation!


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:
| type="{}" }


[[File:GS-p32-nr30.jpg]]
<a,b> &oplus; <d,c> =  < { a,b,d,c _8} >


===== Head-Complement Phrases =====
</quiz>


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


[[File:GS-hd-comp-ph.jpg]]
| type="{}" }


<> &oplus; <d,c> =  < { d,c _8} >


===== Head-Specifier Phrases =====
</quiz>


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


[[File:GS-hd-spr-ph.jpg]]
| type="{}" }


===== Head-Subject Phrases =====
<> &oplus; <> &oplus; <> =   < {  _8} >


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:
</quiz>


[[File:GS-hd-subj-ph.jpg]]
<quiz display=simple>
{ Solve the equation!


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!
| type="{}" }


=== Homework for next time ===
<> &oplus; <d> &oplus; <> =   < { d _8} >


# Read p. 17-38 in GS (ignore the section on lexemes at the beginning!
</quiz>
# Study the type definitions in these pages and make sure you understand them!


</font>
<quiz display=simple>
{ Solve the equation!


=== Week 2 ===
| type="{}" }


==== The Argument Realization Principle (ARP) ====
<> &oplus; <> &oplus; <d> =   < { d _8} >


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''':
</quiz>


[[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.
<quiz display=simple>
{ Solve the equation!


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:
| type="{}" }


# The ARG-ST must have at least one element on it.
<d> &oplus; <> &oplus; <> =  < { d _8} >
# 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.
</quiz>


==== Exercises on the ARG-ST and the valence lists of words of part of speech ''v'' ====
==== Exercises on the ARG-ST and the valence lists of words of part of speech ''v'' ====


The ''append'' relationship (&oplus;)
 
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>
<quiz display=simple>
{ Solve the equation!
{ Fill in the empty boxes in accordance with the '''Argument Realization Principle'''.


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


<a,b> &oplus; <c,d> =  { <a,b,c,d> _15}
[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>


<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 >]
[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="{}" }
| type="{}" }


<a,b> &oplus; <d,c> =  { <abcd> _15}
[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="{}" }


<> &oplus; <d,c> =  { <d,c> _15}
[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="{}" }


<> &oplus; <> &oplus; <> =  { <> _15}  
[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>
<quiz display=simple>
{ Solve the equation!
{ Fill in the empty boxes in accordance with the '''Argument Realization Principle'''.


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


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