This looks like a fairly clear binary classification problem, where you can simplify the problem to positive or negative, and then make the most entropy decisions or those that have not reached the threshold of certainty, using the probability of mass set to neutral,
Your biggest obstacle will be getting learning data for the stochastic machine learning method. You can easily do this with the easily accessible maximum entropy model, such as the Advanced Discriminant Modeling Toolkit or Mallet . The described functions simply have to be formatted to the inputs used by these models.
To get training data, you can do some kind of paid crowdsourcing, such as Amazon Mechanical Turk, or just do it yourself, maybe with the help of a friend. For this you need a lot of data. You can improve the predictive power of your model in the light of lack of data using approaches such as active learning, ensemble or amplification, but it is important to test them as best as possible against real data and choose the best results for practical use.
If you are looking for documents for this, you need to take a look at the term โmood analysisโ in Google Scholar. The Association for Computational Linguistics has many free and useful articles from conferences and journals that consider the problem from both a linguistic and algorithmic point of view. I also browse their archives. Good luck
Robert Elwell
source share