Sale!

Assignment 2: Probability and Vector Exercises

$30.00

5/5 - (2 votes)

601.465/665 — Natural Language Processing
Assignment 2: Probability and Vector Exercises

Only a bit of programming is required for this assignment. Mostly, you’ll solve some penciland-paper problems.
Collaboration: You may discuss each problem with one other student in the class.
However, please write up your answers separately and hand them in separately. Otherwise it’s too
easy (for this homework) to get by without understanding. If you discuss a problem with someone
else, disclose this in your README and mention your partner’s name.
Piazza: For questions about the assignment, put the Question Number at the front of the
subject header so that it is easier for people to find related posts. E.g., “3a) Why does …?”
How to hand in your work: Put all notes, documentation, and answers to questions in a
README.pdf file, and submit it via Gradescope. You will submit your code separately.
Notation: When you are writing README.pdf file, you will need some way of typing mathematical symbols. A good option is to use LATEX. Alternatively, you could try the equation editor
in Google Docs or another word processor, or you could embed scans or photos of your neatly
handwritten equations.
If you must type plain text, please pick one of the following three notations and use it consistently
throughout your assignment. (If you need some additional notation not described here, just describe
it clearly and use it.) Use parentheses as needed to disambiguate division and other operators.
Text Picts LATEX
p(x | y) p(x | y) p(x | y) p(x \mid y)
¬x NOT x ~x \neg x
x¯ (set complement) COMPL(x) \x \bar{x}
x ⊆ y x SUBSET y x {= y x \subseteq y
x ⊇ y x SUPERSET y x }= y x \supseteq y
x ∪ y x UNION y x U y x \cup y
x ∩ y x INTERSECT y x ^ y x \cap y
x ≥ y x GREATEREQ y x >= y x \geq y
x ≤ y x LESSEQ y x <= y x \leq y
∅ (empty set) NULL 0 \emptyset
E (event space) E E E
1 1. These short problems will help you get the hang of manipulating probabilities. Let E 6= ∅
denote the event space (it’s just a set, also known as the outcome space or sample space),
and p be a function that assigns a real number in [0, 1] to any subset of E. This number is
called the probability of the subset.
You are told that p satisfies the following two axioms: p(E) = 1. p(X ∪ Y ) = p(X) + p(Y )
provided that X ∩ Y = ∅.
1
As a matter of notation, remember that the conditional probability p(X | Z)
def =
p(X∩Z)
p(Z)
.
For example, singing in the rain is one of my favorite rainy-day activities: so my ratio
p(singing | rainy) = p(singing AND rainy)
p(rainy) is high. Here the predicate “singing” picks out the
set of singing events in E, “rainy” picks out the set of rainy events, and the conjoined predicate “singing AND rainy” picks out the intersection of these two sets—that is, all events that
are both singing AND rainy.
(a) Prove from the axioms that if Y ⊆ Z, then p(Y ) ≤ p(Z).
You may use any and all set manipulations you like. Remember that p(A) = 0 does
not imply that A = ∅ (why not?), and similarly, that p(B) = p(C) does not imply that
B = C (even if B ⊆ C).
(b) Use the above fact to prove that conditional probabilities p(X | Z), just like ordinary
probabilities, always fall in the range [0, 1].
(c) Prove from the axioms that p(∅) = 0.
(d) Let X¯ denote E − X. Prove from the axioms that p(X) = 1 − p(X¯). For example,
p(singing) = 1 − p(NOT singing).
(e) Prove from the axioms that p(singing AND rainy | rainy) = p(singing | rainy).
(f) Prove from the axioms that p(X | Y ) = 1 − p(X¯ | Y ). For example, p(singing | rainy) =
1 − p(NOT singing | rainy). This is a generalization of 1d.
(g) Simplify:
p(X | Y ) · p(Y ) + p(X | Y¯ ) · p(Y¯ )

