import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

public class WordFrequency{
    private HashMap< String, Integer > map;
    private Scanner scanner;

    public WordFrequency() {
        map = new HashMap< String, Integer > ();
        scanner = new Scanner( System.in );
        createMap(); 
        displayMap(); 
    } 
    public void createMap() {
        System.out.println( "Enter the sentence:" ); 
        String input = scanner.nextLine();
        System.out.println ("\n");
        input = input.toLowerCase();
        String delimiter = "[? ,!.;]+"; 

        String [] words = input.split(delimiter);  

        for (int i = 0; i<words.length; i++)  {

            if ( map.containsKey( words[i]))   {

                int count = map.get( words[i]); 
                map.put( words[i], count + 1 );  
            } 
            else  {

                map.put( words[i], 1 );
            }
        } 
    } 
    public void displayMap(){
        TreeSet <String> treeset = new TreeSet<String> ( map.keySet());
        System.out.println ("Printing the Map.......");
        System.out.println ("Keys" + "\t\t" +  "Values");
        for (String s : treeset){

            System.out.println (s + "\t\t" +  map.get (s));

        }
    } 
    public static void main( String args[] ){
        WordFrequency w = new WordFrequency ();
    } 
}