Merge pull request #480 from delallea/minor

NEWS.txt

@@ -35,7 +35,7 @@ Interface Behavior Changes:
    This new behavior is the same as numpy. (Olivier, Pascal)
  * When using a GPU, detect faulty nvidia drivers. This was detected
    when running Theano tests. Now this is always tested. Faulty
-   drivers results in in wrong results for reduce operations. (Frederic B.)
+   drivers results in wrong results for reduce operations. (Frederic B.)
 
 
 Interface Features Removed (most were deprecated):
@@ -160,7 +160,7 @@ New features:
    http://www.cs.toronto.edu/~tijmen/gnumpy.html)
  * Many infer_shape implemented on sparse matrices op. (David W.F.)
  * Added theano.sparse.verify_grad_sparse to easily allow testing grad of
-   sparse op. It support testing the full and structured gradient.
+   sparse op. It supports testing the full and structured gradients.
  * The keys in our cache now store the hash of constants and not the constant values
    themselves. This is significantly more efficient for big constant arrays. (Frederic B.)
  * 'theano-cache list' lists key files bigger than 1M (Frederic B.)

doc/NEWS.txt

@@ -35,7 +35,7 @@ Interface Behavior Changes:
    This new behavior is the same as numpy. (Olivier, Pascal)
  * When using a GPU, detect faulty nvidia drivers. This was detected
    when running Theano tests. Now this is always tested. Faulty
-   drivers results in in wrong results for reduce operations. (Frederic B.)
+   drivers results in wrong results for reduce operations. (Frederic B.)
 
 
 Interface Features Removed (most were deprecated):
@@ -160,7 +160,7 @@ New features:
    http://www.cs.toronto.edu/~tijmen/gnumpy.html)
  * Many infer_shape implemented on sparse matrices op. (David W.F.)
  * Added theano.sparse.verify_grad_sparse to easily allow testing grad of
-   sparse op. It support testing the full and structured gradient.
+   sparse op. It supports testing the full and structured gradients.
  * The keys in our cache now store the hash of constants and not the constant values
    themselves. This is significantly more efficient for big constant arrays. (Frederic B.)
  * 'theano-cache list' lists key files bigger than 1M (Frederic B.)

theano/compile/debugmode.py

@@ -52,8 +52,8 @@ AddConfigVar('DebugMode.check_strides',
         in_c_key=False)
 
 AddConfigVar('DebugMode.warn_input_not_reused',
-        ("Generate a warning when the destroy_map or view_map tell that an"
-         " op work inplace, but the op did not reuse the input for its output."
+        ("Generate a warning when destroy_map or view_map says that an "
+         "op works inplace, but the op did not reuse the input for its output."
          ),
         BoolParam(True),
         in_c_key=False)

theano/gof/cc.py

@@ -884,9 +884,9 @@ class CLinker(link.Linker):
         # into the signature.
         sig = ['CLinker.cmodule_key'] # will be cast to tuple on return
         if compile_args is not None:
-            # We must sort it as the order from a set are not guarantee.
+            # We must sort it as the order from a set is not guaranteed.
             # In  particular, 2 sets with the same content can give different
-            # order depending in the order you put data in it.
+            # order depending on the order you put data in it.
             # Sets are used to remove duplicate elements.
             args = sorted(compile_args)
             args = tuple(args)