What's a good measure for classifying text documents?

Question

I have written an application that measures text importance. It takes a text article, splits it into words, drops stopwords, performs stemming, and counts word-frequency and document-frequency. Word-frequency is a measure that counts how many times the given word appeared in all documents, and document-frequency is a measure that counts how many documents the given word appeared.

Here's an example with two text articles:

• Article I) "A fox jumps over another fox."
• Article II) "A hunter saw a fox."

Article I gets split into words (afters stemming and dropping stopwords):

• ["fox", "jump", "another", "fox"].

Article II gets split into words:

• ["hunter", "see", "fox"].

These two articles produce the following word-frequency and document-frequency counters:

• fox (word-frequency: 3, document-frequency: 2)
• jump (word-frequency: 1, document-frequency: 1)
• another (word-frequency: 1, document-frequency: 1)
• hunter (word-frequency: 1, document-frequency: 1)
• see (word-frequency: 1, document-frequency: 1)

Given a new text article, how do I measure how similar this article is to previous articles?

I've read about df-idf measure but it doesn't apply here as I'm dropping stopwords, so words like "a" and "the" don't appear in the counters.

For example, I have a new text article that says "hunters love foxes", how do I come up with a measure that says this article is pretty similar to ones previously seen?

Another example, I have a new text article that says "deer are funny", then this one is a totally new article and similarity should be 0.

I imagine I somehow need to sum word-frequency and document-frequency counter values but what's a good formula to use?

Answer 1

A standard solution is to apply the Naive Bayes classifier which estimates the posterior probability of a class C given a document D, denoted as P(C=k|D) (for a binary classification problem, k=0 and 1).

This is estimated by computing the priors from a training set of class labeled documents, where given a document D we know its class C.

P(C|D) = P(D|C) * P(D)              (1)

Naive Bayes assumes that terms are independent, in which case you can write P(D|C) as

P(D|C) = \prod_{t \in D} P(t|C)     (2)

P(t|C) can simply be computed by counting how many times does a term occur in a given class, e.g. you expect that the word football will occur a large number of times in documents belonging to the class (category) sports.

When it comes to the other factor P(D), you can estimate it by counting how many labeled documents are given from each class, may be you have more sports articles than finance ones, which makes you believe that there is a higher likelihood of an unseen document to be classified into the sports category.

It is very easy to incorporate factors, such as term importance (idf), or term dependence into Equation (1). For idf, you add it as a term sampling event from the collection (irrespective of the class). For term dependence, you have to plugin probabilities of the form P(u|C)*P(u|t), which means that you sample a different term u and change (transform) it to t.

Standard implementations of Naive Bayes classifier can be found in the Stanford NLP package, Weka and Scipy among many others.

Answer 2

It seems that you are trying to answer several related questions:

1. How to measure similarity between documents A and B? (Metric learning)
2. How to measure how unusual document C is, compared to some collection of documents? (Anomaly detection)
3. How to split a collection of documents into groups of similar ones? (Clustering)
4. How to predict to which class a document belongs? (Classification)

All of these problems are normally solved in 2 steps:

1. Extract the features: Document --> Representation (usually a numeric vector)
2. Apply the model: Representation --> Result (usually a single number)

There are lots of options for both feature engineering and modeling. Here are just a few.

Feature extraction

1. Bag of words: Document --> number of occurences of each individual word (that is, term frequencies). This is the basic option, but not the only one.
2. Bag of n-grams (on word-level or character-level): co-occurence of several tokens is taken into account.
3. Bag of words + grammatic features (e.g. POS tags)
4. Bag of word embeddings (learned by an external model, e.g. word2vec). You can use embedding as a sequence or take their weighted average.
5. Whatever you can invent (e.g. rules based on dictionary lookup)...

Features may be preprocessed in order to decrease relative amount of noise in them. Some options for preprocessing are:

• dividing by IDF, if you don't have a hard list of stop words or believe that words might be more or less "stoppy"
• normalizing each column (e.g. word count) to have zero mean and unit variance
• taking logs of word counts to reduce noise
• normalizing each row to have L2 norm equal to 1

You cannot know in advance which option(s) is(are) best for your specific application - you have to do experiments.

Now you can build the ML model. Each of 4 problems has its own good solutions.

For classification, the best studied problem, you can use multiple kinds of models, including Naive Bayes, k-nearest-neighbors, logistic regression, SVM, decision trees and neural networks. Again, you cannot know in advance which would perform best.

Most of these models can use almost any kind of features. However, KNN and kernel-based SVM require your features to have special structure: representations of documents of one class should be close to each other in sense of Euclidean distance metric. This sometimes can be achieved by simple linear and/or logarithmic normalization (see above). More difficult cases require non-linear transformations, which in principle may be learned by neural networks. Learning of these transformations is something people call metric learning, and in general it is an problem which is not yet solved.

