Feb 25

Homework 1

So, as I said when I handed it out, I kind of rushed homework one out the door, lifting it from a late homework from Syntax I that I liked but which I haven’t assigned in years. But there are a couple of things I should have said about it. Now, of course, you should all have already looked at it and so this information should be coming too late, but nevertheless:

First of all, the first three problems ask for trees. I’m not expecting perfection, the main thing really is just a tree that has the basic characteristics. Because the second tree has the verb give in it, I expect you’ll want to include little vP, but there’s no need to mess around with features and so forth. It says “same ground rules as in problem #1” but of course, that was a problem from some homework I didn’t give you. So, there aren’t really many ground rules.

You do need to remind yourself how Binding Theory works. Principle A (anaphors like himself must be bound in their binding domain, which we took to be “the clause”), Principle B (pronouns like him must not be bound in their binding domain), Principle C (r-expressions like “John” must not be bound at all).

Part E sentence (2) involves an “ECM” verb—these are special because the complement of the verb (believe in this case) is just a TP, not a CP. Knowing this allows you to answer the question posed: what is the binding domain, is it TP or CP?

Part F says “Go back to homework #10”, but what it means is, “look above”—I pieced this together from two homework assignments that were numbered 10 and 11, so Part F is about where homework #11 starts.

We’ll talk about it in class—I do hope everyone had a chance to think through it, but the main thing is to try the puzzles and hand something in as evidence that you’ve tried the puzzles.

Jan 13

Home of the CAS LX 523 (Syntax II) course blog

The Spring 2013 course blog will be up and running shortly. At the moment, this is all copied from a previous semester.