11-711 Algorithms for NLP
Sample Final Exam
Fall 2012
Before you go on, write your name at the space provided on the bottom of
this page and every page of the exam.
There are 15 pages in this exam (including this page). Verify that you have a complete
c
11-711: Algorithms for NLP
Homework Assignment #5
Solutions
Out: November 19, 2013
Due: December 5, 2013
Problem 1
Consider the following context-free grammar fragment that has been augmented with feature structures:
(1) VP -> v NP
<v subcat> = +np
<VP ob
i
jj
)i u)&#q
t
y4b)#
7&
jI
j
~
~
jI
i
"(& y 7 y"
0)%| 0b7)&Icfw_ )&00%4 z
ywxY#`HH t
w v Pu c
p " & w 7 8 " " w 7 w 4yyt 4& "t 8 4& 4 f t 7 y" 4 d 7 s 4& 1 k
#%30(6utIb1%0y%0(xy)&0200u()310u0yby)5AuU)&00'tU)3#$!
py(" y 7 " p tyy 8("5 7 t s
0%0utA3hDb100%
11-711: Algorithms for NLP
Homework Assignment #1: Formal Language Theory
Solutions
Out: September 10, 2013
Due: September 24, 2013
Problem 1 [15 points]
Prove that, for any deterministic FSA A = (Q, , , q0 , F ),
(q, xy ) = (q, x) , y
for x, y . Use the
11-711: Algorithms for NLP
Homework Assignment 4b: Deductive Weighted Agenda Parsing
Solutions
Out: October 29, 2013
Due: November 26, 2013
Introduction
This is a continuation of homework 4a. The same background readings and dynamic program are
applicable
11-711: Algorithms for NLP
Homework Assignment 4a: Deductive Weighted Agenda Parsing
Solutions
Out: October 29, 2012
Due: November 7, 2012
Introduction
This assignment involves hands-on coding. To help you with time management, we have divided it
into 2 p
11-711: Algorithms for NLP
Homework Assignment #3: Context Free Grammars and CYK
Parsing
Solutions
Out: October 8, 2012
Due: October 15, 2012
Problem 1 [20 points]
Suppose G is a CFG and we are given a word w L(G) such that |w| = n. What is the exact
deri
11-711: Algorithms for NLP
Homework Assignment #2: OpenFST
Solutions
Out: September 20, 2012
Due: October 9, 2012
Overview
What is a Tokenizer?
A tokenizer is a common pre-processing tool for many Natural Language Processing tasks. Statistical parsers, ma