Ling 566: Intro Syntax for Computational Linguistics

Midterm Exam

Due 11/13 11:59pm

No collaboration. Send questions directly to me by email, and I will post Q&A on Canvas. You are strongly encouraged to subscribe to the Canvas discussion for the midterm so that you get updates by email. I won't be answering questions after the end of the workday on 11/13.

The late policy applies to the midterm as well. Unless you make prior arrangements with me, midterms submitted late but by 11:59pm on 11/14 will receive 80% credit. Midterms submitted late but by 11:59pm on 11/15 will receive 70% credit. Midterms will not be accepted after 11:59pm on 11/15 (again, except by prior arrangement). Don't be late!

Please follow the same formatting policy as for homework (as specified on the main course page).

• Chapter 10, Problem 1

  Note: Your answer should include an ARG-ST for each passive verb in (i)-(viii) as they appear in those sentences, as well as an explanation of whether and how these ARG-STs together with the Binding Principles predict the acceptability judgments shown in (i)-(viii).

• Chapter 10, Problem 3

  NOTE 10.3 was revised somewhat between printings. Please answer this version.

• Question 3, as follows:

  Consider the sentence Throw Sandy your keys and Pat's phone!. Using the grammar as developed through Ch 10:

  1. For each word in the sentence, identify the lexical type of the lexical entry that licenses it.
  2. For each word in the sentence, specify what lexical rule licenses it.
  3. Draw a tree showing the structure assigned to this sentence, using abbreviations defined on p.279 for the nodes. Use D as the abbreviation for nodes that are [HEAD det] and have a non-empty SPR value. Use CONJ as the abbreviation for a node that is [ HEAD conj ].
  4. Draw another tree showing the same structure. This time, use feature structures for the nodes, showing only the value of SPR, COMPS and ARG-ST (where appropriate) on each node, using abbreviations such as NP for the elements of these lists. Use tags to show identities between elements of these lists and elements of other lists or nodes in the tree. You should show all identities required by all principles and rules, but don't need to show identity between empty lists.
  5. Describe the chain of identities that links the RECIPIENT role of the throw predication to the NAMED role of the name predication for Sandy. Each link should say what two values are identified and what part of the grammar (lexical entry, rule, or principle) identifies them. [Hint: I find four links in this chain, including one required by the Argument Realization Principle.]
  6. In the fully resolved tree, what is the PER value on the node (of type word) directly above Throw (at the path SYN | HEAD | AGR)? What rules and principles constrain this PER value? [Hint: I find 3.]

Please create a pdf file and upload it to Canvas.