The first step towards supporting the Hungarian spell-checking dictionary....

chrome/tools/convert_dict/dic_reader.cc

 // Copyright (c) 2006-2008 The Chromium Authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "chrome/tools/convert_dict/dic_reader.h"
 
 #include <algorithm>
 #include <set>
 
 #include "base/file_util.h"
@@ skipping 88 matching lines @@
       size_t split1_tab_offset = split[1].find('\t');
       if (split1_tab_offset != std::string::npos)
         split[1] = split[1].substr(0, split1_tab_offset);
 
       if (aff_reader->has_indexed_affixes())
         affix_index = atoi(split[1].c_str());
       else
         affix_index = aff_reader->GetAFIndexForAFString(split[1]);
     }
 
+    // Discard the morphological description if it is attached to the first
+    // token. (It is attached to the first token if a word doesn't have affix
+    // rules.)
+    size_t word_tab_offset = utf8word.find('\t');
+    if (word_tab_offset != std::string::npos)
+      utf8word = utf8word.substr(0, word_tab_offset);
+
     WordSet::iterator found = word_set->find(utf8word);
     if (found == word_set->end()) {
       std::set<int> affix_vector;
       affix_vector.insert(affix_index);
       word_set->insert(std::make_pair(utf8word, affix_vector));
     } else {
       found->second.insert(affix_index);
     }
   }
 
@@ skipping 47 matching lines @@
     std::sort(affixes.begin(), affixes.end());
     words_.push_back(std::make_pair(word->first, affixes));
   }
 
   // Double-check that the words are sorted.
   std::sort(words_.begin(), words_.end());
   return true;
 }
 
 }  // namespace convert_dict