diff --git a/c/gc.c b/c/gc.c
index 5f5a93195a..a735215ded 100644
--- a/c/gc.c
+++ b/c/gc.c
@@ -212,7 +212,7 @@ static ptr copy(pp, pps) ptr pp; ISPC pps; {
             if (counts == Sfalse) {
               IGEN grtd = rtd == pp ? tg : GENERATION(rtd);
               S_G.countof[grtd][countof_rtd_counts] += 1;
-             /* allocte counts struct in same generation as rtd.  initialize timestamp & counts */
+             /* allocate counts struct in same generation as rtd.  initialize timestamp & counts */
               find_room(space_data, grtd, type_typed_object, size_rtd_counts, counts);
               RTDCOUNTSTYPE(counts) = type_rtd_counts;
               RTDCOUNTSTIMESTAMP(counts) = S_G.gctimestamp[0];
diff --git a/c/segment.c b/c/segment.c
index 9228a61b29..0ee247412b 100644
--- a/c/segment.c
+++ b/c/segment.c
@@ -21,8 +21,8 @@ Low-level Memory management strategy:
   * maintain getmem-allocated segment info and dirty vector tables
   * after each collection, run through the list of chunks.  If all
     segments in a chunk are empty, the chunk is a candidate for return
-    to the O/S.  Return (freeem) as many chunks as possible without going
-    below a user-defined threshhold of empty segments (determined as a
+    to the O/S.  Return (freemem) as many chunks as possible without going
+    below a user-defined threshold of empty segments (determined as a
     multiple of the occupied nonstatic segments).  Bias return to the
     most recently allocated chunks.
   * getmem/freemem may be implemented with malloc/free; we use them