Java

package ch07.apps;

import java.io.*; import java.util.Scanner; import ch07.trees.*; import support.WordFreq;

public class WordFreqCounter { public static void main(String[] args) throws IOException { String word; WordFreq wordToTry; WordFreq wordInTree;

BinarySearchTree tree = new BinarySearchTree();

int numWords = 0; int numValidWords = 0; int numValidFreqs = 0; int minSize; int minFreq; int treeSize;

// Set up command line reading Scanner scan = new Scanner(System.in);

// Set up file reading String fn; System.out.print("File name > "); fn = scan.next(); Scanner wordsIn = new Scanner(new FileReader(fn)); wordsIn.useDelimiter("[^a-zA-Z']"); // delimiters are nonletters,'

// Get word and frequency limits from user System.out.print("Minimum word size> "); minSize = scan.nextInt(); System.out.print("Minimum word frequency> "); minFreq = scan.nextInt();

// Process file while (wordsIn.hasNext()) // while more words to process { word = wordsIn.next(); numWords++; if (word.length() >= minSize) { numValidWords++; word = word.toLowerCase(); wordToTry = new WordFreq(word); wordInTree = tree.get(wordToTry); if (wordInTree != null) { // word already in tree, just increment frequency wordInTree.inc(); } else { // insert new word into tree wordToTry.inc(); // set frequency to 1 tree.add(wordToTry); } } } // Display results System.out.println("The words of length " + minSize + " and above,"); System.out.println("with frequency counts of " + minFreq + " and above:"); System.out.println(); System.out.println("Freq Word"); System.out.println("----- -----------------"); for (WordFreq wordFromTree: tree) { if (wordFromTree.getFreq() >= minFreq) { numValidFreqs++; System.out.println(wordFromTree); } } System.out.println(); System.out.println(numWords + " words in the input file. "); System.out.println(numValidWords + " of them are at least " + minSize + " characters."); System.out.println(numValidFreqs + " of these occur at least " + minFreq + " times."); System.out.println("Program completed."); } }

Word Frequency Applications: Use the WordFreq class file provided in the source to complete the following: Create an application that will read a text file (.txt) and: Display the longest word (or words if there is a tie) in the file and how many times it occurs. Display the most frequently used word (or words if there is a tie) in the file and how many times they occur. Display the word or words in the file that occur exactly once. a. b. c