Word with Maximum Frequency

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashMap;
import java.util.Map;
import java.util.Set;

public class WordFrequency {

public static void main(String[] args) {
    HashMap<String, Integer> hs = new HashMap<String, Integer>();

    try (BufferedReader br = new BufferedReader(new InputStreamReader(System.in))) {
        String line;
        while ((line = br.readLine()) != null) {
            line = line.replaceAll("[,.]", "");
            String[] words = line.split(" ");
            for (int i = 0; i < words.length; i++) {
                if (hs.containsKey(words[i])) {
                    hs.put(words[i], hs.get(words[i]) + 1);
                } else {
                    hs.put(words[i], 1);
                }
            }
        }

        Set<Map.Entry<String, Integer>> set = hs.entrySet();
        String key = "";
        int value = 0;

        for (Map.Entry<String, Integer> me : set) {
            if (me.getValue() > value) {
                value = me.getValue();
                key = me.getKey();
            }
        }
        
        System.out.println(key);
    } catch (IOException e) {
        System.out.println(e);
    }
}

}