diff --git a/faiss/Clustering.cpp b/faiss/Clustering.cpp
index 41dd1f5db..b6e1d23a9 100644
--- a/faiss/Clustering.cpp
+++ b/faiss/Clustering.cpp
@@ -209,7 +209,7 @@ void compute_centroids (size_t d, size_t k, size_t n,
 /** Handle empty clusters by splitting larger ones.
  *
  * It works by slightly changing the centroids to make 2 clusters from
- * a single one. Takes the same arguements as compute_centroids.
+ * a single one. Takes the same arguments as compute_centroids.
  *
  * @return           nb of spliting operations (larger is worse)
  */
diff --git a/faiss/IndexBinaryIVF.h b/faiss/IndexBinaryIVF.h
index 18918f61f..3bfd2913d 100644
--- a/faiss/IndexBinaryIVF.h
+++ b/faiss/IndexBinaryIVF.h
@@ -33,7 +33,7 @@ struct BinaryInvertedListScanner;
  * Otherwise the object is similar to the IndexIVF
  */
 struct IndexBinaryIVF : IndexBinary {
-    /// Acess to the actual data
+    /// Access to the actual data
     InvertedLists *invlists;
     bool own_invlists;
 
diff --git a/faiss/IndexIVF.h b/faiss/IndexIVF.h
index 118489a8d..d47a7ab64 100644
--- a/faiss/IndexIVF.h
+++ b/faiss/IndexIVF.h
@@ -97,7 +97,7 @@ struct InvertedListScanner;
  * the distance estimation from the query to databse vectors.
  */
 struct IndexIVF: Index, Level1Quantizer {
-    /// Acess to the actual data
+    /// Access to the actual data
     InvertedLists *invlists;
     bool own_invlists;
 
diff --git a/faiss/IndexPQ.cpp b/faiss/IndexPQ.cpp
index 5357518ae..0bf2776ab 100644
--- a/faiss/IndexPQ.cpp
+++ b/faiss/IndexPQ.cpp
@@ -835,7 +835,7 @@ struct MinSumK {
             x += ldx;
         }
 
-        { // intial result: take min for all elements
+        { // initial result: take min for all elements
             T sum = 0;
             terms[0] = 0;
             mark_seen (0);
diff --git a/faiss/gpu/impl/Distance.cu b/faiss/gpu/impl/Distance.cu
index 867c488fd..a90fb01c4 100644
--- a/faiss/gpu/impl/Distance.cu
+++ b/faiss/gpu/impl/Distance.cu
@@ -59,7 +59,7 @@ void runDistance(bool computeL2,
 
   auto defaultStream = res->getDefaultStreamCurrentDevice();
 
-  // If we're quering against a 0 sized set, just return empty results
+  // If we're querying against a 0 sized set, just return empty results
   if (centroids.numElements() == 0) {
     thrust::fill(thrust::cuda::par.on(defaultStream),
                  outDistances.data(), outDistances.end(),
diff --git a/faiss/impl/PolysemousTraining.h b/faiss/impl/PolysemousTraining.h
index c27a48c99..61216da46 100644
--- a/faiss/impl/PolysemousTraining.h
+++ b/faiss/impl/PolysemousTraining.h
@@ -101,7 +101,7 @@ struct RandomGenerator;
                                  const SimulatedAnnealingParameters &p);
     RandomGenerator *rnd;
 
-    /// remember intial cost of optimization
+    /// remember initial cost of optimization
     double init_cost;
 
     // main entry point. Perform the optimization loop, starting from
diff --git a/tests/test_build_blocks.py b/tests/test_build_blocks.py
index 58c43b655..21c6d5d81 100644
--- a/tests/test_build_blocks.py
+++ b/tests/test_build_blocks.py
@@ -182,7 +182,7 @@ class TestClustering(unittest.TestCase):
         km2 = faiss.Kmeans(d, k, niter=4)
         km2.train(xt, init_centroids=km.centroids)
 
-        # check that the intial objective is better for km2 than km
+        # check that the initial objective is better for km2 than km
         self.assertGreater(km.obj[0], km2.obj[0] * 1.01)
 
     def test_stats(self):
diff --git a/tutorial/cpp/3-IVFPQ.cpp b/tutorial/cpp/3-IVFPQ.cpp
index 429676baf..7569f899d 100644
--- a/tutorial/cpp/3-IVFPQ.cpp
+++ b/tutorial/cpp/3-IVFPQ.cpp
@@ -39,7 +39,7 @@ int main() {
     int m = 8;                             // bytes per vector
     faiss::IndexFlatL2 quantizer(d);       // the other index
     faiss::IndexIVFPQ index(&quantizer, d, nlist, m, 8);
-    
+
     index.train(nb, xb);
     index.add(nb, xb);