FNLP: 17: Dependency Parsing | Open Course Materials

In the previous lecture, we discussed that vanilla PCFGs yield weak parsers, and discussed several of their weakness. We mentioned in passing their inability to capture lexical dependencies . In this folder, we show how lexical dependencies can be incorporated into PCFG models. We also discuss that we may not even need phrase-structure trees in downstream applications, and see how we can parse a sentence directly into dependencies (i.e. dependency parsing).

This folder consists of:

lecture recordings and slides
some required reading from Jurafsky and Martin
a quiz that tests your understanding of the material presented here.

Please do the required reading, and attempt the quiz. If there is anything you don't understand, then please ask questions in the lecture or on piazza.

17: Dependency Parsing

Slides (the slides contain a few slides from the previous section as we have not finished them in lecture 16)

Readings: 14.6 J&M, 2nd edition.

Optionally, you can read chapter 4 from the online edition. Note that it will be much more detailed that the lecture. https://web.stanford.edu/~jurafsky/slp3/18.pdf

Quiz 17: Lexicalization and Dependency Parsing

These questions are designed to test your understanding of the above course content; doing this quiz does not contribute to your overall grade. Some questions require a text answer. You can ask for formative feedback on these from your tutor or on piazza. Other questions are multiple choice or they require a numeric answer: you will get immediate feedback for these. Please don't attempt this quiz until you have acquainted yourself with this lecture and the required reading.

You must be logged onto Learn to do this quiz.

License