diff --git a/src/scion/math/InterpolationTable/src/evaluateOnGrid.hpp b/src/scion/math/InterpolationTable/src/evaluateOnGrid.hpp
index 87d9c35..cd25793 100644
--- a/src/scion/math/InterpolationTable/src/evaluateOnGrid.hpp
+++ b/src/scion/math/InterpolationTable/src/evaluateOnGrid.hpp
@@ -5,6 +5,7 @@ std::vector< Y > evaluateOnGrid( const std::vector< X >& x ) const {
   auto xIter = std::lower_bound( x.begin(), x.end(), this->x().front() );
   if ( *std::next( xIter ) == this->x().front() ) {
 
+    // move to the next x value in case of a jump
     ++xIter;
   }
   auto yIter = std::next( y.begin(), std::distance( x.begin(), xIter ) );
diff --git a/src/scion/unionisation/unionise.hpp b/src/scion/unionisation/unionise.hpp
index 39f9308..01a17dd 100644
--- a/src/scion/unionisation/unionise.hpp
+++ b/src/scion/unionisation/unionise.hpp
@@ -14,8 +14,8 @@ namespace unionisation {
    *  @brief Unionise two grids and preserve duplicate points that appear in each
    *
    *  If the grids do not have the same begin and/or end point, a duplicate point
-   *  is inserted into the grid corresponding to the highest begining and/or
-   *  lowest end point (unless those is already a duplicate point).
+   *  is inserted into the grid corresponding to the highest beginning and/or
+   *  lowest end point (unless those are already a duplicate point).
    *
    *  @param first        the first grid (assumed to be sorted)
    *  @param second       the second grid (assumed to be sorted)