9.8 LAB: Word Count Weite a program that first reads in the raime of an inout file and then reada the file sing the cov readed0 method The fik contains mit ple lines : each a comma segarated list of words. The program must outeut the words and theit frequehbies tive number of tenes eoch wers appeats in the fila) witheut any duplicates and daregarcing case (output the words in lower case) Why do this? in case you are wondenng wry it woudd be important to calcubete bow many times a word oceurted a a documxent. this is a ocnoept known as ferm trequency and is a concept oftien used in information ietreval in fact, one of the ear lent papers related to Big Daia discusaes how Google did word count but at a much latger scide - they were doing t across alt of the documents they had crawicd in bulding thes search inder. Example: If theinput is cintoniesy and the contents of Cintor eav consusted of the folowing 4 knes If, there, is, one, needage, that, echees, forth, fren, thia, conference let, it, be, tkat, humss, rhahti, are, ,youne's, at rights, and, wocen'a, righti aro, hueian, rtabtin, ence, and, for, akl, Wet, wes, not, fotget, that, ansed the outhut is if -1 chere - 1 ts- 1 one-1 tesaage - 1 that -3 achoes - 1 forte -1tran--1thin1obaferuace-11it=21t1 be=2himan4fightn5are=dmonea2and=3iopce=1fer-1a.11-1iu=1inot=1furget:=1afope=1those=1the 3ituht=2to-2apeai=1freely=1hisard1 Notes: - The curient versian of Python stares dictionary entries in the order in which dects were mserted - The itenat) method retums all of the keyvalue pair entries from a dectonary and can be comerted to a lat. For esample if a dictionary was named myydict, a ast (inorder) of af of the entries can be gensrated by caling 1 ist ( my_diec.itena () ). Each item in the list would be a tuple wth the key and value for an entiy: - Similarly sst(nyydetkeys0) will generate a liat of the keys (in ordes)- The cument version of Python stores dictionary entries in the order in which items were ingerted - The items () method relurns all of the keyvalue pair entriea from a dictionary and can be corverted to a fat. For example, if a dictionary was named my_dict, a lst (in ordet) of all of the entries can be generated by calling 1i=1 fy diet. items() ). Each item in the list would be a taple with the key and value for an entry. - Similathy. list my, idict keys0) will generate a jst of the keys (in order). - Output words in oeder of their first occurfence in the fili - The file Clintoncsv is available to download.

1. 9.8 LAB: Word Count Weite a program that first reads in the raime of an inout file and then reada
the file sing the cov readed0 method The fik contains mit ple lines : each a comma segarated list
of words. The program must outeut the words and theit frequehbies tive number of tenes eoch
wers appeats in the fila) witheut any duplicates and daregarcing case (output the words in lower
case) Why do this? in case you are wondenng wry it woudd be important to calcubete bow many
times a word oceurted a a documxent. this is a ocnoept known as ferm trequency and is a concept
oftien used in information ietreval in fact, one of the ear lent papers related to Big Daia discusaes
how Google did word count but at a much latger scide - they were doing t across alt of the
documents they had crawicd in bulding thes search inder. Example: If theinput is cintoniesy and
the contents of Cintor eav consusted of the folowing 4 knes If, there, is, one, needage, that,
echees, forth, fren, thia, conference let, it, be, tkat, humss, rhahti, are, ,youne's, at rights, and,
wocen'a, righti aro, hueian, rtabtin, ence, and, for, akl, Wet, wes, not, fotget, that, ansed the outhut
is if -1 chere - 1 ts- 1 one-1 tesaage - 1 that -3 achoes - 1 forte -1tran--1thin1obaferuace-11it=21t1
be=2himan4fightn5are=dmonea2and=3iopce=1fer-1a.11-1iu=1inot=1furget:=1afope=1those=1the
3ituht=2to-2apeai=1freely=1hisard1 Notes: - The curient versian of Python stares dictionary
entries in the order in which dects were mserted - The itenat) method retums all of the keyvalue
pair entries from a dectonary and can be comerted to a lat. For esample if a dictionary was named
myydict, a ast (inorder) of af of the entries can be gensrated by caling 1 ist ( my_diec.itena () ).
Each item in the list would be a tuple wth the key and value for an entiy: - Similarly
sst(nyydetkeys0) will generate a liat of the keys (in ordes)- The cument version of Python stores
dictionary entries in the order in which items were ingerted - The items () method relurns all of the
keyvalue pair entriea from a dictionary and can be corverted to a fat. For example, if a dictionary
was named my_dict, a lst (in ordet) of all of the entries can be generated by calling 1i=1 fy diet.
items() ). Each item in the list would be a taple with the key and value for an entry. - Similathy. list
my, idict keys0) will generate a jst of the keys (in order). - Output words in oeder of their first
occurfence in the fili - The file Clintoncsv is available to download