diff -up src/sage/algebras/clifford_algebra.py.orig src/sage/algebras/clifford_algebra.py
--- src/sage/algebras/clifford_algebra.py.orig	2019-06-26 14:41:04.000000000 -0600
+++ src/sage/algebras/clifford_algebra.py	2019-09-11 15:46:56.658681891 -0600
@@ -1520,7 +1520,7 @@ class ExteriorAlgebra(CliffordAlgebra):
         return term
 
     def _ascii_art_term(self, m):
-        """
+        r"""
         Return ascii art for the basis element indexed by ``m``.
 
         EXAMPLES::
diff -up src/sage/combinat/crystals/alcove_path.py.orig src/sage/combinat/crystals/alcove_path.py
--- src/sage/combinat/crystals/alcove_path.py.orig	2019-06-26 14:41:04.000000000 -0600
+++ src/sage/combinat/crystals/alcove_path.py	2019-06-27 11:46:03.613253846 -0600
@@ -383,7 +383,7 @@ class CrystalOfAlcovePaths(UniqueReprese
 
         One can compute all vertices of the crystal by finding all the
         admissible subsets of the `\lambda`-chain  (see method
-        is_admissible, for definition).  We use the breath first
+        is_admissible, for definition).  We use the breadth first
         search algorithm.
 
         .. WARNING::
diff -up src/sage/rings/lazy_laurent_series_ring.py.orig src/sage/rings/lazy_laurent_series_ring.py
--- src/sage/rings/lazy_laurent_series_ring.py.orig	2019-06-26 14:41:05.000000000 -0600
+++ src/sage/rings/lazy_laurent_series_ring.py	2019-09-11 15:41:19.871081870 -0600
@@ -260,7 +260,7 @@ class LazyLaurentSeriesRing(UniqueRepres
         return self._element_constructor_(0)
 
     def series(self, coefficient, valuation, constant=None):
-        """
+        r"""
         Return a lazy Laurent series.
 
         INPUT: