Spelling fixes

cde/programs/dtsr/dtsrindex.c

@@ -327,8 +327,8 @@ static void     print_exit_code (int exit_code)
  * scaled to range 0 to 255.
  * Fundamentally it's a word count of that word in the doc,
  * but adjusted as follows:
- * 1) Large occurrances in small documents weigh more than 
- *    the same number of occurrances in large documents.
+ * 1) Large occurrences in small documents weigh more than
+ *    the same number of occurrences in large documents.
  * 2) Taking the log skews the ratio to be more linear,
  *    ie take advantage of higher ranges of the 'weight'.
  *    For example a word that occurs in 10% of the document,

cde/programs/dtsr/huffcode.c

@@ -45,7 +45,7 @@
 /************************** HUFFCODE.C ******************************
  * $XConsortium: huffcode.c /main/9 1996/11/14 15:31:05 rcs $
  * 12/90.
- * Counts frequency of occurrance of every possible byte value of input text.
+ * Counts frequency of occurrence of every possible byte value of input text.
  * Creates Huffman Code Table based on byte frequencies and writes it
  * in 2 formats to 2 different output files.
  * The encode table (.huf) maintains the frequency counts and explicitly
@@ -167,7 +167,7 @@
 typedef struct {
     char            bit;	/* '0' or '1' (assoc with link to
 				 * father) */
-    long            count;	/* freq of occurrance of char */
+    long            count;	/* freq of occurrence of char */
     int             sort;	/* specifies output sort order */
     int             father;	/* index points UP toward root of
 				 * tree */