Natural Language Processing with Python¶

This is an overview of the basics of Natural Language Processing, which basically consists of combining machine learning techniques with text, and using math and statistics to get that text in a format that the machine learning algorithms can understand!

In [1]:
import nltk

In [2]:
# nltk.download_shell()


Get the Data¶

We'll be using a dataset from the UCI datasets!

The file we are using contains a collection of more than 5 thousand SMS phone messages.

Let's go ahead and use rstrip() plus a list comprehension to get a list of all the lines of text messages:

In [3]:
messages = [line.rstrip() for line in open('smsspamcollection/SMSSpamCollection')]

In [4]:
len(messages)

Out[4]:
5574

A collection of texts is also sometimes called "corpus". Let's print the first ten messages and number them using enumerate:

In [5]:
for mess_no,message in enumerate(messages[:10]):
print(mess_no,message)
print('\n')

0 ham	Go until jurong point, crazy.. Available only in bugis n great world la e buffet... Cine there got amore wat...

1 ham	Ok lar... Joking wif u oni...

2 spam	Free entry in 2 a wkly comp to win FA Cup final tkts 21st May 2005. Text FA to 87121 to receive entry question(std txt rate)T&C's apply 08452810075over18's

3 ham	U dun say so early hor... U c already then say...

4 ham	Nah I don't think he goes to usf, he lives around here though

5 spam	FreeMsg Hey there darling it's been 3 week's now and no word back! I'd like some fun you up for it still? Tb ok! XxX std chgs to send, £1.50 to rcv

6 ham	Even my brother is not like to speak with me. They treat me like aids patent.

7 ham	As per your request 'Melle Melle (Oru Minnaminunginte Nurungu Vettam)' has been set as your callertune for all Callers. Press *9 to copy your friends Callertune

8 spam	WINNER!! As a valued network customer you have been selected to receivea £900 prize reward! To claim call 09061701461. Claim code KL341. Valid 12 hours only.

9 spam	Had your mobile 11 months or more? U R entitled to Update to the latest colour mobiles with camera for Free! Call The Mobile Update Co FREE on 08002986030



Due to the spacing we can tell that this is a TSV ("tab separated values") file, where the first column is a label saying whether the given message is a normal message (commonly known as "ham") or "spam".

