Skip to content

learn-co-students/dsc-analyzing-macbeth-project-data-science

Folders and files

NameName
Last commit message
Last commit date

Latest commit

 

History

15 Commits
 
 
 
 
 
 
 
 
 
 
 
 
 
 

Repository files navigation

Project: Analyzing Macbeth

Introduction

Now we're going to do some rudimentary analysis of Shakespeare's classic play: Macbeth! You will get practice working with lists and dictionaries, conditionals, visualizing data, and thinking analytically about data.

Objectives

You will be able to:

  • Apply string methods to make changes to a string
  • Use a for loop to iterate over a collection
  • Assign values in a dictionary

Getting the Data

Here we start by importing a Python package called requests. We'll use it to pull the transcript of Macbeth from the Project Gutenberg website. We'll also preview a few details about what is now stored in the variable macbeth. As you can see, it's a string with 120,253 characters - the first 500 of which are printed below.

import requests
macbeth = requests.get('http://www.gutenberg.org/cache/epub/2264/pg2264.txt').text

print(type(macbeth))
print(len(macbeth))
print(macbeth[:500])
<class 'str'>
120253


***The Project Gutenberg's Etext of Shakespeare's First Folio***
********************The Tragedie of Macbeth*********************



*******************************************************************
THIS EBOOK WAS ONE OF PROJECT GUTENBERG'S EARLY FILES PRODUCED AT A
TIME WHEN PROOFING METHODS AND TOOLS WERE NOT WELL DEVELOPED. THERE
IS AN IMPROVED EDITION OF THIS TITLE WHICH MAY BE VIEWED AS EBOOK
(#1533) at https://www.gutenberg.org/ebooks/1533
*********************************

Your Task

Your task is to create a bar graph of the 25 most common words in Shakespeare's Macbeth.

A common Python programming pattern to count objects, produce histograms, or update statistics is to make calls to a dictionary as you iterate through a list. For example, given a list of words, you can create a dictionary to store counts and then iterate through the list of words, checking how many times each word has appeared using your dictionary, and updating the dictionary count now that you've seen that word again. The .get() dictionary method is very useful in doing this. Read the docstring for the .get() method and use it along with the pseudocode below to create a bar graph of the 25 most common words from the transcript of Macbeth which has been loaded into the variable 'macbeth'. Be sure to include a title and appropriate labels for your graph.

To get the 25 most common words, you will have to sort your counts. If you are not super sure how to do this, checkout out the Sorting HOW TO Python documentation. Part of being a data scientist is figuring out how to do tasks that you may not have done before. Remember, in these situations, Google is your friend!

import numpy as np
import matplotlib.pyplot as plt
%matplotlib inline

# Your code here

# Pseudo-code outline

# Split the transcript into words
# Create a dictionary
# Iterate through the text of Macbeth
# Update word counts
# Sort words by counts in descending order
# Create Bar Graph
# Include descriptive titles and labels

Level Up (Optional)

This project should take you about an hour and a half to complete. If you're done much more quickly than that and are not behind in the course, feel free to deepen your knowledge by completing any or all of the following tasks until you run out of time:

  • Create a list of top characters by mentions of their names
  • Split the text by which character is talking
  • Create subgraphs of the most common words by character
  • Reduce the string to the text of the play itself. (Remove any initial notes, forward, introduction, appendix, etc.)
  • Come up with some other fun analyses of the text!

Summary

Congratulations! You've got some extra practice combining various data types into useful programming patterns and done an initial analysis of a classic text!

About

No description, website, or topics provided.

Resources

License

Stars

Watchers

Forks

Releases

No releases published

Packages

No packages published