3. Write a program called alice_words.py that creates a text file named alice_words.txt containing an alphabetical listing of all the words, and the number of times each occurs, in the text version of Alice's Adventures in Wonderland. (You can obtain a free plain text version of the book, along with many others, from http://www.gutenberg.org.) The first 10 lines of your output file should look something like this: Word Count === a 631 a-piece abide 1 1 net/thinkcs/python/english3e/dictionaries.html[1/4/2012 9:38:26 PM] to Think Like a Computer Scientist: Learning with Python 3 able 1 about 94 above absence 1 absurd How many times does the word, alice, occur in the book? 4. What is the longest word in Alice in Wonderland? How many characters does it have?

Database System Concepts
7th Edition
ISBN:9780078022159
Author:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Chapter1: Introduction
Section: Chapter Questions
Problem 1PE
icon
Related questions
Question
How do you do 3 and 4 in Python? I have also attached some resources
def main():
# Prompt the user to enter a file
filename =
input ("Enter a filename: ").strip()
infile = open(filename, "r") # Open the file
wordCounts = {} # Create an empty dictionary to count words
for line in infile:
processLine (line.lower ( ), wordCounts)
pairs
list(wordCounts.items(O) # Get pairs from the dictionary
items = [[x, y] for (y, x) in pairs] # Reverse pairs in the list
items.sort() # Sort pairs in items
for i in range(len(items) - 1, len (items) - 11, -1):
print(items[i][1] + "\t" + str(items[i][0]))
# Count each word in the line
def processLine(line, wordCounts):
line = replacePunctuations(line) # Replace punctuations with space
words = line.split() # Get words from each line
for word in words:
if word in wordCounts:
wordCounts[word] += 1
else:
wordCounts[word] = 1
# Replace punctuations in the line with space
def replacePunctuations (line):
for ch in line:
if ch in "~@#$%^&* ( ) _-+=~<>?/,.;:!{}[]|'\"":
line =
line.replace (ch,
%3D
")
return line
main() # Call the main function
Transcribed Image Text:def main(): # Prompt the user to enter a file filename = input ("Enter a filename: ").strip() infile = open(filename, "r") # Open the file wordCounts = {} # Create an empty dictionary to count words for line in infile: processLine (line.lower ( ), wordCounts) pairs list(wordCounts.items(O) # Get pairs from the dictionary items = [[x, y] for (y, x) in pairs] # Reverse pairs in the list items.sort() # Sort pairs in items for i in range(len(items) - 1, len (items) - 11, -1): print(items[i][1] + "\t" + str(items[i][0])) # Count each word in the line def processLine(line, wordCounts): line = replacePunctuations(line) # Replace punctuations with space words = line.split() # Get words from each line for word in words: if word in wordCounts: wordCounts[word] += 1 else: wordCounts[word] = 1 # Replace punctuations in the line with space def replacePunctuations (line): for ch in line: if ch in "~@#$%^&* ( ) _-+=~<>?/,.;:!{}[]|'\"": line = line.replace (ch, %3D ") return line main() # Call the main function
3. Write a program called alice_words.py that creates a text file named alice_words.txt containing
an alphabetical listing of all the words, and the number of times each occurs, in the text version
of Alice's Adventures in Wonderland. (You can obtain a free plain text version of the book,
along with many others, from http://www.gutenberg.org.) The first 10 lines of your output file
should look something like this:
Word
Count
=====
a
631
а -piece
abide
1
1
kproject.net/thinkcs/python/english3e/dictionaries.html[1/4/2012 9:38:26 PM]
S- How to Think Like a Computer Scientist: Learning with Python 3
able
1
about
94
above
3
absence
1
absurd
2
How many times does the word, alice, occur in the book?
4. What is the longest word in Alice in Wonderland? How many characters does it have?
Transcribed Image Text:3. Write a program called alice_words.py that creates a text file named alice_words.txt containing an alphabetical listing of all the words, and the number of times each occurs, in the text version of Alice's Adventures in Wonderland. (You can obtain a free plain text version of the book, along with many others, from http://www.gutenberg.org.) The first 10 lines of your output file should look something like this: Word Count ===== a 631 а -piece abide 1 1 kproject.net/thinkcs/python/english3e/dictionaries.html[1/4/2012 9:38:26 PM] S- How to Think Like a Computer Scientist: Learning with Python 3 able 1 about 94 above 3 absence 1 absurd 2 How many times does the word, alice, occur in the book? 4. What is the longest word in Alice in Wonderland? How many characters does it have?
Expert Solution
trending now

Trending now

This is a popular solution!

steps

Step by step

Solved in 2 steps with 1 images

Blurred answer
Knowledge Booster
File Input and Output Operations
Learn more about
Need a deep-dive on the concept behind this application? Look no further. Learn more about this topic, computer-science and related others by exploring similar questions and additional content below.
Recommended textbooks for you
Database System Concepts
Database System Concepts
Computer Science
ISBN:
9780078022159
Author:
Abraham Silberschatz Professor, Henry F. Korth, S. Sudarshan
Publisher:
McGraw-Hill Education
Starting Out with Python (4th Edition)
Starting Out with Python (4th Edition)
Computer Science
ISBN:
9780134444321
Author:
Tony Gaddis
Publisher:
PEARSON
Digital Fundamentals (11th Edition)
Digital Fundamentals (11th Edition)
Computer Science
ISBN:
9780132737968
Author:
Thomas L. Floyd
Publisher:
PEARSON
C How to Program (8th Edition)
C How to Program (8th Edition)
Computer Science
ISBN:
9780133976892
Author:
Paul J. Deitel, Harvey Deitel
Publisher:
PEARSON
Database Systems: Design, Implementation, & Manag…
Database Systems: Design, Implementation, & Manag…
Computer Science
ISBN:
9781337627900
Author:
Carlos Coronel, Steven Morris
Publisher:
Cengage Learning
Programmable Logic Controllers
Programmable Logic Controllers
Computer Science
ISBN:
9780073373843
Author:
Frank D. Petruzella
Publisher:
McGraw-Hill Education