diff --git a/src/api/pdfrenderer.cpp b/src/api/pdfrenderer.cpp
index 3495cd7f25..11c171ae6e 100644
--- a/src/api/pdfrenderer.cpp
+++ b/src/api/pdfrenderer.cpp
@@ -36,7 +36,7 @@ Design notes from Ken Sharp, with light editing.
 
 We think one solution is a font with a single glyph (.notdef) and a
 CIDToGIDMap which maps all the CIDs to 0. That map would then be
-stored as a stream in the PDF file, and when flate compressed should
+stored as a stream in the PDF file, and when flat compressed should
 be pretty small. The font, of course, will be approximately the same
 size as the one you currently use.
 
diff --git a/src/ccmain/equationdetect.cpp b/src/ccmain/equationdetect.cpp
index aba34fd68f..21b5914e8a 100644
--- a/src/ccmain/equationdetect.cpp
+++ b/src/ccmain/equationdetect.cpp
@@ -1102,7 +1102,7 @@ bool EquationDetect::ExpandSeed(ColPartition* seed) {
 
   // Merge all partitions in parts_to_merge with seed. We first remove seed
   // from part_grid_ as its bounding box is going to expand. Then we add it
-  // back after it aborbs all parts_to_merge parititions.
+  // back after it absorbs all parts_to_merge partitions.
   part_grid_->RemoveBBox(seed);
   for (int i = 0; i < parts_to_merge.size(); ++i) {
     ColPartition* part = parts_to_merge[i];
diff --git a/src/ccmain/equationdetect.h b/src/ccmain/equationdetect.h
index beacc8c027..a59ab9bbac 100644
--- a/src/ccmain/equationdetect.h
+++ b/src/ccmain/equationdetect.h
@@ -181,7 +181,7 @@ class EquationDetect : public EquationDetectBase {
   bool ExpandSeed(ColPartition* seed);
 
   // Starting from the seed position, we search the part_grid_
-  // horizontally/vertically, find all parititions that can be
+  // horizontally/vertically, find all partitions that can be
   // merged with seed, remove them from part_grid_, and put them  into
   // parts_to_merge.
   void ExpandSeedHorizontal(const bool search_left,
diff --git a/src/textord/cjkpitch.cpp b/src/textord/cjkpitch.cpp
index 6c3e1aa4b7..7b30e73021 100644
--- a/src/textord/cjkpitch.cpp
+++ b/src/textord/cjkpitch.cpp
@@ -958,7 +958,7 @@ class FPAnalyzer {
   std::vector<FPRow> rows_;
   unsigned num_tall_rows_;
   unsigned num_bad_rows_;
-  // TODO: num_empty_rows_ is incremented, but never used overwise.
+  // TODO: num_empty_rows_ is incremented, but never used otherwise.
   unsigned num_empty_rows_;
   unsigned max_chars_per_row_;
 };
diff --git a/src/textord/colpartitionset.cpp b/src/textord/colpartitionset.cpp
index cb79495a28..093a13ab35 100644
--- a/src/textord/colpartitionset.cpp
+++ b/src/textord/colpartitionset.cpp
@@ -622,7 +622,7 @@ void ColPartitionSet::AddPartition(ColPartition* new_part,
 // Coverage is split into good and bad. Good coverage is provided by
 // ColPartitions of a frequent width (according to the callback function
 // provided by TabFinder::WidthCB, which accesses stored statistics on the
-// widths of ColParititions) and bad coverage is provided by all other
+// widths of ColPartitions) and bad coverage is provided by all other
 // ColPartitions, even if they have tab vectors at both sides. Thus:
 // |-----------------------------------------------------------------|
 // |        Double     width    heading                              |
diff --git a/src/textord/colpartitionset.h b/src/textord/colpartitionset.h
index 51b430eec8..f201a0bdb8 100644
--- a/src/textord/colpartitionset.h
+++ b/src/textord/colpartitionset.h
@@ -136,7 +136,7 @@ class ColPartitionSet : public ELIST_LINK {
   // Coverage is split into good and bad. Good coverage is provided by
   // ColPartitions of a frequent width (according to the callback function
   // provided by TabFinder::WidthCB, which accesses stored statistics on the
-  // widths of ColParititions) and bad coverage is provided by all other
+  // widths of ColPartitions) and bad coverage is provided by all other
   // ColPartitions, even if they have tab vectors at both sides. Thus:
   // |-----------------------------------------------------------------|
   // |        Double     width    heading                              |
diff --git a/src/textord/tordmain.cpp b/src/textord/tordmain.cpp
index ae77b0b491..afb2263a0b 100644
--- a/src/textord/tordmain.cpp
+++ b/src/textord/tordmain.cpp
@@ -135,7 +135,7 @@ void SetBlobStrokeWidth(Pix* pix, BLOBNBOX* blob) {
   }
   pixDestroy(&dist_pix);
   // Store the horizontal and vertical width in the blob, keeping both
-  // widths if there is enough information, otherwse only the one with
+  // widths if there is enough information, otherwise only the one with
   // the most samples.
   // If there are insufficient samples, store zero, rather than using
   // 2*area/perimeter, as the numbers that gives do not match the numbers
diff --git a/unittest/intfeaturemap_test.cc b/unittest/intfeaturemap_test.cc
index f9f39aca3f..501fc4caf4 100644
--- a/unittest/intfeaturemap_test.cc
+++ b/unittest/intfeaturemap_test.cc
@@ -27,7 +27,7 @@ namespace {
 
 class IntFeatureMapTest : public testing::Test {
  public:
-  // Expects that the given vector has continguous integer values in the
+  // Expects that the given vector has contiguous integer values in the
   // range [start, end).
   void ExpectContiguous(const GenericVector<int>& v, int start, int end) {
     for (int i = start; i < end; ++i) {
diff --git a/unittest/paragraphs_test.cc b/unittest/paragraphs_test.cc
index c1be3971b7..7e64774993 100644
--- a/unittest/paragraphs_test.cc
+++ b/unittest/paragraphs_test.cc
@@ -699,6 +699,6 @@ TEST(ParagraphsTest, IndexPageTest) {
   TestParagraphDetection(kNewZealandIndex, ABSL_ARRAYSIZE(kNewZealandIndex));
 }
 
-// TOOO(eger): Add some right-to-left examples, and fix the algorithm as needed.
+// TODO(eger): Add some right-to-left examples, and fix the algorithm as needed.
 
 }  // namespace