# US 2019/0379791 A1 · Classification of Transcripts by Sentiment

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2019/0379791 A1
- Document ID: US20190379791A1
- Status: Published application
- Kind: A1
- Application number: 16/547,798
- Filed: 2019-08-22
- Published: 2019-12-12
- Earliest claimed: 2017-02-09
- Assignees: Verint Systems Ltd.
- Applicants: Verint Systems Ltd.
- Inventors: Yaron Winter; Saar Carmi
- Web page: https://patentgrep.com/patent/US20190379791A1

## CPC

- H04M 3/5183: {Call or contact centers with computer-telephony arrangements}
- G06F 40/284: Lexical analysis, e.g. tokenisation or collocates
- G06F 40/30: Semantic analysis
- G06F 40/35: Discourse or dialogue representation
- G10L 15/063: {Training}
- G10L 15/197: Probabilistic grammars, e.g. word n-grams
- H04M 2201/40: using speech recognition
- H04M 2203/2061: Language aspects
- H04M: TELEPHONIC COMMUNICATION (circuits for controlling other apparatus via a telephone cable and not involving telephone switching apparatus G08)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G10L: SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING

## Abstract

A system and method for distinguishing the sentiment of utterances in a dialog is disclosed. The system utilizes a lexicon that is expanded from a seed using unsupervised machine learning. What results is a sentiment classifier that may be optimized for a variety of environments (e.g., conversation, chat, email, etc.), each of which may communicate sentiment differently.

## Claims

### Claim 1

A method for classifying a sentiment of a dialog transcript, the method comprising:
training a lexicon, wherein the training comprises:
splitting a training set of dialog transcripts into a negative set and a non-negative set;
identifying n-grams in the dialog transcripts;
computing, for each n-gram, a polarity score that corresponds to the likelihood of the n-gram having either a negative or a non-negative sentiment, wherein the computing the polarity score for a particular n-gram comprises comparing the frequency of the particular n-gram in the negative set to the frequency of the particular n-gram in the non-negative set;
identifying prominent n-grams based on each n-gram's polarity score;
expanding the lexicon by adding the prominent n-grams, which are not already in the lexicon, to the lexicon; and
repeating the splitting, computing, identifying, and expanding for a plurality of iterations to obtain a trained lexicon, wherein the splitting for each iteration uses the expanded lexicon from the previous iteration; and
classifying the sentiment of the dialog transcript using the trained lexicon.

### Claim 2 (depends on 1)

The method of claim 1, wherein the classifying comprises:
receiving a dialog transcript;
selecting an utterance in the dialog transcript;
identifying n-grams in the utterance;
obtaining a polarity score for each n-gram using the trained lexicon;
determining the utterance is negative or non-negative based, at least, on the polarity scores for each n-gram;
repeating the selecting, identifying, computing, and determining for other utterances in the dialog transcript; and
distinguishing the sentiment of the dialog transcript as negative or non-negative based on the negative or non-negative utterances determined in the dialog transcript.

### Claim 3 (depends on 2)

The method according to claim 2, wherein the identifying n-grams in the utterance comprises:
selecting each word in the utterance as a uni-gram;
selecting each group of two sequential words in the utterance as a bi-gram; and
selecting each group of three sequential words in the utterance as a tri-gram.

### Claim 4 (depends on 3)

The method according to claim 3, wherein determining the utterance is negative or non-negative based, at least, on the polarity scores for each n-gram, comprises:
computing a uni-gram sentiment score as the sum of the polarity scores of each uni-gram in the utterance;
computing a bi-gram sentiment score as the sum of the polarity scores of each bi-gram in the utterance; and
computing a tri-gram sentiment score as the sum of the polarity scores of each tri-gram in the utterance.

### Claim 5 (depends on 4)

The method according to claim 4, wherein the determining the utterance is negative or non-negative based, at least, on the polarity scores for each n-gram, further comprises comparing the uni-gram, bi-gram, and tri-gram sentiment scores.

### Claim 6 (depends on 5)

The method according to claim 5, wherein the determining the utterance is negative or non-negative based, at least, on the polarity scores for each n-gram, further comprises based on the comparison applying a heuristic to determine that the utterance is negative or non-negative.

### Claim 7 (depends on 6)

The method according to claim 6, wherein the applying a heuristic is:
searching for a prominent word indicating sentiment, or
determining the sentiment of other utterances in the dialog transcript.

### Claim 8 (depends on 2)

The method according to claim 2, wherein the distinguishing the sentiment of the dialog transcript as negative or non-negative based on the negative or non-negative utterances determined in the dialog transcript, comprises comparing the number of negative or non-negative utterances in the dialog transcript to a threshold.

### Claim 9 (depends on 2)

