diff --git a/Box_intersection_d/doc/Box_intersection_d/CGAL/box_intersection_d.h b/Box_intersection_d/doc/Box_intersection_d/CGAL/box_intersection_d.h
index 05faf7a6a92..fb7d88f88c5 100644
--- a/Box_intersection_d/doc/Box_intersection_d/CGAL/box_intersection_d.h
+++ b/Box_intersection_d/doc/Box_intersection_d/CGAL/box_intersection_d.h
@@ -84,7 +84,7 @@ namespace CGAL {
   to work with pointers to boxes and copy only pointers. We offer 
   automatic support for both options. To simplify the description, let 
   us call the `value_type` of the iterators <I>box handle</I>. The 
-  <I>box handle/</I> can either be our box type itself or a pointer (or 
+  <I>box handle</I> can either be our box type itself or a pointer (or 
   const pointer) to the box type. 
 
   A \f$ d\f$-dimensional iso-oriented box is defined as the 
@@ -427,7 +427,7 @@ namespace CGAL {
   box it can be faster to copy the boxes, or to work with pointers to 
   boxes and copy only pointers. We offer automatic support for both 
   options. To simplify the description, let us call the `value_type` 
-  of the iterators <I>box handle</I>. The <I>box handle/</I> can 
+  of the iterators <I>box handle</I>. The <I>box handle</I> can 
   either be our box type itself or a pointer (or const pointer) to the 
   box type. 
 
diff --git a/Circulator/doc/Circulator/Concepts/Circulator.h b/Circulator/doc/Circulator/Concepts/Circulator.h
index f42ec4841d5..12808c7e1c6 100644
--- a/Circulator/doc/Circulator/Concepts/Circulator.h
+++ b/Circulator/doc/Circulator/Concepts/Circulator.h
@@ -11,7 +11,7 @@ particular, iterator traits are now assumed and required.
 Iterators in the \stl were tailored for linear sequences. The
 specialization for circular data structures leads to slightly
 different requirements which we will summarize in the
-<I>circulators/</I> concept. The main difference is that a circular
+<I>circulators</I> concept. The main difference is that a circular
 data structure has no natural past-the-end value. As a consequence, a
 container supporting circulators will not have an
 <TT>end()</TT>-member function. The semantic of a circulator range
diff --git a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_decorator.h b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_decorator.h
index 622d3a89955..f9afd08cdb1 100644
--- a/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_decorator.h
+++ b/HalfedgeDS/doc/HalfedgeDS/CGAL/HalfedgeDS_decorator.h
@@ -109,7 +109,7 @@ Halfedge_handle create_segment();
 /// @} 
 
 /// \name Removal of Elements 
-/// The following member functions do <I>not/</I> update affected 
+/// The following member functions do <I>not</I> update affected 
 /// incidence relations except if mentioned otherwise. 
 /// @{
 
diff --git a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h
index f27429a5449..7e454ff2445 100644
--- a/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h
+++ b/HalfedgeDS/doc/HalfedgeDS/Concepts/HalfedgeDS.h
@@ -560,11 +560,11 @@ void clear();
 /// @} 
 
 /*! \name Operations with Border Halfedges 
-\advanced The following notion of <I>border halfedges/</I> is particular useful 
+\advanced The following notion of <I>border halfedges</I> is particular useful 
 where the halfedge data structure is used to model surfaces with 
 boundary, i.e., surfaces with missing faces or open regions. Halfedges 
 incident to an open region are called <I>border halfedges</I>. A 
-halfedge is a <I>border edge/</I> if the halfedge itself or its 
+halfedge is a <I>border edge</I> if the halfedge itself or its 
 opposite halfedge is a border halfedge. The only requirement to work 
 with border halfedges is that the 
 `Halfedge` class provides a member function `is_border()` 
diff --git a/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_min_items_3.h b/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_min_items_3.h
index 18d5bcff47d..23f8a526ca1 100644
--- a/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_min_items_3.h
+++ b/Polyhedron/doc/Polyhedron/CGAL/Polyhedron_min_items_3.h
@@ -8,7 +8,7 @@ The class `Polyhedron_min_items_3` is a minimal model of the
 `PolyhedronItems_3` concept. It provides definitions for vertices 
 containing points, halfedges, and faces. The polyhedron traits class 
 must provide the respective type for the point. Vertices and facets 
-both do <I>not/</I> contain a halfedge handle to an incident 
+both do <I>not</I> contain a halfedge handle to an incident 
 halfedge. 
 
 \models \ref ::PolyhedronItems_3