<\/p>\n
Due: Monday 7\/14\/14 @5:30pm via users.cs.umb.edu:cs210\/hw7<\/p>\n
Purpose:<\/strong> 1. Write a program WordCount that takes a file as an argument (as args[0])<\/p>\n 2. Read the file and gather statistics to be printed (using java HashMap or TreeMap)<\/p>\n 3. Find the total unique words. Add them to a Map and then count the size of the keyset.<\/p>\n 4. Store a count for each word and increment it every time you see that word. Hint (get() the count and then put() an updated count. Use this count to find the most and least common words.<\/p>\n 5. Keep track of the length of words using another Map. Use the length as a key and increment the number of words of that length. Sort the keyset for the map and then get the values when iterating over the sorted keyset. You can use new ArrayList(map.keySet()) to get an ArrayList of the keys. You can also use Collections.sort to sort the ArrayList.<\/p>\n 6. Write a memo.txt describing any problems you had during this assignment and what you learned. <\/p>\n Notes: Sample input files: The files needed are here: https:\/\/github.com\/ieee8023\/cs210-summer2014<\/a><\/p>\n Sample HashMap Usage:<\/p>\n To configure your scanner to produce tokens which are only letters using the following code:<\/p>\n A sample run of the program:<\/p>\n and<\/p>\n Grading (total 10 points):<\/strong><\/p>\n Turn in the following files: WordCount.java, memo.txt<\/p>\n 2 points: Total unique words Due: Monday 7\/14\/14 @5:30pm via users.cs.umb.edu:cs210\/hw7 Purpose: Gain experience using a Map (aka Symbol Table aka Association List) 1. Write a program WordCount that takes a file as an argument (as args[0]) 2. Read the file and gather statistics to be printed (using java HashMap or TreeMap) 3. Find the total unique words. Add… Read more »<\/a><\/p>\n","protected":false},"author":1,"featured_media":0,"comment_status":"closed","ping_status":"closed","sticky":false,"template":"","format":"standard","meta":{"footnotes":""},"categories":[2,1],"tags":[],"_links":{"self":[{"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/posts\/444"}],"collection":[{"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/posts"}],"about":[{"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/types\/post"}],"author":[{"embeddable":true,"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/users\/1"}],"replies":[{"embeddable":true,"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/comments?post=444"}],"version-history":[{"count":0,"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/posts\/444\/revisions"}],"wp:attachment":[{"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/media?parent=444"}],"wp:term":[{"taxonomy":"category","embeddable":true,"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/categories?post=444"},{"taxonomy":"post_tag","embeddable":true,"href":"https:\/\/josephpcohen.com\/teaching\/cs210\/wp-json\/wp\/v2\/tags?post=444"}],"curies":[{"name":"wp","href":"https:\/\/api.w.org\/{rel}","templated":true}]}}
\nGain experience using a Map (aka Symbol Table aka Association List)<\/p>\n
\nMake sure you ignore case (Hello and hello are the same word).
\nMake sure you only count words. Words are composed of letters and ‘. (Edited to remove – from being in a valid word)<\/p>\n
\nThe War in the Air by H. G. Wells – warair.txt
\nThe Art of War by Sun Tzu – artofwar.txt
\nRFC-2616 Hypertext Transfer Protocol (HTTP\/1.1) – rfc2616.txt<\/p>\n\/\/ make a new map\nMap map = new HashMap();\n\t \n\/\/ sample string to count\nString word = \"hello\";\n\t \n\/\/ get the existing count of null\nInteger count = map.get(word);\n\n\/\/ if null then initialize\nif (count == null)\n\tcount = 0;\n\t \n\/\/add one to count\ncount++;\n\t \n\/\/ replace or add value\nmap.put(word, count);\n\n\/\/ get all the keys\nSet keys = map.keySet();\n\n\/\/ make the set into a list\nList keylist = new ArrayList(keys);\n\n\/\/ get all the values\nCollection values = map.values();\n\n\/\/ make the set into a list\nList valuelist = new ArrayList(values);\n<\/pre>\n
Scanner in = new Scanner(file);\nin.useDelimiter(\"[ tnrf,.()\/_?!-;:&%@\"]+\");\n<\/pre>\n
$ java WordCount artofwar.txt \n==============\nTotal unique words: 2183\nMost common word \"the\" used 697 times\nLeast common word \"omens\" used 1 time(s)\n==============\nLength 1: 288\nLength 2: 2161\nLength 3: 2243\nLength 4: 1736\nLength 5: 1135\nLength 6: 944\nLength 7: 784\nLength 8: 538\nLength 9: 357\nLength 10: 222\nLength 11: 118\nLength 12: 61\nLength 13: 29\nLength 14: 8\nLength 15: 5\nLength 19: 1\n==============\n<\/pre>\n
$ java WordCount warair.txt \n==============\nTotal unique words: 10072\nMost common word \"the\" used 6503 times\nLeast common word \"encased\" used 1 time(s)\n==============\nLength 1: 4507\nLength 2: 15753\nLength 3: 23732\nLength 4: 17943\nLength 5: 10903\nLength 6: 8211\nLength 7: 6768\nLength 8: 4752\nLength 9: 3238\nLength 10: 2157\nLength 11: 914\nLength 12: 507\nLength 13: 232\nLength 14: 106\nLength 15: 38\nLength 16: 5\nLength 17: 3\n==============\n<\/pre>\n
\n2 points: Most common word
\n2 points: Least common word
\n2 points: Distribution of word lengths
\n2 points: memo.txt, easy to grade.<\/p>\n","protected":false},"excerpt":{"rendered":"