minor typos

git-svn-id: https://hudson.dev.java.net/svn/hudson/trunk/hudson/main@15048 71c3de6d-444a-0410-be80-ed276b4c234a

war/resources/help/matrix/combinationfilter.html

@@ -2,19 +2,19 @@
   By default, Hudson builds all the possible combinations of axes exhaustively. But sometimes this is too many,
   or may contain combinations that don't make sense.
   In such a situation, you can make the matrix sparse by filtering out combinations that you don't want through
-  a Goorvy expression that returns true or false.
+  a Groovy expression that returns true or false.
 
   <p>
   When you specify a Groovy expression here, only the combinations that result in <b>true</b>
   will be built. In evaluating the expression, axes are exposed as variables (with their values set
-  to the current combination evaluated.)
+  to the current combination evaluated).
 
   <h4>Filtering based on values</h4>
-  <p>    
+  <p>
   For example, let's say you are building on different operating systems for
   different compilers. Assume that your slave labels are <b>label=[linux,solaris]</b> and you have
   created an axis as <b>compiler=[gcc,cc].</b>
-    
+
   Any of the following expressions will filter out <b>cc</b> builds on <b>linux</b>. Depending on
   how you think about this constraint, you'll probably find some more intuitive than others.
 

war/resources/help/system-config/usage-statistics.html

@@ -15,7 +15,7 @@
 
     <p>
     The information doesn't contain anything that identifies you or allows us to contact you
-    (except information inherently revealed by HTTP, such as the IP address.) Tabulated
+    (except information inherently revealed by HTTP, such as the IP address). Tabulated
     data of these usage statistics submissions will be shared with the community.
 
     <p>