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/homology/homology_group.py.orig src/sage/homology/homology_group.py
--- src/sage/homology/homology_group.py.orig	2019-06-26 14:41:04.000000000 -0600
+++ src/sage/homology/homology_group.py	2019-06-27 11:46:03.614253830 -0600
@@ -109,7 +109,7 @@ class HomologyGroup_class(AdditiveAbelia
             sage: from sage.homology.homology_group import HomologyGroup
             sage: H = HomologyGroup(7, ZZ, [4,4,4,4,4,7,7])
             sage: H._latex_()
-            'C_{4}^{5} \\times C_{7} \\times C_{7}'
+            'C_{4}^{5} \times C_{7} \times C_{7}'
             sage: latex(HomologyGroup(6, ZZ))
             \ZZ^{6}
         """