diff --git a/cpp/dolfinx/fem/utils.h b/cpp/dolfinx/fem/utils.h
index 1739166dc5e..e81a00f4817 100644
--- a/cpp/dolfinx/fem/utils.h
+++ b/cpp/dolfinx/fem/utils.h
@@ -567,7 +567,7 @@ Form<T, U> create_form(
 /// @param[in] spaces Function spaces for the Form arguments.
 /// @param[in] coefficients Coefficient fields in the form (by name).
 /// @param[in] constants Spatial constants in the form (by name).
-/// @param[in] subdomains Subdomain makers.
+/// @param[in] subdomains Subdomain markers.
 /// @pre Each value in `subdomains` must be sorted by domain id.
 /// @param[in] mesh Mesh of the domain. This is required if the form has
 /// no arguments, e.g. a functional.
diff --git a/cpp/dolfinx/graph/ordering.cpp b/cpp/dolfinx/graph/ordering.cpp
index 04c14a0c046..0d2d7f331a3 100644
--- a/cpp/dolfinx/graph/ordering.cpp
+++ b/cpp/dolfinx/graph/ordering.cpp
@@ -200,7 +200,7 @@ gps_reorder_unlabelled(const graph::AdjacencyList<std::int32_t>& graph,
 
   assert(lv.num_nodes() == lu.num_nodes());
   int k = lv.num_nodes();
-  LOG(INFO) << "GPS pseudo-diameter:(" << k << ") " << u << "-" << v << "\n";
+  LOG(INFO) << "GPS pseudo-diameter:(" << k << ") " << u << "-" << v;
 
   // ALGORITHM II. Minimizing level width.
 
diff --git a/cpp/dolfinx/io/ADIOS2Writers.h b/cpp/dolfinx/io/ADIOS2Writers.h
index 16297de1634..af138800e21 100644
--- a/cpp/dolfinx/io/ADIOS2Writers.h
+++ b/cpp/dolfinx/io/ADIOS2Writers.h
@@ -405,7 +405,7 @@ void write_mesh(adios2::IO& io, adios2::Engine& engine,
   // TODO: The DOLFINx and VTK topology are the same for some cell types
   // - no need to repack via extract_vtk_connectivity in these cases
 
-  // Get topological dimenson, number of cells and number of 'nodes' per
+  // Get topological dimension, number of cells and number of 'nodes' per
   // cell, and compute 'VTK' connectivity
   int tdim = topology->dim();
   std::int32_t num_cells = topology->index_map(tdim)->size_local();
diff --git a/cpp/dolfinx/mesh/Topology.cpp b/cpp/dolfinx/mesh/Topology.cpp
index 8eb3b64d336..05b73fa9cb2 100644
--- a/cpp/dolfinx/mesh/Topology.cpp
+++ b/cpp/dolfinx/mesh/Topology.cpp
@@ -769,7 +769,7 @@ std::int32_t Topology::create_entities(int dim)
   if (cell_entity)
     set_connectivity(cell_entity, this->dim(), dim);
 
-  // TODO: is this check necessary? Seems redundant after to the "skip check"
+  // TODO: is this check necessary? Seems redundant after the "skip check"
   if (entity_vertex)
     set_connectivity(entity_vertex, dim, 0);
 
diff --git a/cpp/dolfinx/mesh/utils.h b/cpp/dolfinx/mesh/utils.h
index e4eb60b4e3d..d01be55f713 100644
--- a/cpp/dolfinx/mesh/utils.h
+++ b/cpp/dolfinx/mesh/utils.h
@@ -496,7 +496,7 @@ concept MarkerFn = std::is_invocable_r<
 /// @brief Compute indices of all mesh entities that evaluate to true
 /// for the provided geometric marking function.
 ///
-/// An entity is considered marked if the marker function evaluates true
+/// An entity is considered marked if the marker function evaluates to true
 /// for all of its vertices.
 ///
 /// @param[in] mesh Mesh to mark entities on.
@@ -560,7 +560,7 @@ std::vector<std::int32_t> locate_entities(const Mesh<T>& mesh, int dim,
 /// owned boundary facet and evaluate to true for the provided geometric
 /// marking function.
 ///
-/// An entity is considered marked if the marker function evaluates true
+/// An entity is considered marked if the marker function evaluates to true
 /// for all of its vertices.
 ///
 /// @note For vertices and edges, in parallel this function will not