--- a/msc-projects-12.html	Tue Nov 06 20:19:35 2012 +0000
+++ b/msc-projects-12.html	Tue Nov 06 20:27:18 2012 +0000
@@ -85,7 +85,7 @@
   offical matcher maxes out at 4,600 <code>a</code>s). My matcher is approximately
   85 lines of code and based on the concept of 
   <A HREF="http://lambda-the-ultimate.org/node/2293">derivatives of regular experssions</A>.
- Derivatives were introduced in 1964 by <A HREF="http://en.wikipedia.org/wiki/Janusz_Brzozowski_(computer_scientist)">
+  These derivatives were introduced in 1964 by <A HREF="http://en.wikipedia.org/wiki/Janusz_Brzozowski_(computer_scientist)">
   Janusz Brzozowski</A>, but according to this 
   <A HREF="http://www.cl.cam.ac.uk/~so294/documents/jfp09.pdf">paper</A> had been lost in the &quot;sands of time&quot;.
   The advantage of derivatives is that they side-step completely the usual 
@@ -103,9 +103,11 @@
   in this project is to find out how good they actually are by implementing the results from their paper. 
   Their approach is based on the concept of partial derivatives introduced in 1994 by
   <A HREF="http://reference.kfupm.edu.sa/content/p/a/partial_derivatives_of_regular_expressio_1319383.pdf">Valentin Antimirov</A>.
-  I used them <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/rexp.pdf">once</A> 
-  in order to prove the <A HREF="http://en.wikipedia.org/wiki/Myhill–Nerode_theorem">Myhill-Nerode theorem</A>
-  by using only regular expressions.
+  I used them once myself in a <A HREF="http://www.inf.kcl.ac.uk/staff/urbanc/Publications/rexp.pdf">paper</A> 
+  in order to prove the <A HREF="http://en.wikipedia.org/wiki/Myhill–Nerode_theorem">Myhill-Nerode theorem</A>.
+  So I know they are worth their money. Still it would be interesting to actually compare their results
+  with my simple rainy-afternoon matcher and &quot;blow away&quot; the matchers in Python and Ruby (and possibly
+  Scala too).
   </p>
 
   <p>