The method according to claim 2, wherein the distinguishing the sentiment of the dialog transcript as negative or non-negative based on the negative or non-negative utterances determined in the dialog transcript, comprises determining the positions negative utterances in the dialog transcript.

### Claim 10 (depends on 1)

The method according to claim 1, wherein the dialog transcripts in the training set are all of a particular type, wherein the particular type is a telephone call, a text chat, an email, or a website post.

### Claim 11 (depends on 10)

The method according to claim 10, wherein splitting the training set is based on a seed, and further comprising selecting the seed based on the particular type.

### Claim 12 (depends on 11)

The method according to claim 11, wherein the seed comprises words, phrases, punctuations, or dialog characteristics that, for the particular type, are indicative of a negative or non-negative sentiment.

### Claim 13 (depends on 1)

The method according to claim 1, wherein the identifying n-grams in the dialog transcripts comprises:
for each dialog transcript:
selecting each word in the dialog transcript as a uni-gram;
selecting each group of two sequential words in the dialog transcript as a bi-gram;
selecting each group of three sequential words in the dialog transcript as a tri-gram; and
identifying n-grams in the dialog transcript as the uni-grams, bi-grams, and tri-grams.

### Claim 14 (depends on 1)

The method according to claim 1, wherein:
the polarity score has a sign that corresponds to the sentiment of the n-gram, and wherein:
the polarity score has an amplitude that corresponds to the likelihood that the n-gram is indicative of the sentiment.

### Claim 15 (depends on 14)

The method according to claim 14, wherein the identifying prominent n-grams based on each n-gram's polarity score, comprises:
comparing the amplitude each n-gram to a threshold, and
identifying prominent n-grams as n-grams having a polarity-score amplitude larger than the threshold.

### Claim 16 (depends on 1)

The method according to claim 1, wherein repeating the splitting, computing, identifying, and expanding for a plurality of iterations to obtain a trained lexicon, comprises repeating for three iterations or until an iteration results in no expansion of the lexicon.

### Claim 17

A call center transcription system comprising:
a call recorder recording conversations between agents and customers in a call center;
a transcriber receiving the recorded conversations and creating dialog transcripts corresponding to the conversations; and
a sentiment classifier comprising a processor and a memory, wherein the processor executes software stored in the memory to:
receive a dialog transcript from the transcriber;
retrieve a trained lexicon from the memory, wherein the trained lexicon is the product of unsupervised machine learning, wherein the unsupervised machine learning comprises:
analyzing, using a seed, a set of unannotated dialog transcripts to identify negative words and phrases;
adding identified negative words and phrases to the seed to produce an expanded lexicon;
analyzing the set of unannotated dialog transcripts using the expanded lexicon to find new negative words and phrases;
adding the new negative words and phrases to the expanded lexicon to produce a further expanded lexicon; and
repeating the analyzing and adding to produce the machine-generated lexicon that is larger than the seed.

### Claim 18 (depends on 17)

The call center transcription system according to claim 17, wherein the processor further executes software stored in the memory to:
select an utterance from the dialog transcript;
compute, using the trained lexicon, polarities for each uni-gram, bi-gram, and tri-gram in the utterance;
calculate a uni-gram sentiment score, a bi-gram sentiment score, and a tri-gram sentiment score that are based on the sum of the polarity scores for each uni-gram, bi-gram, and tri-gram respectively;
determine that the utterance is negative or non-negative based on the uni-gram, bi-gram and tri-gram sentiment scores;
repeat selecting, computing, calculating, and determining for other utterances in the dialog transcript;
tag the dialog transcript as negative or non-negative based on the determined negative utterances; and
store the tagged dialog transcripts to the memory.

### Claim 19 (depends on 18)

The call center transcription system according to claim 18, wherein an utterance is determined negative when the uni-gram, bi-gram, and tri-gram sentiment scores are all negative.

### Claim 20

A non-transitory computer readable medium containing program instructions that upon execution by a computer processor cause the processor to:
split a training set of dialog transcripts into a negative set and a non-negative set;
identify n-grams in the dialog transcripts;
compute, for each n-gram, a polarity score that corresponds to the likelihood of the n-gram having either a negative or a non-negative sentiment, wherein the computing the polarity score for a particular n-gram comprises comparing the frequency of the particular n-gram in the negative set to the frequency of the particular n-gram in the non-negative set;
identify prominent n-grams based on each n-gram's polarity score;
expand the lexicon by adding the prominent n-grams, which are not already in the lexicon, to the lexicon; and
repeat the splitting, computing, identifying, and expanding for a plurality of iterations to obtain a trained lexicon, wherein the splitting for each iteration uses the expanded lexicon from the previous iteration.
