Final

Due Thursday 12/16, to Canvas by 11:59pm (pdf only).

This exam counts for 35% of your course grade.

No late finals will be accepted.

Note 1: You may not discuss the final with other students (until after everyone has turned it in). Please send any questions about the final directly to me (via email) rather than posting on Canvas. I will respond by email and post answers as appropriate on the Canvas. Please read the Canvas discussion.

Note 2: Finals will be graded exactly as turned in via Canvas. It is the student's responsibility to double check that the pdf file is correct and legible.

This final has two problems, each of which has two parts.

Problem 1. A Tree (60pts)

A. Draw a tree for the following sentence, using the grammar from the textbook (Appendix A, plus the answer to Ch 8 Problem 2, available through the answer keys page on Canvas) and according to the instructions below. (NB: This problem is not only about long distance dependencies, but also about multiple phenomena involving the rules and principles of our grammar.)

• This recipe is designed to be easy to prepare and simple to get ingredients for.

Instructions

1. Show the whole tree (i.e., no triangles under nodes).
2. Assume lexical entries for the words instantiating appropriate types from the grammar. Specific tips:
   • There is one ocv-lxm.
   • There are two easy-type adjectives.
   • The preposition is functioning as a modifier of a VP.
   • Five different phrase structure rules are used, one nine different times.
   • You are not asked to show ARG-ST values, but it may be helpful to work out what they are.
3. Label each node with an appropriate abbreviation (e.g., NP). Use CONJ as the abbreviation for a feature structure that is [HEAD conj].
4. Show the values of SPR, COMPS, MOD, GAP, and STOP-GAP where they are non-empty. These values should include tags where they are identified with other structures in the tree (whole nodes or the value of SPR, COMPS, GAP and/or STOP-GAP on other nodes). At least one instance of each tag should be associated with a category abbreivation (e.g. NP). If the grammar requires coindexing (but not complete identification), show that with a subcript (NP_i).
5. Please do NOT show the value for any other features.
6. Likewise, please do NOT show feature paths like SYN and VAL.The tree is big enough as it is! To give you a sense of the level of detail I am looking for, here is a sample tree for a different (shorter) sentence:

   

7. Check your work: The correct tree has 29 nodes, not counting the leaves (word forms). I found 46 non-empty values for SPR, COMPS, MOD, GAP and STOP-GAP collectively. I used tags numbered 0-17, plus the index i. (You don't have to use the exact same numbers in the same places; this is meant to help you check that you have the right number of sets of identities.)

B. Describe each step in the cascade of identities that link the INST value of the recipe predication to the PREPARED value of prepare predication. Your answer should take the form of an enumerated list. Each item in the list should describe one step, i.e., state which features are required to have the same value and state which lexical entry, rule or principle of the grammar requires this.

Hints:

1. I found 32 steps in this chain.
2. You do not need to mention any lexical rules, nor any specific lexical types. Identities that come from either can be described as enforced by the lexical entries themselves.
3. You should, however, account for identities required by the ARP (I found 11 of those).
4. The Semantic Compositionality Principle is not involved at any point in this chain.

Please format your answer as a table, following the example below, where I given you the first and last links in the chain, plus one from the middle. (NB: The assignment of members of the identity as 'first' and 'second' is arbitrary, and either order is acceptable. Similarly, the steps can be listed in any order, though the problem should be easier if you follow the chain step by step.)

Number each step and do not give more than 32. (I will only grade the first 32 that you list.)

If you are formatting your exam in latex, please use this template for the table.

	Grammar entity (lex entry, phrase structure rule, principle)	First member of identity	Second member of identity
1.	Lexical entry for recipe	The INDEX value of N recipe	the INST value of the recipe predication
...
N.	ARP	second element of the ARG-ST of the V designed	sole element of the COMPS list of the V designed
...
32.	Lexical entry for prepare	INDEX value of the second element of the ARG-ST of the V prepare	PREPARED value of the prepare predication

Problem 2. Some Lexical Rules (40pts)

A. For each word in the following sentence, list the lexical rules involved in licensing its word structure.

• Didn't Dana expect it to bother Chris that Kim sneezed?

Notes:

• Again, this question is cumulative, and not about any one particular phenomenon.
• Use the grammar in Appendix A for reference.
• While the question doesn't ask for lexical types, in order to answer it, you'll need to determine the lexical types for each of the relevant lexical entries.
• While you do not need to provide a tree for your answer, it might help you work through the problem to sketch one out.

Check your work: Though there are 10 words in the sentence, they collectively represent 13 applications of lexical rules. One lexical rule is used 5 times.

B. Show the word structure for didn't as it appears in this sentence. Include the effects of the lexical rule(s) it undergoes as well as constraints inherited from types (e.g., those on auxv-lxm and its supertypes, as well as those on word). You don't need to show the RESTR values of the elements of the ARG-ST and valence lists or any other information that is underspecified by the combination of the lexical entry and lexcial rules but rather 'unifed in' from other parts of the tree.

Hint: My answer has 40 features in it, including both those with simple values (e.g. +) and those with complex values.