diff --git a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_rational_function_traits_2.h b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_rational_function_traits_2.h
index 7c121ebf8976..d722a3ae2859 100644
--- a/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_rational_function_traits_2.h
+++ b/Arrangement_on_surface_2/doc/Arrangement_on_surface_2/CGAL/Arr_rational_function_traits_2.h
@@ -118,7 +118,7 @@ class Arr_rational_function_traits_2 {
   void cleanup_cache() const;
 
   /*!
-    Returns a pointer to the used algerbaic kernel object.
+    Returns a pointer to the used algebraic kernel object.
   */
   const Algebraic_kernel_d_1* algebraic_kernel_d_1() const;
 
diff --git a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h
index c81fd5b93bd4..86d219fd417e 100644
--- a/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h
+++ b/Arrangement_on_surface_2/include/CGAL/Curved_kernel_via_analysis_2/test/simple_models.h
@@ -1237,7 +1237,7 @@ class Simple_algebraic_kernel_2 {
     //! \brief checks whether curve has only finitely many self-intersection
     //! points, i.e., it has no self-overlapped continuous parts
     //!
-    //! for algerbaic curves this means that supporting polynomial is
+    //! for algebraic curves this means that supporting polynomial is
     //! square-free
     struct Has_finite_number_of_self_intersections_2 :
             public CGAL::cpp98::unary_function< Polynomial_2, bool > {
@@ -1252,7 +1252,7 @@ class Simple_algebraic_kernel_2 {
     //! \brief checks whether a curve pair has finitely many intersections,
     //! in other words, whether two curves have no continuous common part
     //!
-    //! in case of algerbaic curves: checks whether supporting polynomials are
+    //! in case of algebraic curves: checks whether supporting polynomials are
     //! coprime
     struct Has_finite_number_of_intersections_2 :
         public CGAL::cpp98::binary_function< Curve_analysis_2, Curve_analysis_2, bool > {
diff --git a/Documentation/doc/biblio/geom.bib b/Documentation/doc/biblio/geom.bib
index 7f8a137413c5..d6b9488ec1f6 100644
--- a/Documentation/doc/biblio/geom.bib
+++ b/Documentation/doc/biblio/geom.bib
@@ -16862,7 +16862,7 @@ @inproceedings{b-prcv-75
 , title =       "A polyhedron representation for computer vision"
 , booktitle =   "Proc. AFIPS Natl. Comput. Conf."
 , volume =      44
-, publisher =   "AFIPS Press, Alrington, Va."
+, publisher =   "AFIPS Press, Arlington, Va."
 , year =        1975
 , pages =       "589--596"
 , update =      "98.07 bibrelex"
@@ -116674,7 +116674,7 @@ @article{p-dmdci-35
 
 @article{p-axrac-44
 , author =      "A. L. Patterson"
-, title =       "Amibguities in the {X}-ray analysis of crystal structures"
+, title =       "Ambiguities in the {X}-ray analysis of crystal structures"
 , journal =     "Physical Review"
 , volume =      65
 , year =        1944
diff --git a/Envelope_3/include/CGAL/Env_triangle_traits_3.h b/Envelope_3/include/CGAL/Env_triangle_traits_3.h
index 0bb6e384c455..b02d478caa06 100644
--- a/Envelope_3/include/CGAL/Env_triangle_traits_3.h
+++ b/Envelope_3/include/CGAL/Env_triangle_traits_3.h
@@ -367,7 +367,7 @@ class Env_triangle_traits_3 : public ArrSegmentTraits {
       // case, to find whether a 2d point lies below/above/on a line
       // this test is simply computing the sign of:
       //    (1)    [(y3 - y1)(z2 - z1) - (z3 - z1)(y2 - y1)] * sign(y3 - y1)
-      // abd comparing to 0, where pi = (xi, yi, zi), and p2 is compared to the
+      // and comparing it with 0, where pi = (xi, yi, zi), and p2 is compared to the
       // line formed by p1 and p3 (in the direction p1 -> p3)
       //
       // for general vertical plane, we change (x, y) coordinates to (v, w),
diff --git a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_2.h b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_2.h
index 4d2b45ca3439..ef2d984340b3 100644
--- a/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_2.h
+++ b/Hyperbolic_triangulation_2/doc/Hyperbolic_triangulation_2/CGAL/Hyperbolic_Delaunay_triangulation_2.h
@@ -236,7 +236,7 @@ class Hyperbolic_Delaunay_triangulation_2: private Delaunay_triangulation_2<Gt,T
     void remove(Vertex_handle v);
 
     /*!
-      Removes the vertices in the iterator range `[firs, last)` from the triangulation.
+      Removes the vertices in the iterator range `[first, last)` from the triangulation.
       \pre all vertices in `[first, last)` are vertices of the triangulation.
     */
     template <class VertexRemoveIterator>
diff --git a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_2.h b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_2.h
index aa67d8eee102..76ad9181abfc 100644
--- a/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_2.h
+++ b/Periodic_4_hyperbolic_triangulation_2/doc/Periodic_4_hyperbolic_triangulation_2/CGAL/Periodic_4_hyperbolic_Delaunay_triangulation_2.h
@@ -145,7 +145,7 @@ The class expects two template parameters.
                 bool remove(Vertex_handle v);
 
                 /*!
-              Removes the vertices in the iterator range `[firs, last)` from the triangulation.
+              Removes the vertices in the iterator range `[first, last)` from the triangulation.
               \pre all vertices in `[first, last)` are vertices of the triangulation.
             */
             template <class VertexRemoveIterator>