Site icon Towards AI

Extracting Features from Text Data

Extracting Features from Text Data

Author(s): Bala Priya C

Natural Language Processing

Part 3 of the 6 part technical series onĀ NLP

Photo by Caleb Woods onĀ Unsplash

Hey everyone! šŸ‘‹ This is part 3 of the 6 part NLPĀ series;

Part 1 of the NLP series introduced basic concepts in Natural Language Processing, ideallyĀ NLP101;

Part 2 covered certain linguistic aspects, challenges in preserving semantics, understanding shallow parsing, Named Entity Recognition (NER) and introduction to languageĀ models.

In this part, we seek to cover the Bag-of-Words Model and TF-IDF vectorization of text, simple feature extraction techniques that yield numeric representation of theĀ data.šŸ“°

Understanding Bag-of-Words Model

A Bag-of-Words model (BoW), is a simple way of extracting features from text, representing documents in a corpus in numeric form asĀ vectors.

A bag-of-words is a vector representation of text that describes the occurrence of words in a document.

Why is it called a ā€˜bagā€™Ā ?šŸ¤”

It is called a ā€˜bagā€™ of words, because any information about the order or contextual occurrence of words in the document is discarded.

Illustrating Bag-of-Words (ImageĀ Source)

The BoW model only takes into account whether a word occurs in the document, not where in the document. Therefore, itā€™s analogous to collecting all the words in all the documents across the corpus in a bagĀ šŸ™‚

The Bag-of-Words model requires the following:

Each text document is represented as a numeric vector, which each dimension denoting a specific word from the corpus. Letā€™s take a simple example as shownĀ below.

# This is our corpus
It was the best of times,
it was the worst of times,
it was the age of wisdom,
it was the age of foolishness,

Step 1: Collect theĀ data

We have our small corpus, the first few lines from ā€˜A Tale of Two Citiesā€™ by Charles Dickens. Letā€™s consider each sentence as a document.

Step 2: Construct the vocabulary

  1. Construct a list of all words in the vocabulary
  2. Retain only the unique words and ignore case and punctuations (recall: text pre-processing)
  3. From the above corpus of 24 words, we now have our vocabulary of 10 wordsĀ šŸ˜Š

Step 3: Create DocumentĀ Vectors

As we know the vocabulary has 10 words, we can use a fixed-length document vector of size 10, with one position in the vector to score eachĀ word.

The simplest scoring method is to mark the presence of a word as 1, if the word is present in the document, 0 otherwise

Oh yeah! thatā€™s simple enough; Letā€™s look at our document vectors now!Ā šŸ˜ƒ

ā€œit was the best of timesā€  = [1, 1, 1, 1, 1, 1, 0, 0, 0, 0]
ā€œit was the worst of timesā€ = [1, 1, 1, 0, 1, 1, 1, 0, 0, 0]
ā€œit was the age of wisdomā€  = [1, 1, 1, 0, 1, 0, 0, 1, 1, 0]
ā€œit was the age of foolishnessā€ = [1, 1, 1, 0, 1, 0, 0, 1, 0, 1]

Guess youā€™ve already identified the issues with this approach! ā€šŸ’ā€ā™€ļø

Do you remember the N-grams language model from partĀ 2?šŸ™„

Oh yeah, a straight forward extension of Bag-of -Words to Bag-of-N-grams helps us achieve justĀ that!

An N-gram is basically a collection of word tokens from a text document such that these tokens are contiguous and occur in a sequence. Bi-grams indicate n-grams of order 2 (two words), Tri-grams indicate n-grams of order 3 (three words), and soĀ on.

The Bag of N-Grams model is hence just an extension of the Bag of Words model so we can also leverage N-gram based features.

Just because a word appears frequently, does it necessarily mean itā€™s importantĀ ? Well, not necessarily.

In the next section, we shall look at another metric, the TF-IDF score, which does not consider ordering of words, but aims at capturing the relative importance of words across documents in aĀ corpus.

Term Frequency- Inverse Document Frequency

Term Frequency- Inverse Document Frequency (TF-IDF Score) is a combination of two metricsā€Šā€”ā€Šthe Term Frequency (TF) and the Inverse Document Frequency (IDF)

The idea behind TF-IDF score which is computed using the formula described below is asĀ follows:

ā€œ If a word occurs frequently in a specific document, then itā€™s important whereas a word which occurs frequently across all documents in the corpus should be down-weighted to be able to get the words which are actually important.ā€

TF-IDF Score (ImageĀ Source)

Hereā€™s another widely usedĀ formula;

Calculating TF-IDF score (ImageĀ Source)

The above formula helps us calculate the TF-IDF score for term i in document j and we do it for all terms in all documents in the corpus. We therefore, get the term-document matrix of shape num_terms x num_documentsĀ . Hereā€™s anĀ example.

Document 1: Machine learning teaches machine how to learn
Document 2: Machine translation is my favorite subject
Document 3: Term frequency and inverse document frequency is important

Step 1: Computing f_{ij}; Frequency of term i in documentĀ j

For DocumentĀ 1:

Term frequencies for Document 1 (ImageĀ Source)

For DocumentĀ 2:

Term frequencies for Document 2 (ImageĀ Source)

For DocumentĀ 3:

Term frequencies for Document 3 (ImageĀ Source)

Step 2: Computing Normalized Term Frequency

As shown in the above formula, the f_{ij} obtained above should be divided by the total number of words in document jĀ .

Normalized term frequencies (ImageĀ Source)

Step 3: Compute Inverse Document Frequency (IDF) score for eachĀ term

IDF Scores of terms (ImageĀ Source)

Step 4: Obtain the TF-IDFĀ Scores

Now that weā€™ve calculated TF_{ij} and IDF_{ij}, letā€™s go ahead and multiply them to get the weights w_{ij} (TF-IDF_{ij}).

TF-IDF scores (ImageĀ Source)

Starting with raw text data, weā€™ve successfully represented the documents in numeric form. Oh yeah! We didĀ it!šŸŽ‰

Now that we know to build numeric features from text data, as a next step, we can use these numeric representations to understand tutorials on understanding document similarity, similarity based clustering of documents in a corpus and generating topic models that are representative of latent topics in a large textĀ corpus.

So far, weā€™ve looked at traditional methods in Natural language Processing. In the next part, we shall take baby steps into the realm of Deep learning forĀ NLP.āœØ

Happy learning! Until next timeĀ šŸ˜Š

References

Hereā€™s the link to the recording of theĀ webinar.


Extracting Features from Text Data was originally published in Towards AI on Medium, where people are continuing the conversation by highlighting and responding to this story.

Published via Towards AI

Exit mobile version