X-Git-Url: http://lambda.jimpryor.net/git/gitweb.cgi?p=lambda.git;a=blobdiff_plain;f=assignment10.mdwn;h=004f8dfb22ebb43233c2b15c038ad4a98a081494;hp=1a17b13ce692194de688c82a9dcc8327caac4363;hb=a1a38a5cfaede25b7e6299cac3275e1ccfd9b2db;hpb=0d7b3e7a98bc48ad86a61f418f637197742d6421;ds=sidebyside

diff --git a/assignment10.mdwn b/assignment10.mdwn
index 1a17b13c..004f8dfb 100644
--- a/assignment10.mdwn
+++ b/assignment10.mdwn
@@ -28,8 +28,9 @@ Of course, if you need help or want us to review your efforts, we'll be glad to
 
 	As Ken Shan points out, this is an instance of the algorithm
 	for converting name/year citations (like 'see Montague 1970')
-	to numerals corresponding to their ('see [24]').  Except that
-	bibliograpic numerals don't start with zero.
+	to numerals corresponding to their position in the
+	bibliography ('see [24]').  Except that bibliographic numerals
+	don't start with zero.
 
 	Give some thought to efficiency: there are straightforward
 	solutions that involve traversing the tree once (in order to,
@@ -42,8 +43,9 @@ Of course, if you need help or want us to review your efforts, we'll be glad to
 	its number of occurrences in the tree.  Is there any way to do
 	that with a single traversal?
 
-	You can assume that the tree is leaf-labeled (no labels on the
-	internal nodes), and that the leafs are, say, chars.
+	You can assume that the tree is binary, leaf-labeled (no
+	labels on the internal nodes), and that the leafs are, say,
+	chars.
 
 	Here is [a hint](/hints/assignment_10_hint).