The most conventional distance metric is indeed Euclidean. However, other distance metrics are possible (e.g. manhattan distance), or different approaches, not based on vector representations of texts. For example, you can try to calculate Levenstein distance between texts, based on count of number of operations needed to transform one text to another. Or you can calculate "word mover distance" - the sum of distances of word pairs with closest embeddings.

For clustering, basic options are K-means and DBScan. Both these models require your feature space have this Euclidean property.

For anomaly detection you can use density estimations, which are produced by various probabilistic algorithms: classification (e.g. naive Bayes or neural networks), clustering (e.g. mixture of gaussian models), or other unsupervised methods (e.g. probabilistic PCA). For texts, you can exploit the sequential language structure, estimating probabilitiy of each word conditional on the previous words (using n-grams or convolutional/recurrent neural nets) - this is called language models, and it is usually more efficient than bag-of-word assumption of Naive Bayes, which ignores word order. Several language models (one for each class) may be combined into one classifier.

Whatever problem you solve, it is strongly recommended to have a good test set with the known "ground truth": which documents are close to each other, or belong to the same class, or are (un)usual. With this set, you can evaluate different approaches to feature engineering and modelling, and choose the best one.

If you don't have resourses or willingness to do multiple experiments, I would recommend to choose one of the following approaches to evaluate similarity between texts:

• word counts + idf normalization + L2 normalization (equivalent to the solution of @mcoav) + Euclidean distance
• mean word2vec embedding over all words in text (the embedding dictionary may be googled up and downloaded) + Euclidean distance

Based on one of these representations, you can build models for the other problems - e.g. KNN for classifications or k-means for clustering.

Answer 3

I would suggest tf-idf and cosine similarity.

You can still use tf-idf if you drop out stop-words. It is even probable that whether you include stop-words or not would not make such a difference: the Inverse Document Frequency measure automatically downweighs stop-words since they are very frequent and appear in most documents.

If your new document is entirely made of unknown terms, the cosine similarity will be 0 with every known document.

Answer 4

When I search on df-idf I find nothing.

tf-idf with cosine similarity is very accepted and common practice

Filtering out stop words does not break it. For common words idf gives them low weight anyway.

tf-idf is used by Lucene.

Don't get why you want to reinvent the wheel here.

Don't get why you think the sum of df idf is a similarity measure.

For classification do you have some predefined classes and sample documents to learn from? If so can use Naive Bayes. With tf-idf.

If you don't have predefined classes you can use k means clustering. With tf-idf.

It depend a lot on your knowledge of the corpus and classification objective. In like litigation support documents produced to you, you have and no knowledge of. In Enron they used names of raptors for a lot of the bad stuff and no way you would know that up front. k means lets the documents find their own clusters.

Stemming does not always yield better classification. If you later want to highlight the hits it makes that very complex and the stem will not be the length of the word.

Answer 5

While in English a word alone may be enough, it isn't the case in some other more complex languages.

A word has many meanings, and many different uses cases. One text can talk about the same things while using fews to none matching words.

You need to find the most important words in a text. Then you need to catch their possible synonyms.

For that, the following api can help. It is doable to create something similar with some dictionaries.

synonyms("complex")

function synonyms(me){
  var url = 'https://api.datamuse.com/words?ml=' + me;
  fetch(url).then(v => v.json()).then((function(v){
    syn = JSON.stringify(v)
    syn = JSON.parse(syn)
    for(var k in syn){
      document.body.innerHTML += "<span>"+syn[k].word+"</span> "
      }
    })
  )
}

From there comparing arrays will give much more accuracy, much less false positive.

Answer 6

Have you evaluated sent2vec or doc2vec approaches? You can play around with the vectors to see how close the sentences are. Just an idea. Not a verified solution to your question.

Answer 7

A sufficient solution, in a possibly similar task:

• Use of a binary bag-of-word (BOW) approach for the vector representation (frequent words aren't higher weighted than seldom words), rather than a real TF approach

• The embedding "word2vec" approach, is sensitive to sequence and distances effects. It might make - depending on your hyper-parameters - a difference between 'a hunter saw a fox' and 'a fox saw a jumping hunter' ... so you have to decide, if this means adding noise to your task - or, alternatively, to use it as an averaged vector only, over all of your text

• Extract high within-sentence-correlation words ( e.g., by using variables- mean-normalized- cosine-similaritities )

• Second Step: Use this list of high-correlated words, as a positive list, i.e. as new vocab for an new binary vectorizer

This isolated meaningful words for the 2nd step cosine comparisons - in my case, even for rather small amounts of training texts