Sentiment Analysis on Speech

Sentiment Analysis means analysis of documents

and sentences to analyze emtotions within them.

Types of Learning

Supervised

Pre decided set of

data and results
Training of data is
done
Prediction is done
using Classification
techniques

Unsupervised

No predecided set of
results
As data is arrived, can
be included in current
dataset and results
are derived from them
Prediction is done by
analyzing techniques
which includes
probability and linear
algebra

Amazon Review Rating

Aim:

Predict user rating from the reviews using sentiment

polarity categorization

Steps

Tokenize
POS Tagging
Remove useless words

Words with less frequency

Words without any emotions

Negation of word using 2,3 gram technique

Calculate Sentiment Score
Feature Vector Formation
Classification

Sentiment Score

Here, i indicate rating of review

Occurrencei(t) indicate frequency of word t in ith
review

Feature Vector Formation

Feature vector is formed using words that are

useful for sentiments and their sentiment score
For e.g.,

there are 250 required words and correspondingly,

there are 100 negation phrase words
A vector is formed indicating whether word is
present for each review
At the end sentiment score is appended

TfIdf can be used for increased accuracy.

Latent Semantic Analysis

Aim:

Steps

To understand this technique and implement it

Create term-document Matrix
Rank lowerization of large Term-Document Matrix
using Singular Valued Decomposition
Calculate similarity usign cosine similarity
Values close to 1 indicate high similarity

Next Steps:

Sentiment analysis of reviews can be done using

words and their emotions.

Term Document Matrix

Term Document matrices are large sparse

matrices having large number of rows
compared to columns
Columns heading indicate title of documents
Row heading indicate terms
Columns indicate tfidf frequency of all the terms
present in a document
Rows indicate tfidf frequency of a term in all the
documents

Singular Valued Decomposition

SVD is a technique for rank lowerization of a

matrix
Used specifically for large sparse matrices
How decomoisition works?

For matrix A, its decomposition is,

A = U E VT

U and V are orthogonal matrices

E is a diagonal matrix
Vectors of U and V are called left singular vectors
and right singular vectors respectively

Steps for Decomposition

Vectors of U and V are eigenvectors of AAT and ATA

Diagonal values of E are singular values of AA T or
ATA

How to use this decomposition

Suppose A is (1100 x 110)

While calculating E, maximum n (let 20) are taken
Corresponding 20 columns from U and
corresponding 20 rows from V are chosen
Thus dimensions are U1100x20 E20x20 V20x110
Query vector is taken and for document, cosine
similarity with vectors of V and for terms, cosine
similarity with vectors of U is calculated

Approximation of Eigenvalues
Subspace Iteration

H is a hermitian matrix and eigenvalues of H

will be the approximate eigenvalues of matrix A

QR Factorization

Apply Latent Senamtic Analysis

Knowledge based Emotion Annotation

Direct and Indirect Affective words

Fear, cheerful are direct and killer, cry are indirect.
Indirect words are related to direct words using LSA
Similar words will occur together many times in
many documents
Similar documents will contain many terms in
similar counts
Check the number of emotion words used in a
sentence and perfrom sentiment analysis

References

Fang, X., and Zhan, J. Sentiment Analysis

using Product Review Data.
Mukherjee, S., and Bhattacharyya, P. Feature
Specific Sentiment Analysis for product
reviews.
Medhat, W., Hassan, A., and Korashy, H.
(2014). Sentiment Analysis Algorithms and
Applications: A Survey.
Berry, M.W. Large Scale Sparse Singular Value
Decompositions.
Saad, Y. Numerical Methods for Large
Eigenvalue Problems.
Canales, L., and Mart nez-Barco, P. Emotion