projects
/
lambda.git
/ commitdiff
commit
grep
author
committer
pickaxe
?
search:
re
summary
|
shortlog
|
log
|
commit
| commitdiff |
tree
raw
|
patch
|
inline
| side by side (from parent 1:
88b8a69
)
edits
author
Chris
<chris.barker@nyu.edu>
Tue, 12 May 2015 13:19:56 +0000
(09:19 -0400)
committer
Chris
<chris.barker@nyu.edu>
Tue, 12 May 2015 13:19:56 +0000
(09:19 -0400)
topics/_week15_continuation_applications.mdwn
patch
|
blob
|
history
diff --git
a/topics/_week15_continuation_applications.mdwn
b/topics/_week15_continuation_applications.mdwn
index
cc5c9e2
..
b56fcc0
100644
(file)
--- a/
topics/_week15_continuation_applications.mdwn
+++ b/
topics/_week15_continuation_applications.mdwn
@@
-109,7
+109,9
@@
Here, QDP is a scope-taking quantificational DP.
Just to emphasize the similarity between QR and shift, we can use QR
to provide insight into the tree task that mystified us earlier.
Just to emphasize the similarity between QR and shift, we can use QR
to provide insight into the tree task that mystified us earlier.
+<!--
\tree (. (a)((S)((d)((S)(e)))))
\tree (. (a)((S)((d)((S)(e)))))
+-->
<pre>
.
<pre>
.
@@
-126,7
+128,9
@@
a __|___
First we QR the lower shift operator
First we QR the lower shift operator
+<!--
\tree (. (S) ((\\x) ((a)((S)((d)((x)(e)))))))
\tree (. (S) ((\\x) ((a)((S)((d)((x)(e)))))))
+-->
<pre>
.
<pre>
.
@@
-147,7
+151,9
@@
S ___|___
Next, we QR the upper shift operator
Next, we QR the upper shift operator
+<!--
\tree (. (S) ((\\y) ((S) ((\\x) ((a)((y)((d)((x)(e)))))))))
\tree (. (S) ((\\y) ((S) ((\\x) ((a)((y)((d)((x)(e)))))))))
+-->
<pre>
.
<pre>
.
@@
-180,7
+186,9
@@
The relevant value for k is (\x.a(y(d(x e)))). Then k "" is
a(y(d(""(e)))), and k(k "") is a(y(d((a(y(d(""(e)))))(e)))). In tree
form:
a(y(d(""(e)))), and k(k "") is a(y(d((a(y(d(""(e)))))(e)))). In tree
form:
+<!--
\tree (. (S) ((\\y) ((a)((y)((d)(((a)((y)((d)(("")(e)))))(e)))))))
\tree (. (S) ((\\y) ((a)((y)((d)(((a)((y)((d)(("")(e)))))(e)))))))
+-->
<pre>
.
<pre>
.
@@
-211,7
+219,9
@@
S ___|____
Repeating the process for the upper shift operator replaces each
occurrence of y with a copy of the whole tree.
Repeating the process for the upper shift operator replaces each
occurrence of y with a copy of the whole tree.
+<!--
\tree (. ((a)((((a)(("")((d)(((a)(("")((d)(("")(e)))))(e))))))((d)(((a)((((a)(("")((d)(((a)(("")((d)(("")(e)))))(e))))))((d)(("")(e)))))(e))))))
\tree (. ((a)((((a)(("")((d)(((a)(("")((d)(("")(e)))))(e))))))((d)(((a)((((a)(("")((d)(((a)(("")((d)(("")(e)))))(e))))))((d)(("")(e)))))(e))))))
+-->
<pre>
.
<pre>
.