From: barker <barker@web>
Date: Fri, 24 Sep 2010 12:23:13 +0000 (-0400)
Subject: (no commit message)
X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=commitdiff_plain;h=aaadc20de94685e29c35abbd865e5f35d194e7b9

---

diff --git a/week2.mdwn b/week2.mdwn
index 3ddbe5b9..a3dce9b7 100644
--- a/week2.mdwn
+++ b/week2.mdwn
@@ -101,8 +101,8 @@ One can do that with a very spare set of basic combinators. These days the stand
 
 There are some well-known linguistic applications of Combinatory
 Logic, due to Anna Szabolcsi, Mark Steedman, and Pauline Jacobson.
-They claim that natural language semantics is a combinatory system (that every
-natural language denotation is a combinator).
+They claim that natural language semantics is a combinatory system: that every
+natural language denotation is a combinator.
 
 For instance, Szabolcsi argues that reflexive pronouns are argument
 duplicators.