· p(Z¯ | X)/p(Z¯)
(h) Under what conditions is it true that p(singing OR rainy) = p(singing) + p(rainy)?
(i) Under what conditions is it true that p(singing AND rainy) = p(singing) · p(rainy)?
(j) Suppose you know that p(X | Y ) = 0. Prove that p(X | Y, Z) = 0.2
(k) Suppose you know that p(W | Y ) = 1. Prove that p(W | Y, Z) = 1.
2 2. All cars are either red or blue. The witness claimed the car that hit the pedestrian was blue.
Witnesses are believed to be about 80% reliable in reporting car color (regardless of the actual
car color). But only 10% of all cars are blue.
(a) Write an equation relating the following quantities and perhaps other quantities:
p(Actual = blue)
p(Actual = blue | Claimed = blue)
p(Claimed = blue | Actual = blue)
1
In fact, probability functions p are also required to satisfy a generalization of this second axiom: if X1, X2, X3, . . .
is an infinite sequence of disjoint sets, then p(
S∞
i=1 Xi) = P∞
i=1 p(Xi). But you don’t need this for this assignment.
2More precisely, p(X | Y, Z) could be either 0 or undefined, namely 0/0. (There do exist advanced ways to redefine
conditional probability to avoid this 0/0 problem. Even then, though, one may want a probability measure p to leave
some probabilities or conditional probabilities undefined. This turns out to be important for reasons beyond the
scope of this course: e.g. http://en.wikipedia.org/wiki/Vitali_set.)

Reminder: Here, Claimed and Actual are random variables, which means that they are
functions over some outcome space. For example, the probability that Claimed = blue
really means the probability of getting an outcome x such that Claimed(x) = blue.
We are implicitly assuming that the space of outcomes x is something like the set of
witnessed car accidents.
(b) Match the three probabilities above with the following terms: prior probability, likelihood
of the evidence, posterior probability.
(c) Give the values of all three probabilities. (Hint: Use Bayes’ Theorem.) Which probability
should the judge care about?
(d) Let’s suppose the numbers 80% and 10% are specific to Baltimore. So in the previous
problem, you were implicitly using the following more general version of Bayes’ Theorem:
p(A | B, Y ) = p(B | A, Y ) · p(A | Y )
p(B | Y )
where Y is city = Baltimore. Just as 1f generalized 1d, by adding a “background”
condition Y , this version generalizes Bayes’ Theorem. Carefully prove it.
(e) Now prove the more detailed version
p(A | B, Y ) = p(B | A, Y ) · p(A | Y )
p(B | A, Y ) · p(A | Y ) + p(B | A, Y ¯ ) · p(A¯ | Y )
which gives a practical way of finding the denominator in the question 2d.
(f) Write out the equation given in question 2e with A, B, and Y replaced by specific
propositions from the red-and-blue car problem. For example, Y is “city = Baltimore”
(or just “Baltimore” for short). Now replace the probabilities with actual numbers from
the problem, such as 0.8.
Yeah, it’s a mickeymouse problem, but I promise that writing out a real case of this
important formula won’t kill you, and may even be good for you (like, on an exam).
3 3. Beavers can make three cries, which they use to communicate. bwa and bwee usually mean
something like “come” and “go” respectively, and are used during dam maintenance. kiki
means “watch out!” The following conditional probability table shows the probability of
the various cries in different situations.
p(cry | situation) Predator! Timber! I need help!
bwa 0 0.1 0.8
bwee 0 0.6 0.1
kiki 1.0 0.3 0.1
(a) Notice that each column of the above table sums to 1. Write an equation stating this,
in the form P
variable p(· · ·) = 1.
3
(b) A certain colony of beavers has already cut down all the trees around their dam. As
there are no more to chew, p(timber) = 0. Getting rid of the trees has also reduced
p(predator) to 0.2. These facts are shown in the following joint probability table.
Fill in the rest of the table, using the previous table and the laws of probability. (Note
that the meaning of each table is given in its top left cell.)
p(cry, situation) Predator! Timber! I need help! TOTAL
bwa
bwee
kiki
TOTAL 0.2 0
(c) A beaver in this colony cries kiki. Given this cry, other beavers try to figure out the
probability that there is a predator.
i. This probability is written as: p( )
ii. It can be rewritten without the | symbol as:
iii. Using the above tables, its value is:
iv. Alternatively, Bayes’ Theorem allows you to express this probability as:
p() · p()
p() · p() + p() · p() + p() · p()
v. Using the above tables, the value of this is:
·
· + · + ·
This should give the same result as in part iii., and it should be clear that they
are really the same computation—by constructing table (b) and doing part iii., you
were implicitly using Bayes’ Theorem.
4 4. A language model is a probability function p that assigns probabilities to word sequences
such as ~w = (arya, loves, soy, lint).
Suppose ~w = w1w2 · · · wn (a sequence of n words). A trigram language model defines
p( ~w)
def =
nY
+1
i=1
p(wi
| wi−2, wi−1) (1)
where by convention we define wn+1 = eos (“end of sequence”) and w0 = w−1 = bos
(“beginning of sequence”).
For example, the model says that a speaker who says “arya loves soy lint” has generated
the sequence in left-to-right order, by rolling 5 dice that happened to land on arya, loves, soy, lint, eos.
Each roll uses a special die selected by the two previously rolled characters (or bos).
(a) Explicitly write out p(w1w2w3w4) when you use naive estimates of the parameters, such
as
p(w4 | w2, w3)
def =
c(w2w3w4)
c(w2w3)
(2)
4
where c(w2w3w4) denotes the count of times the trigram w2w3w4 was observed in
a training corpus. The following terms will appear in your formula: c(bos bos),
c(bos bos arya), c(soy lint eos). Explain what each of these terms are.
Remark: Naive parameter estimates of this sort are called maximum-likelihood estimates (MLE). They have the advantage that they maximize the probability (equivalently, minimize the perplexity) of the training data. But they will generally perform
badly on test data, unless the training data were so abundant as to include all possible
trigrams many times. This is why we must smooth these estimates in practice.
(b) In the data you will use in the next assignment, a sequence may be very long. While
the sequence is still preceded by bos and terminated with eos, each linguistic sentence
within the sequence is delimited by <s> at the start and </s> at the end. For example,
the following single sequence consists of 3 linguistic sentences:
<s> do you think so </s> <s> yes </s> <s> at least i thought so </s>
Given English training data, the probability of
<s> do you think the </s>
should be extremely low under any good language model. Why? In the case of the trigram model, which parameter or parameters are responsible for making this probability
low?
(c) You turn on the radio as it is broadcasting an interview. Assuming a trigram model,
match up expressions (A), (B), (C) with descriptions (1), (2), (3):
The expression
(A) p(do) · p(you | do) · p(think | do, you)
(B) p(do | <s>) · p(you | <s>, do) · p(think | do, you) · p(</s> | you, think)
(C) p(do | <s>) · p(you | <s>, do) · p(think | do, you)
represents the probability that
(1) the first complete sentence you hear is do you think
(2) the first 3 words you hear are do you think
(3) the first complete sentence you hear starts with do you think
Explain your answers briefly. Remark: The distinctions matter because ”do” is more
probable at the start of an English sentence than in the middle, and because (3) describes
a larger event set than (1) does.
Note: One could also define a kind of reversed trigram language model preversed that
instead assumed the words were generated in reverse order (“from right to left”):
preversed( ~w)
def =
Yn
i=0
p(wi
| wi+1, wi+2) (3)
where by convention we define w0 = bos and wn+1 = wn+2 = eos. In this case, the
generating process stops when we hit bos, instead of eos. This idea is used to great
success is modern NLP language modeling methods (bidirectional RNNs).
5
5. How might you use log-linear models in linguistics? This answer will be submitted only as a
5 Piazza note (NOT in your README). Post a new note on Piazza (a note, not a question)
with a subject line “[my idea].” and Select the folder “Log-linear-model-for”.
• Think over your own interests in linguistics, NLP, or a related field.
In your note, give an example of a conditional distribution p(y | x) that would be
interesting to model. Your goal here might be to predict y from x, or to understand the
properties of x that are predictive of y.
Be clear about both your real-world problem and your model of it. In particular, be
precise about what the formal objects x and y are—numbers? strings? arrays? trees?—
and what x and y represent in the real world. We will post an “official example”
on Piazza to illustrate the form of a good answer.
5 • Alternatively, respond to someone else’s Piazza post that you found interesting. Suggest some new features fk(x, y) that would be useful for their problem. Or suggest
changes to the problem setup (e.g., the choice of x and y) or to other people’s features.
Be precise when describing your feature functions. Don’t just say “the amount of pseudoscience words used in the text.” That’s a certainly a good starting thought—but how should
your program identify “pseudoscience words”? (Would you need to supply it with a list of
such words, or could you somehow pluck them automatically from a corpus of pseudoscience
articles?) And how exactly would your feature function measure this “amount”? (Should it
return an integer count? A fraction? The log of a fraction?)
Consider designing a large, systematic set of feature functions—hundreds or thousands that
might help prediction, not just 3 or 4 that should help. Hopefully, optimizing the weights will
find the features that do help and give weight ≈ 0 to the others. For example, instead of
a single feature that fires whenever it sees a pseudoscience word, you could create separate
features that fire for each word from “aardvark” to “zebra,” and hope that the system will
learn to put a positive weight on “megalithic” and a negative weight on “t-test.”
Warning: If you’re trying to predict different probabilities for different y values, then your
feature vector ~f(x, y) needs to be different for different y values, too. Suppose you are given
a text x and you’re trying to predict its author’s age y. If (for a given x) your features fire in
the same way on all ages y, then all ages will have the same probability: p(0 | x) = p(1 | x) =
p(2 | x) = . . . = p(99 | x) = 1
100 . So don’t use a feature like “f3(x, y) = 1 if x contains an
emoji.” You will need a set of more specific features that depend on y, such as “f3(x, y) = 1
if x contains an emoji and y < 18.”3
3
If this feature has positive weight, then an emoji raises the probability that the author is a minor. Specifically, it
raises the probabilities that y = 0, y = 1, . . . , y = 17, which means lowering the probabilities that y = 18, y = 19, . . ..
The bad version that doesn’t test y tries to raise the probabilities of all ages at once—but this has no effect after
normalization: doubling all of the unnormalized probabilities doesn’t change their ratios.
6
6. Extra credit: This problem is supposed to convince you that logical reasoning is is just
a special case of probabilistic reasoning.4 That is, probability theory allows you to draw a
conclusion from some premises like “If there’s no nail, then there’s definitely no shoe.”
(a) p(¬shoe | ¬nail) = 1 For want of a nail the shoe was lost,
(b) p(¬horse | ¬shoe) = 1 For want of a shoe the horse was lost,
(c) p(¬race | ¬horse) = 1 For want of a horse the race was lost,
(d) p(¬fortune | ¬race) = 1 For want of a race the fortune was lost,
(e) p(¬fortune | ¬nail) = 1 And all for the want of a horseshoe nail.
✌6 Show carefully that (e) follows from (a)–(d). Hint: Consider
p(¬fortune, ¬race, ¬horse, ¬shoe | ¬nail),
as well as the “chain rule” and problems 1a, 1b, and 1k.
Note: The ¬ symbol denotes the boolean operator NOT.
4An excellent and wide-ranging book developing this theme is Probability Theory: The Logic of Science, by the
influential statistician E. T. Jaynes. See http://bayes.wustl.edu/ for more readings.
7

Scroll to Top