The second column is the message itself. (Note our numbers aren't part of the file, they are just from the enumerate call).

Using these labeled ham and spam examples, we'll train a machine learning model to learn to discriminate between ham/spam automatically. Then, with a trained model, we'll be able to classify arbitrary unlabeled messages as ham or spam.

In [6]:
import pandas as pd


We'll use read_csv and make note of the sep argument, we can also specify the desired column names by passing in a list of names.

In [7]:
messages = pd.read_csv('smsspamcollection/SMSSpamCollection',
sep='\t',names=['label','message'])
messages[:5]

Out[7]:
label message
0 ham Go until jurong point, crazy.. Available only ...
1 ham Ok lar... Joking wif u oni...
2 spam Free entry in 2 a wkly comp to win FA Cup fina...
3 ham U dun say so early hor... U c already then say...
4 ham Nah I don't think he goes to usf, he lives aro...

Exploratory Data Analysis¶

Let's check out some of the stats with some plots and the built-in methods in pandas!

In [8]:
messages.describe()

Out[8]:
label message
count 5572 5572
unique 2 5169
top ham Sorry, I'll call later
freq 4825 30

Let's use groupby to use describe by label, this way we can begin to think about the features that separate ham and spam!

In [65]:
messages.groupby('label').describe()

Out[65]:
message
count unique top freq
label
ham 4825 4516 Sorry, I'll call later 30
spam 747 653 Please call our customer service representativ... 4

Feature engineering¶

As we continue our analysis we want to start thinking about the features we are going to be using. This goes along with the general idea of feature engineering.

The better your domain knowledge on the data, the better your ability to engineer more features from it. Feature engineering is a very large part of spam detection in general. I encourage you to read up on the topic!

In [66]:
# Detect how long the text messages are:
messages['length'] = messages['message'].apply(len)
messages[:5]

Out[66]:
label message length
0 ham Go until jurong point, crazy.. Available only ... 111
1 ham Ok lar... Joking wif u oni... 29
2 spam Free entry in 2 a wkly comp to win FA Cup fina... 155
3 ham U dun say so early hor... U c already then say... 49
4 ham Nah I don't think he goes to usf, he lives aro... 61

Data Visualization¶

Let's visualize this! Let's do the imports:

In [67]:
import matplotlib.pyplot as plt
import seaborn as sns

%matplotlib inline

In [68]:
messages['length'].plot.hist(bins=50)

Out[68]:
<matplotlib.axes._subplots.AxesSubplot at 0x10c785400>

Play around with the bin size! Looks like text length may be a good feature to think about! Let's try to explain why the x-axis goes all the way to 1000ish, this must mean that there is some really long message!

In [69]:
messages['length'].describe()

Out[69]:
count    5572.000000
mean       80.489950
std        59.942907
min         2.000000
25%        36.000000
50%        62.000000
75%       122.000000
max       910.000000
Name: length, dtype: float64

Woah! 910 characters, let's use masking to find this message:

In [70]:
messages[messages['length']==910]['message'].iloc[0]

Out[70]:
"For me the love should start with attraction.i should feel that I need her every time around me.she should be the first thing which comes in my thoughts.I would start the day and end it with her.she should be there every time I dream.love will be then when my every breath has her name.my life should happen around her.my life will be named to her.I would cry for her.will give all my happiness and take all her sorrows.I will be ready to fight with anyone for her.I will be in love when I will be doing the craziest things for her.love will be when I don't have to proove anyone that my girl is the most beautiful lady on the whole planet.I will always be singing praises for her.love will be when I start up making chicken curry and end up makiing sambar.life will be the most beautiful then.will get every morning and thank god for the day because she is with me.I would like to say a lot..will tell later.."

Looks like we have some sort of Romeo sending texts! But let's focus back on the idea of trying to see if message length is a distinguishing feature between ham and spam:

In [71]:
messages.hist(column='length',by='label',bins=50,figsize=(12,5))

Out[71]:
array([<matplotlib.axes._subplots.AxesSubplot object at 0x10c9e6cf8>,
<matplotlib.axes._subplots.AxesSubplot object at 0x10c99def0>],
dtype=object)

Very interesting! Through just basic EDA we've been able to discover a trend that spam messages tend to have more characters.

Now let's begin to process the data so we can eventually use it with SciKit Learn!

Text Pre-processing¶

Our main issue with our data is that it is all in text format (strings). The classification algorithms that we've learned about so far will need some sort of numerical feature vector in order to perform the classification task. There are actually many methods to convert a corpus to a vector format. The simplest is the the bag-of-words approach, where each unique word in a text will be represented by one number.

In this section we'll convert the raw messages (sequence of characters) into vectors (sequences of numbers).

As a first step, let's write a function that will split a message into its individual words and return a list. We'll also remove very common words, ('the', 'a', etc..). To do this we will take advantage of the NLTK library. It's pretty much the standard library in Python for processing text and has a lot of useful features. We'll only use some of the basic ones here.

Let's create a function that will process the string in the message column, then we can just use apply() in pandas do process all the text in the DataFrame.

First removing punctuation. We can just take advantage of Python's built-in string library to get a quick list of all the possible punctuation:

In [72]:
import string
from nltk.corpus import stopwords


Now let's see how to remove stopwords. We can impot a list of english stopwords from NLTK (check the documentation for more languages and info).

Put text processes together in a function to apply it to our DataFrame later on:

In [77]:
def text_process(mess):
""""
1.remove punc
2.remove stopwords
3.return list of cleanwords.
"""
# Check characters to see if they are in punctuation
nopunc = (char for char in mess if char not in string.punctuation)
# Join the characters as lowercased to form the string.
nopunc = ''.join(nopunc).lower()
# Now just remove any stopwords
return [word for word in nopunc.split() if word not in stopwords.words('english')]


Now let's "tokenize" these messages. Tokenization is just the term used to describe the process of converting the normal text strings in to a list of tokens (words that we actually want).

In [78]:
messages['clean_text'] = messages['message'].apply(text_process)

In [79]:
# Check to make sure its working
messages[:5]

Out[79]:
label message length clean_text
0 ham Go until jurong point, crazy.. Available only ... 111 [go, jurong, point, crazy, available, bugis, n...
1 ham Ok lar... Joking wif u oni... 29 [ok, lar, joking, wif, u, oni]
2 spam Free entry in 2 a wkly comp to win FA Cup fina... 155 [free, entry, 2, wkly, comp, win, fa, cup, fin...
3 ham U dun say so early hor... U c already then say... 49 [u, dun, say, early, hor, u, c, already, say]
4 ham Nah I don't think he goes to usf, he lives aro... 61 [nah, dont, think, goes, usf, lives, around, t...

Continuing Normalization¶

There are a lot of ways to continue normalizing this text. Such as Stemming or distinguishing by part of speech.

NLTK has lots of built-in tools and great documentation on a lot of these methods. Sometimes they don't work well for text-messages due to the way a lot of people tend to use abbreviations or shorthand, For example:

'Nah dawg, IDK! Wut time u headin to da club?'



versus

'No dog, I don't know! What time are you heading to the club?'



Some text normalization methods will have trouble with this type of shorthand and so I'll leave you to explore those more advanced methods through the NLTK book online.

For now we will just focus on using what we have to convert our list of words to an actual vector that SciKit-Learn can use.

Vectorization¶

Currently, we have the messages as lists of tokens (also known as lemmas) and now we need to convert each of those messages into a vector the SciKit Learn's algorithm models can work with.

Now we'll convert each message, represented as a list of tokens (lemmas) above, into a vector that machine learning models can understand.

We'll do that in three steps using the bag-of-words model:

1. Count how many times does a word occur in each message (Known as term frequency)

2. Weigh the counts, so that frequent tokens get lower weight (inverse document frequency)

3. Normalize the vectors to unit length, to abstract from the original text length (L2 norm)

Let's begin the first step:

Each vector will have as many dimensions as there are unique words in the SMS corpus. We will first use SciKit Learn's CountVectorizer. This model will convert a collection of text documents to a matrix of token counts.

We can imagine this as a 2-Dimensional matrix. Where the 1-dimension is the entire vocabulary (1 row per word) and the other dimension are the actual documents, in this case a column per text message.

For example:

<table border = “1“>

Message 1 Message 2 ... Message N </tr>

Word 1 Count01...0 </tr>

Word 2 Count00...0 </tr>

... 12...0 </tr>

Word N Count 01...1 </tr> </table>

Since there are so many messages, we can expect a lot of zero counts for the presence of that word in that document. Because of this, SciKit Learn will output a Sparse Matrix.

In [80]:
from sklearn.feature_extraction.text import CountVectorizer


There are a lot of arguments and parameters that can be passed to the CountVectorizer. In this case we will just specify the analyzer to be our own previously defined function:

In [81]:
# Might take awhile...
bow_transformer = CountVectorizer(analyzer=text_process).fit(messages['message'])

In [82]:
# Print total number of vocab words
print(len(bow_transformer.vocabulary_))

9530


Let's take one text message and get its bag-of-words counts as a vector, putting to use our new bow_transformer:

In [83]:
mess20 = messages['message'][21]
print(mess20)

I‘m going to try for 2 months ha ha only joking


Now let's see its vector representation:

In [84]:
bow20 = bow_transformer.transform([mess20])
print(bow20)

  (0, 416)	1
(0, 3805)	1
(0, 3955)	2
(0, 4578)	1
(0, 4664)	1
(0, 5575)	1
(0, 8565)	1


This means that there are seven unique words in message number 20 (after removing common stop words). One appears twice, the rest only once. Let's go ahead and check and confirm which one is appearing twice:

In [98]:
bow_transformer.get_feature_names()[5575]

Out[98]:
'months'
In [85]:
bow_transformer.get_feature_names()[3955]

Out[85]:
'ha'

Now we can use .transform on our Bag-of-Words (bow) transformed object and transform the entire DataFrame of messages. Let's go ahead and check out how the bag-of-words counts for the entire SMS corpus is a large, sparse matrix:

In [86]:
messages_bow = bow_transformer.transform(messages['message'])

In [87]:
print('Shape of Sparse Matrix: ',messages_bow.shape)

Shape of Sparse Matrix:  (5572, 9530)


Amount of non zero occurences

In [88]:
messages_bow.nnz

Out[88]:
50101
In [90]:
sparsity = (100.0 * messages_bow.nnz / (messages_bow.shape[0] * messages_bow.shape[1]))

print('sparsity: {}'.format(round(sparsity)))

sparsity: 0


After the counting, the term weighting and normalization can be done with TF-IDF, using scikit-learn's TfidfTransformer.

So what is TF-IDF?¶

TF-IDF stands for term frequency-inverse document frequency, and the tf-idf weight is a weight often used in information retrieval and text mining. This weight is a statistical measure used to evaluate how important a word is to a document in a collection or corpus. The importance increases proportionally to the number of times a word appears in the document but is offset by the frequency of the word in the corpus. Variations of the tf-idf weighting scheme are often used by search engines as a central tool in scoring and ranking a document's relevance given a user query.

One of the simplest ranking functions is computed by summing the tf-idf for each query term; many more sophisticated ranking functions are variants of this simple model.

Typically, the tf-idf weight is composed by two terms: the first computes the normalized Term Frequency (TF), aka. the number of times a word appears in a document, divided by the total number of words in that document; the second term is the Inverse Document Frequency (IDF), computed as the logarithm of the number of the documents in the corpus divided by the number of documents where the specific term appears.

TF: Term Frequency, which measures how frequently a term occurs in a document. Since every document is different in length, it is possible that a term would appear much more times in long documents than shorter ones. Thus, the term frequency is often divided by the document length (aka. the total number of terms in the document) as a way of normalization:

TF(t) = (Number of times term t appears in a document) / (Total number of terms in the document).

IDF: Inverse Document Frequency, which measures how important a term is. While computing TF, all terms are considered equally important. However it is known that certain terms, such as "is", "of", and "that", may appear a lot of times but have little importance. Thus we need to weigh down the frequent terms while scale up the rare ones, by computing the following:

IDF(t) = log_e(Total number of documents / Number of documents with term t in it).

See below for a simple example.

Example:

Consider a document containing 100 words wherein the word cat appears 3 times.

The term frequency (i.e., tf) for cat is then (3 / 100) = 0.03. Now, assume we have 10 million documents and the word cat appears in one thousand of these. Then, the inverse document frequency (i.e., idf) is calculated as log(10,000,000 / 1,000) = 4. Thus, the Tf-idf weight is the product of these quantities: 0.03 * 4 = 0.12.

Let's go ahead and see how we can do this in SciKit Learn:

In [91]:
from sklearn.feature_extraction.text import TfidfTransformer


We'll go ahead and check what is the IDF (inverse document frequency) of the word months

In [99]:
tfidf_transformer = TfidfTransformer().fit(messages_bow)

In [100]:
tfidf20 = tfidf_transformer.transform(bow20)
print(tfidf20)

  (0, 8565)	0.2686396982967425
(0, 5575)	0.33805905877567666
(0, 4664)	0.3635762424966303
(0, 4578)	0.3708740472365777
(0, 3955)	0.6843567064454904
(0, 3805)	0.21368772803126498
(0, 416)	0.17264702571735202

In [102]:
tfidf_transformer.idf_[bow_transformer.vocabulary_['months']]

Out[102]:
7.140782137781536

To transform the entire bag-of-words corpus into TF-IDF corpus at once:

In [103]:
messages_tfidf = tfidf_transformer.transform(messages_bow)


There are many ways the data can be preprocessed and vectorized. These steps involve feature engineering and building a "pipeline". I encourage you to check out SciKit Learn's documentation on dealing with text data as well as the expansive collection of available papers and books on the general topic of NLP.

Training a model¶

With messages represented as vectors, we can finally train our spam/ham classifier. Now we can actually use almost any sort of classification algorithms. For a variety of reasons, the Naive Bayes classifier algorithm is a good choice.

We'll be using scikit-learn here, choosing the Naive Bayes classifier to start with:

In [104]:
from sklearn.naive_bayes import MultinomialNB

In [106]:
spam_detect_model = MultinomialNB().fit(messages_tfidf,messages['label'])


Let's try classifying our single random message and checking how we do:

In [108]:
spam_detect_model.predict(tfidf20)[0]

Out[108]:
'ham'
In [109]:
messages['label'][21]

Out[109]:
'ham'

Fantastic! We've developed a model that can attempt to predict spam vs ham classification!

Part 6: Model Evaluation¶

Now we want to determine how well our model will do overall on the entire dataset. Let's begin by getting all the predictions:

In [110]:
all_pred = spam_detect_model.predict(messages_tfidf)


We can use SciKit Learn's built-in classification report, which returns precision, recall, f1-score, and a column for support (meaning how many cases supported that classification). Check out the links for more detailed info on each of these metrics and the figure below:

There are quite a few possible metrics for evaluating model performance. Which one is the most important depends on the task and the business effects of decisions based off of the model. For example, the cost of mis-predicting "spam" as "ham" is probably much lower than mis-predicting "ham" as "spam".

In the above "evaluation",we evaluated accuracy on the same data we used for training. You should never actually evaluate on the same dataset you train on!

Such evaluation tells us nothing about the true predictive power of our model. If we simply remembered each example during training, the accuracy on training data would trivially be 100%, even though we wouldn't be able to classify any new messages.

A proper way is to split the data into a training/test set, where the model only ever sees the training data during its model fitting and parameter tuning. The test data is never used in any way. This is then our final evaluation on test data is representative of true predictive performance.

Train Test Split¶

In [114]:
from sklearn.model_selection import train_test_split
from sklearn.metrics import classification_report

In [119]:
# X = messages['message']

# y = messages['label']

msg_train, msg_test, label_train, label_test = train_test_split(messages['message'], messages['label'], test_size=0.3)


The test size is 30% of the entire dataset

Creating a Data Pipeline¶

Let's run our model again and then predict off the test set. We will use SciKit Learn's pipeline capabilities to store a pipeline of workflow. This will allow us to set up all the transformations that we will do to the data for future use. Let's see an example of how it works:

In [120]:
from sklearn.pipeline import Pipeline


Now we can directly pass message text data and the pipeline will do our pre-processing for us! We can treat it as a model/estimator API:

In [121]:
pipeline = Pipeline([
('bow',CountVectorizer(analyzer=text_process)),
('tfidf',TfidfTransformer()),
('Classifier',MultinomialNB())
])

In [122]:
pipeline.fit(msg_train,label_train)

Out[122]:
Pipeline(memory=None,
steps=[('bow', CountVectorizer(analyzer=<function text_process at 0x111b36b70>, binary=False,
decode_error='strict', dtype=<class 'numpy.int64'>,
encoding='utf-8', input='content', lowercase=True, max_df=1.0,
max_features=None, min_df=1, ngram_range=(1, 1), preprocessor=None,...f=False, use_idf=True)), ('Classifier', MultinomialNB(alpha=1.0, class_prior=None, fit_prior=True))])
In [123]:
prediction = pipeline.predict(msg_test)

In [124]:
print(classification_report(label_test,prediction))

             precision    recall  f1-score   support

ham       0.95      1.00      0.97      1441
spam       1.00      0.67      0.80       231

avg / total       0.96      0.95      0.95      1672



Now we have a classification report for our model on a true testing set! There is a lot more to Natural Language Processing than what we've covered here, and its vast expanse of topic could fill up several college courses! I encourage you to check out the resources below for more information on NLP!