import  java.util.Map;
 import  java.util.TreeMap;
 import  java.util.Comparator;

 public   class  WordCounter {

     private  Map<String, Integer> byWord =  new  TreeMap<String, Integer>();

     private  Map<String, Integer> byCount =  new  TreeMap<String, Integer>( new  Comparator<String>() {
         public   int  compare(String o1, String o2) {

            Integer i1 = byWord.containsKey(o1) ? byWord.get(o1) :  0 ;
            Integer i2 = byWord.containsKey(o2) ? byWord.get(o2) :  0 ;

             int  compareValues = i1.compareTo(i2);
             return  compareValues ==  0  ? o1.compareTo(o2) : compareValues;
        }
    });

     public  WordCounter addWord(String word) {
        Integer count = (byWord.containsKey(word) ? byWord.get(word) :  0 ) +  1 ;
        byCount.remove(word);
        byWord.put(word, count);
        byCount.put(word, count);
         return   this ;
    }

     public  Map byWord() {  return  byWord; }

     public  Map byCount() {  return  byCount; }

     public   static   void  main(String[] args) {
        WordCounter c =  new  WordCounter();

        c.addWord("yyy").addWord("yyy").addWord("xxx");
        c.addWord("yyy").addWord("xxx").addWord("zzz");
        c.addWord("zzz").addWord("yyy").addWord("bbb");
        c.addWord("bbb").addWord("bbb").addWord("bbb");
        c.addWord("kkk").addWord("kkk").addWord("kkk");

        System.out.println(c.byWord());
        System.out.println(c.byCount());
    }
}

 public   interface  ICounter {
    ICounter addWord(String word);
    Object byCount();
}

 public   class  CounterTester {
     private   static   void  test(ICounter c) {
        System.out.println(c.getClass().getName());
         long  time = System.currentTimeMillis();
         for  ( int  i= 0 ; i<  1000000 ; i++){
            c.addWord("yyy").addWord("yyy").addWord("xxx");
            c.addWord("yyy").addWord("xxx").addWord("zzz");
            c.addWord("zzz").addWord("yyy").addWord("bbb");
            c.addWord("bbb").addWord("bbb").addWord("bbb");
            c.addWord("kkk").addWord("kkk").addWord("kkk");
            c.addWord("yy").addWord("yy").addWord("xx");
            c.addWord("yy").addWord("xx").addWord("zz");
            c.addWord("zz").addWord("yy").addWord("bb");
            c.addWord("bb").addWord("bb").addWord("bb");
            c.addWord("kk").addWord("kk").addWord("kk");
        }
        System.out.println(c.byCount());
        System.out.println("Time:" + (System.currentTimeMillis() - time));
    }

     public   static   void  main(String[] args) {
        test( new  SuperCounter());
    }
}

 import  java.util.HashMap;
 import  java.util.TreeMap;
 import  java.util.Comparator;

 public   class  SuperCounter  implements  ICounter {

     private   class  MutableInteger {
         int  value;
         public  String toString() {
             return  String.valueOf(value);
        }
    }

     private  HashMap words =  new  HashMap();

     public  ICounter addWord(String word) {
        MutableInteger count = (MutableInteger) words.get(word);
         if  (count ==  null ) {
            count =  new  MutableInteger();
            words.put(word, count);
        }
        count.value++;
         return   this ;
    }

     public  Object byCount() {
        TreeMap sortedMap =  new  TreeMap( new  Comparator() {
             public   int  compare(Object o1, Object o2) {
                 int  i1 = ((MutableInteger) words.get(o1)).value;
                 int  i2 = ((MutableInteger) words.get(o2)).value;
                 if  (i1 > i2)  return   1 ;
                 if  (i1 < i2)  return  - 1 ;
                 return  ((String) o1).compareTo((String) o2);
            }
        });
        sortedMap.putAll(words);
         return  sortedMap;
    }
}