![[CS logo]](../t.png)
CMSC 35100 - Natural Language Processing
Winter 2006
Homework #1: Due January 26, 2006
Note: Please answer two of the three problems below.
Problem 1:
(From Jurafsky & Martin 10.4)
Augment the Earley algorithm of Figure 10.16 to enable parse trees to
be retrieved from the chart by modifying the pseudocode for the completer
to as described on page 385.
Hint: Representative output is given in Figure 10.18 in the book.
Problem 2:
(From Jurafsky & Martin 11.4)
Consider the following examples:
- The sheep are baaaaing.
- The sheep is baaaaing.
Create appropriate lexical entries for the words the,
sheep, and baaaaing.. Show that
your entries permit the correct assignment of a value to the
NUMBER feature for the subjects of these examples, as well as their
various parts.
Problem 3
(From Jurafsky & Martin 11.6)
Alter the pseudocode shown in Figure 11.12 so that it performs
the more radical kind of unification parsing described on page 434,
where the non-terminals are simply variable names and their categories
are encoded as features.