Bag-of-words model

For Bag-of-words model in computer vision, see Bag-of-words model in computer vision.

The bag-of-words model is a simplifying representation used in natural language processing and information retrieval (IR). In this model, a text (such as a sentence or a document) is represented as the bag (multiset) of its words, disregarding grammar and even word order but keeping multiplicity. Recently, the bag-of-words model has also been used for computer vision.

The bag-of-words model is commonly used in methods of document classification, where the (frequency of) occurrence of each word is used as a feature for training a classifier.

An early reference to "bag of words" in a linguistic context can be found in Zellig Harris's 1954 article on Distributional Structure.

Example implementation

The following models a text document using bag-of-words.

Here are two simple text documents:

John likes to watch movies. Mary likes too.

John also likes to watch football games.

Based on these two text documents, a dictionary is constructed as:

{
    "John": 1,
    "likes": 2,
    "to": 3,
    "watch": 4,
    "movies": 5,
    "also": 6,
    "football": 7,
    "games": 8,
    "Mary": 9,
    "too": 10
}

which has 10 distinct words. And using the indexes of the dictionary, each document is represented by a 10-entry vector:

[1, 1, 1, 1, 1, 0, 0, 0, 1, 1]
[1, 2, 1, 1, 0, 1, 1, 1, 0, 0]

where each entry of the vectors refers to count of the corresponding entry in the dictionary (this is also the histogram representation). This vector representation does not preserve the order of the words in the original sentences. This kind of representation has several successful applications, for example email filtering.

Term weighting

In the example above, the document vectors contain term frequencies. In both IR and text classification, it is common to weigh terms by various schemes, the most of popular of which is tf–idf. For the specific purpose of classification, supervised alternatives have been developed that take into account the class label of a document.

Hashing trick

A common alternative to the use of dictionaries is the hashing trick, where words are directly mapped to indices with a hashing function. By mapping words to indices directly with a hash function, no memory is required to store a dictionary. Hash collisions are typically dealt with by using freed-up memory to increase the number of hash buckets. In practice, hashing greatly simplifies the implementation of bag-of-words models and improves their scalability.

Example usage: spam filtering

In Bayesian spam filtering, an e-mail message is modeled as an unordered collection of words selected from one of two probability distributions: one representing spam and one representing legitimate e-mail ("ham"). Imagine that there are two literal bags full of words. One bag is filled with words found in spam messages, and the other bag is filled with words found in legitimate e-mail. While any given word is likely to be found somewhere in both bags, the "spam" bag will contain spam-related words such as "stock", "Viagra", and "buy" much more frequently, while the "ham" bag will contain more words related to the user's friends or workplace.

To classify an e-mail message, the Bayesian spam filter assumes that the message is a pile of words that has been poured out randomly from one of the two bags, and uses Bayesian probability to determine which bag it is more likely to be.

See also

• w-shingling
• n-gram
• Vector space model
• Natural language processing
• Additive smoothing
• Document classification
• Machine learning
• Document-term matrix
• Bag-of-words model in computer vision
• Hashing trick
• MinHash
• Feature extraction