diff --git a/devito/dle/backends/advanced.py b/devito/dle/backends/advanced.py
index d359e92b7f..f5017dfe3c 100644
--- a/devito/dle/backends/advanced.py
+++ b/devito/dle/backends/advanced.py
@@ -103,8 +103,8 @@ def _loop_blocking(self, state, **kwargs):
         Blocking is applied to parallel iteration trees. Heuristically, innermost
         dimensions are not blocked to maximize the trip count of the SIMD loops.
 
-        Different heuristics may be specified via ``kwargs['blockshape']`` and
-        ``kwargs['blockinner']``. The former, a dictionary, is used to indicate
+        Different heuristics may be specified by passing the keywords ``blockshape``
+        and ``blockinner`` to the DLE. The former, a dictionary, is used to indicate
         a specific block size for each blocked dimension. For example, for the
         :class:`Iteration` tree: ::
 
@@ -113,7 +113,7 @@ def _loop_blocking(self, state, **kwargs):
                 for k
                   ...
 
-        one may provide ``kwargs['blockshape'] = {i: 4, j: 7}``, in which case the
+        one may provide ``blockshape = {i: 4, j: 7}``, in which case the
         two outer loops will blocked, and the resulting 2-dimensional block will
         have size 4x7. The latter may be set to True to also block innermost parallel
         :class:`Iteration` objects.
diff --git a/devito/dle/blocking_utils.py b/devito/dle/blocking_utils.py
index c7e1783a63..f343f7f684 100644
--- a/devito/dle/blocking_utils.py
+++ b/devito/dle/blocking_utils.py
@@ -205,7 +205,7 @@ def __repr__(self):
 
     @property
     def ccode(self):
-        comment = c.Comment('This IterationFold is "hiding" ore or more Iterations')
+        comment = c.Comment('This IterationFold is "hiding" one or more Iterations')
         code = super(IterationFold, self).ccode
         return c.Module([comment, code])
 
diff --git a/devito/dle/inspection.py b/devito/dle/inspection.py
index f45b6b097a..55a976cf72 100644
--- a/devito/dle/inspection.py
+++ b/devito/dle/inspection.py
@@ -23,7 +23,7 @@ def retrieve_iteration_tree(node, mode='normal'):
 
     :param node: The searched Iteration/Expression tree.
     :param mode: Accepted values are 'normal' (default) and 'superset', in which
-                 case iteration trees that are subset of larget iteration trees
+                 case iteration trees that are subset of larger iteration trees
                  are dropped.
     """
     assert mode in ('normal', 'superset')