Fix typos

auto/MkSrc/CcHelper.pm

@@ -107,7 +107,7 @@ sub make_wide_version ( $ \@ $ ; \% ) {
   $accum->{sys_headers}{'stddef.h'} = true;
   $accum->{suffix}[5] = <<'---';
 
-/******************* private implemantion details *********************/
+/******************* private implementation details ********************/
 
 #ifdef __cplusplus
 #  define aspell_cast_(type, expr) (static_cast<type>(expr))

auto/MkSrc/Util.pm

@@ -92,7 +92,7 @@ sub to_lower( $ ) {
 
 =item to_mixed STR
 
-Convert STR to mixed case where each new word startes with a
+Convert STR to mixed case where each new word starts with a
 uppercase letter.  For example "feed me" would become "FeedMe".
 
 =cut

configure.ac

@@ -430,7 +430,7 @@ then
      if test "$enable_wide_curses" != "no"
      then
 
-       AC_MSG_CHECKING(for wide character support in curses libraray)
+       AC_MSG_CHECKING(for wide character support in curses library)
        if test -n "$have_mblen"
        then
          AC_TRY_LINK(
@@ -440,7 +440,7 @@ then
            [wchar_t wch = 0;
             addnwstr(&wch, 1);],
            [AC_MSG_RESULT(yes)
-            AC_DEFINE(HAVE_WIDE_CURSES, 1, [Defined if curses libraray includes wide character support])],
+            AC_DEFINE(HAVE_WIDE_CURSES, 1, [Defined if curses library includes wide character support])],
            [
 
          AC_TRY_LINK(
@@ -499,7 +499,7 @@ then
 	AC_DEFINE(HAVE_LIBCURSES, 1, [])
         posix_termios=t
 	AC_DEFINE(CURSES_INCLUDE_WORKAROUND_1, 1, 
-                  [Defined if special Wordaround I is need for Curses headers])],
+                  [Defined if special Workaround I is needed for Curses headers])],
        [AC_MSG_RESULT(no)
 
      dnl else if

examples/example-c.c

@@ -247,7 +247,7 @@ int main(int argc, const char *argv[])
 
 static void check_document(AspellSpeller * speller, const char * filename)
 {
-  /* For readablity this function does not worry about buffer overrun.
+  /* For readability this function does not worry about buffer overrun.
      This is meant as an illustrative example only.  Please do not
      attempt to spell check your documents with this function. */
 

gen/mk-static-filter.pl

@@ -18,7 +18,7 @@ ($)
   $filtername=~s/-filter\.info$//;
   $filtername=~s/[^\/]*\///g;
   ( exists $filters{$filtername}) &&
-   (printf STDERR "filter allready defined $filtername($filename); ignored;\n") && next;
+   (printf STDERR "filter already defined $filtername($filename); ignored;\n") && next;
   ( open OPTIONFILE,"<$filename") || 
    (printf STDERR "can't open `$filename'; ignored;\n") && next;
 

lib/find_speller.cpp

@@ -460,7 +460,7 @@ namespace acommon {
   {
     m->to_internal_->filter.clear();
     m->from_internal_->filter.clear();
-    // Add enocder and decoder filters if any
+    // Add encoder and decoder filters if any
     RET_ON_ERR(setup_filter(m->to_internal_->filter, m->config(), 
 			    true, false, false));
     RET_ON_ERR(setup_filter(m->from_internal_->filter, m->config(), 

lib/new_fmode.cpp

@@ -588,18 +588,18 @@ namespace acommon {
       String buf;
       DataPair dp;
 
-      bool get_sucess = getdata_pair(toParse, dp, buf);
+      bool get_success = getdata_pair(toParse, dp, buf);
 
       to_lower(dp.key);
       to_lower(dp.value);
-      if (    !get_sucess
+      if (    !get_success
            || ( dp.key != "mode" ) 
            || ( dp.value != possMode.str() ) )
         return make_err(expect_mode_key,"mode").with_file(possModeFile, dp.line_num);
 
-      get_sucess = getdata_pair(toParse, dp, buf);
+      get_success = getdata_pair(toParse, dp, buf);
       to_lower(dp.key);
-      if (    !get_sucess
+      if (    !get_success
            || ( dp.key != "aspell" )
            || ( dp.value == NULL )
            || ( *(dp.value) == '\0' ) )

manual/aspell-dev.texi

@@ -929,7 +929,7 @@ dictionary word in all lowercase form with all accents removed (what is
 known as the "clean" form of the word).  The value stored in the table
 is a 32-bit offset to the beginning of the word.  A 32-bit integer
 offset is used rather than a pointer so that the compiled dictionary
-can be mmaped to make loading the dictionary very fast and so that the
+can be mmapped to make loading the dictionary very fast and so that the
 memory can be shared between processed, and on 64 bit platforms using
 pointers would have doubled the size of the hash table.
 

manual/aspell.texi

@@ -5071,7 +5071,7 @@ Other minor bug fixes.
 @node Authors
 @appendix Authors
 
-The following people or companies have contributed a non-trival amount of
+The following people or companies have contributed a non-trivial amount of
 code to Aspell and thus own the Copyright to part of Aspell.
 
 @table @asis
@@ -5135,7 +5135,7 @@ Converted the metaphone algorithm into C code and made some enhancements
 to the original algorithm.  He also released his work into the Public
 Domain.
 
-@item Geoff Kuenning (and contributers)
+@item Geoff Kuenning (and contributors)
 The authors of Ispell.  Many of the ideas used in Aspell, especially with
 the affix code, were taken from Ispell.  However none of the original
 Ispell code is used in Aspell.

manual/mksrc.texi

@@ -39,8 +39,8 @@ The format of @file{mk-src.in} is as follows:
     cc: for "aspell.h" header file
     cxx: for C++ interface implemented on top of cc interface
     native: for creation of header files used internally by aspell
-    impl: for defination of functions declared in cc interface.
-          the definations use the native hedaer files
+    impl: for definition of functions declared in cc interface.
+          the definitions use the native header files
     native_impl: for implementations of stuff declared in the native
                   header files
 @end verbatim
@@ -79,7 +79,7 @@ The format of @file{mk-src.in} is as follows:
        options => ['strip', 'prefix', 'c impl headers'],
        groups => undef},
      group => {
-       # a group is a colection of objects which should be grouped together
+       # a group is a collection of objects which should be grouped together
        # this generally means they will be in the same source file
        options => ['no native'],
        groups => ['enum', 'struct', 'union', 'func', 'class', 'errors']},
@@ -163,7 +163,7 @@ The format of @file{mk-src.in} is as follows:
         Convert STR to all lowercase and substitute spaces with underscores.
 
     @item to_mixed STR
-        Convert STR to mixed case where each new word startes with a
+        Convert STR to mixed case where each new word starts with a
         uppercase letter. For example "feed me" would become "FeedMe".
 @end table
 

modules/filter/markdown.cpp

@@ -844,7 +844,7 @@ struct LinkRefDefinition : Block {
       return MAYBE;
     return NEVER;
   }
-  void dump() const {CERR.printf("LinkRefDefination\n");}
+  void dump() const {CERR.printf("LinkRefDefinition\n");}
   bool leaf() const {return true;}
 };
 

modules/filter/nroff.cpp

@@ -210,7 +210,7 @@ namespace {
 	return true;
 
       case size_switch:
-	// size chage escape. It can be called in a variety of ways:
+	// size change escape. It can be called in a variety of ways:
 	// \sN \s+N \s-N \s(NN \s+(NN \s-(NN \s(+NN \s(-NN  
 	if (c == '+' || c == '-')
 	  {

modules/speller/default/affix.cpp

@@ -68,7 +68,7 @@ static char EMPTY[1] = {0};
 
 //////////////////////////////////////////////////////////////////////
 //
-// Entry struct definations
+// Entry struct definitions
 //
 
 struct Conds
@@ -695,7 +695,7 @@ static void encodeit(CondsLookup & l, ObjStack & buf,
       c = 0;
     }
 
-    // end goup indicator
+    // end group indicator
     if (c == ']') {
       ec = 1;
       c = 0;
@@ -1214,7 +1214,7 @@ bool SfxEntry::check(const LookupInfo & linf, ParmString word,
                      int optflags, AffEntry* ppfx)
 {
   unsigned              tmpl;		 // length of tmpword 
-  int			cond;		 // condition beng examined
+  int			cond;		 // condition being examined
   WordEntry             wordinfo;        // hash entry pointer
   byte *	cp;
   VARARRAYM(char, tmpword, word.size()+stripl+1, MAXWORDLEN+1);

modules/speller/default/language.hpp

@@ -291,7 +291,7 @@ namespace aspeller {
 
     bool is_clean_wi(WordInfo wi) const {
       return false;
-      //return wi & CASE_PATTEN == AllLower && 
+      //return wi & CASE_PATTERN == AllLower && 
     }
 
 

modules/speller/default/phonet.cpp

@@ -19,7 +19,7 @@
     Changelog:
 
     2000-01-05  Bj�rn Jacke <bjoern.jacke@gmx.de>
-                Initial Release insprired by the article about phonetic
+                Initial Release inspired by the article about phonetic
                 transformations out of c't 25/1999
 
 */

modules/speller/default/readonly_ws.cpp

@@ -218,8 +218,8 @@ namespace {
 
     char *           block;
     u32int           block_size;
-    char *           mmaped_block;
-    u32int           mmaped_size;
+    char *           mmapped_block;
+    u32int           mmapped_size;
     const Jump * jump1;
     const Jump * jump2;
     WordLookup       word_lookup;
@@ -245,8 +245,8 @@ namespace {
 
     ~ReadOnlyDict() {
       if (block != 0) {
-	if (mmaped_block)
-	  mmap_free(mmaped_block, mmaped_size);
+	if (mmapped_block)
+	  mmap_free(mmapped_block, mmapped_size);
 	else
 	  free(block);
       }
@@ -476,12 +476,12 @@ namespace {
 
     block_size = data_head.block_size;
     int offset = data_head.head_size;
-    mmaped_block = mmap_open(block_size + offset, f, 0);
-    if( mmaped_block != (char *)MAP_FAILED) {
-      block = mmaped_block + offset;
-      mmaped_size = block_size + offset;
+    mmapped_block = mmap_open(block_size + offset, f, 0);
+    if( mmapped_block != (char *)MAP_FAILED) {
+      block = mmapped_block + offset;
+      mmapped_size = block_size + offset;
     } else {
-      mmaped_block = 0;
+      mmapped_block = 0;
       block = (char *)malloc(block_size);
       f.seek(data_head.head_size);
       f.read(block, block_size);

modules/speller/default/speller_impl.cpp

@@ -96,19 +96,19 @@ namespace aspeller {
       correct = check_affix(cor1, w1, 0) && check_affix(cor2, w2, 0);
     }
     if (correct) {
-      String cor_orignal_casing(cor1);
+      String cor_original_casing(cor1);
       if (!cor2.empty()) {
-        cor_orignal_casing += cor[pos-1];
-        cor_orignal_casing += cor2;
+        cor_original_casing += cor[pos-1];
+        cor_original_casing += cor2;
       }
       // Don't try to add the empty string, causes all kinds of
       // problems.  Can happen if the original replacement nothing but
       // whitespace.
-      if (cor_orignal_casing.empty()) 
+      if (cor_original_casing.empty()) 
         return no_err;
       if (first_word == 0 || cor != first_word) {
         lang().to_lower(buf, mis.str());
-        repl_->add_repl(buf, cor_orignal_casing);
+        repl_->add_repl(buf, cor_original_casing);
       }
 
       if (memory && prev_cor_repl_ == mis) 
@@ -307,7 +307,7 @@ namespace aspeller {
 
   //////////////////////////////////////////////////////////////////////
   //
-  // Word list managment methods
+  // Word list management methods
   //
 
   PosibErr<void> SpellerImpl::save_all_word_lists() {
@@ -765,7 +765,7 @@ namespace aspeller {
 
   //////////////////////////////////////////////////////////////////////
   //
-  // SpellerImpl destrution members
+  // SpellerImpl destruction members
   //
 
   SpellerImpl::~SpellerImpl() {

modules/speller/default/suggest.cpp

@@ -323,7 +323,7 @@ namespace {
       return (parms->word_weight*word_score 
 	      + parms->soundslike_weight*soundslike_score)/100;
     }
-    int adj_wighted_average(int soundslike_score, int word_score, int one_edit_max) {
+    int adj_weighted_average(int soundslike_score, int word_score, int one_edit_max) {
       int soundslike_weight = parms->soundslike_weight;
       int word_weight = parms->word_weight;
       if (word_score <= one_edit_max) {
@@ -334,8 +334,8 @@ namespace {
       // adjust the word score so it doesn't contribute as much.  If
       // the score is already around 100 (one edit dist) then it may
       // not be a good idea to lower it more, but if the word score is
-      // 200 or more then it might make sence to reduce it some.
-      // HOWEVER, this will likely not work well, espacally with small
+      // 200 or more then it might make sense to reduce it some.
+      // HOWEVER, this will likely not work well, especially with small
       // words and there are just too many words with the same
       // soundlike.  In any case that what the special "soundslike"
       // and "bad-spellers" mode is for.
@@ -1489,7 +1489,7 @@ namespace {
               i->word_score = new_score;
           }
           if (!special.is_overall_score) 
-            i->adj_score = adj_wighted_average(i->soundslike_score, i->word_score, parms->ti->max);
+            i->adj_score = adj_weighted_average(i->soundslike_score, i->word_score, parms->ti->max);
         }
         if (i->adj_score > adj_threshold)
           adj_threshold = i->adj_score;

modules/speller/default/typo_editdist.hpp

@@ -16,7 +16,7 @@ namespace aspeller {
 
   struct TypoEditDistanceInfo : public Cacheable {
     int missing; // the cost of having to insert a character
-    int swap;    // the cost of swapping two adjecent letters
+    int swap;    // the cost of swapping two adjacent letters
     short * data; // memory for repl and extra
     ShortMatrix repl; // the cost of replacing one letter with another
     ShortMatrix extra; // the cost of removing an extra letter

modules/speller/default/vector_hash.hpp

@@ -22,7 +22,7 @@
 namespace aspeller {
 
   //
-  // This hash table is implemnted as a Open Address Hash Table
+  // This hash table is implemented as a Open Address Hash Table
   // which uses a Vector like object to store its data.  So
   // it might even be considered an adapter
   //

myspell/munch.c

@@ -630,7 +630,7 @@ int load_tables(FILE * wdlst)
   tableptr = (struct hentry *) calloc(tablesize, sizeof(struct hentry));
   if (! tableptr) return 3;
 
-  /* loop thorugh all words on much list and add to hash
+  /* loop through all words on much list and add to hash
    * table and store away word and affix strings in tmpfile
    */
 

prog/aspell.cpp

@@ -2824,7 +2824,7 @@ namespace acommon {
 
 static const char * usage_text[] = 
 {
-  /* TRANSLATORS: These should all be formated to fit in 80 column or
+  /* TRANSLATORS: These should all be formatted to fit in 80 column or
      less */
   N_("Usage: aspell [options] <command>"),
   N_("<command> is one of:"),
@@ -2959,7 +2959,7 @@ void print_help (bool verbose) {
     putchar('\n');
     putchar('\n');
     puts(  
-      /* TRANSLATORS: This should be formated to fit in 80 column or less */
+      /* TRANSLATORS: This should be formatted to fit in 80 column or less */
       _("Available Filter Modes:\n"
         "    Filter Modes are reconfigured combinations of filters optimized for\n"
         "    files of a specific type. A mode is selected via the \"mode\" option.\n"

scripts/munchlist

@@ -35,7 +35,7 @@
 # SUCH DAMAGE.
 #
 #
-#  THIS SCRIPT HAS BEEN MOFIFIED FORM THE ORIGINAL VERSION TO WORK
+#  THIS SCRIPT HAS BEEN MODIFIED FORM THE ORIGINAL VERSION TO WORK
 #  WITH ASPELL.
 #
 #	Given a list of words for ispell, generate a reduced list

win32/settings.h

@@ -4,7 +4,7 @@
 /* Defined if no special Workarounds are needed for Curses headers */
 /* #undef CURSES_INCLUDE_STANDARD */
 
-/* Defined if special Wordaround I is need for Curses headers */
+/* Defined if special Workaround I is needed for Curses headers */
 /* #undef CURSES_INCLUDE_WORKAROUND_1 */
 
 /* Defined if curses like POSIX Functions should be used */
@@ -73,7 +73,7 @@
 /* Defined if Posix Termios is Supported */
 /* #undef POSIX_TERMIOS */
 
-/* Defined if STL rel_ops polute the global namespace */
+/* Defined if STL rel_ops pollute the global namespace */
 /* #undef REL_OPS_POLLUTION */
 
 /* Define to 1 if you have the ANSI C header files. */