# US 2018/0121414 A1 · Emotional and personality analysis of characters and their interrelationships

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

- Number: US 2018/0121414 A1
- Document ID: US20180121414A1
- Status: Published application
- Kind: A1
- Application number: 15/341,682
- Filed: 2016-11-02
- Published: 2018-05-03
- Earliest claimed: 2016-11-02
- Assignees: International Business Machines Corporation
- Applicants: International Business Machines Corporation
- Inventors: Amit Anil Nanavati; Nitendra Rajput; Mayur Saxena
- Web page: https://patentgrep.com/patent/US20180121414A1

## CPC

- G06F 40/35: Discourse or dialogue representation
- G06F 16/3344: {using natural language analysis}
- G06F 16/9024: {Graphs; Linked lists (G06F16/9027 takes precedence)}
- G06T 11/26: Drawing of charts or graphs
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06T: IMAGE DATA PROCESSING OR GENERATION, IN GENERAL

## Abstract

One embodiment provides a method, including: utilizing a processor to execute computer code that performs the steps of: receiving, at an information handling device, a dataset comprising dialogue information between a plurality of characters in a narrative; analyzing, using the processor, the dataset to identify dialogue patterns between the plurality of characters; determining, based upon the identified dialogue patterns, at least one relationship profile between at least a subset of the plurality of characters; and generating, based upon the at least one relationship profile, at least one graph comprising a plurality of edges and a plurality of nodes, wherein each of the plurality of nodes corresponds to one of the plurality of characters and wherein each of the plurality of edges corresponds to a relationship between two of the plurality of characters. Other aspects are described and claimed.

## Claims

### Claim 1

A method, comprising:
utilizing a processor to execute computer code that performs the steps of:
receiving, at an information handling device, a dataset comprising dialogue information between a plurality of characters in a narrative;
analyzing, using the processor, the dataset to identify dialogue patterns between the plurality of characters;
determining, based upon the identified dialogue patterns, at least one relationship profile between at least a subset of the plurality of characters; and
generating, based upon the at least one relationship profile, at least one graph comprising a plurality of edges and a plurality of nodes, wherein each of the plurality of nodes corresponds to one of the plurality of characters and wherein each of the plurality of edges corresponds to a relationship between two of the plurality of characters and wherein each of the plurality of edges comprises at least one word-based relationship label positioned at a location near each edge of the plurality of edges, wherein the at least one word-based relationship label describes the relationship between the characters represented in the nodes connected by the edge at a predefined time point.

### Claim 2 (depends on 1)

The method of claim 1, wherein the dataset comprises a script.

### Claim 3 (depends on 1)

The method of claim 1, wherein each of the plurality of edges comprises a corresponding thickness, wherein the thickness identifies a dialogue density between two characters connected by the corresponding edge.

### Claim 4 (depends on 1)

The method of claim 1, wherein the at least one relationship profile is selected from the group consisting of: an emotional profile and a personality profile.

### Claim 5 (depends on 1)

The method of claim 1, wherein the at least one graph comprises at least two different groups, wherein each group comprises nodes and edges having characteristics, obtained from the relationship profile, similar to other nodes and edges of the same group.

### Claim 6 (depends on 1)

The method of claim 1, wherein the at least one graph comprises a plurality of graphs and wherein each of the plurality of graphs corresponds to a predefined time frame of the dataset.

### Claim 7 (depends on 6)

The method of claim 6, comprising analyzing the plurality of graphs to determine an evolution of a relationship profile between the subset of the plurality of characters over the predetermined time frame.

### Claim 8 (depends on 7)

The method of claim 7, comprising providing a visual representation of the evolution, wherein the visual representation comprises a mechanism for advancing through the evolution.

### Claim 9 (depends on 1)

The method of claim 1, comprising analyzing the at least one graph to identify at least one diagram for a predetermined subset of the plurality of characters.

### Claim 10 (depends on 9)

The method of claim 9, comprising generating at least one text template corresponding to the at least one diagram, wherein the at least one text template describes the relationship profile between the subset of the plurality of characters of the at least one diagram.

### Claim 11 (depends on 1)

The method of claim 1, comprising temporal segmentation of the dataset into a plurality of sections, wherein each of the plurality of sections is distinct from another of the plurality of sections based upon a predetermined factor.

### Claim 12

An apparatus, comprising:
at least one processor; and
a computer readable storage medium having computer readable program code embodied therewith and executable by the at least one processor, the computer readable program code comprising:
computer readable program code that receives a dataset comprising dialogue information between a plurality of characters in a narrative;
computer readable program code that analyzes, using the at least one processor, the data-set to identify dialogue patterns between the plurality of characters;
computer readable program code that determines, based on the identified dialogue patterns, at least one relationship profile between at least a subset of the plurality of characters; and
computer readable program code that generates, based upon the at least one relationship profile, at least one graph comprising a plurality of edges and a plurality of nodes, wherein each of the plurality of nodes corresponds to one of the plurality of characters and wherein each of the plurality of edges corresponds to a relationship between two of the plurality of characters and wherein each of the plurality of edges comprises at least one word-based relationship label positioned at a location near each edge of the plurality of edges, wherein the at least one word-based relationship label describes the relationship between the characters represented in the nodes connected by the edge at a predefined time point.

### Claim 13

A computer program product, comprising:
a computer readable storage medium having computer readable program code embodied therewith, the computer readable program code executable by a processor and comprising:
computer readable program code that receives a dataset comprising dialogue information between a plurality of characters in a narrative;
computer readable program code that analyzes, using the at least one processor, the data-set to identify dialogue patterns between the plurality of characters;
computer readable program code that determines, based on the identified dialogue patterns, at least one relationship profile between at least a subset of the plurality of characters; and
computer readable program code that generates, based upon the at least one relationship profile, at least one graph comprising a plurality of edges and a plurality of nodes, wherein each of the plurality of nodes corresponds to one of the plurality of characters and wherein each of the plurality of edges corresponds to a relationship between two of the plurality of characters and wherein each of the plurality of edges comprises at least one word-based relationship label positioned at a location near each edge of the plurality of edges, wherein the at least one word-based relationship label describes the relationship between the characters represented in the nodes connected by the edge at a predefined time point.

### Claim 14 (depends on 13)

The computer program product of claim 13, wherein the data set comprises a script.

### Claim 15 (depends on 13)

The computer program product of claim 13, wherein each of the plurality of edges comprises a corresponding thickness, wherein the thickness identifies a dialogue density between the two characters connected by the corresponding edge.

### Claim 16 (depends on 13)

The computer program product of claim 13, wherein the at least one relationship profile is selected from the group consisting of: an emotional profile and a personality profile.

### Claim 17 (depends on 13)

The computer program product of claim 13, wherein the at least on graph comprises at least two different groups, wherein each group comprises nodes and edges having characteristics, obtained from the relationship profile, similar to other nodes and edges of the same group.

### Claim 18 (depends on 13)

The computer program product of claim 13, wherein the at least one graph comprises a plurality of graphs and wherein each of the plurality of graphs corresponds to a predefined time frame of the dataset.

### Claim 19 (depends on 18)

The computer program product of claim 18, comprising analyzing the plurality of graphs to determine an evolution of a relationship profile between the subset of the plurality of characters over the predetermined time frame.

### Claim 20

A method, comprising:
utilizing at least one processor to execute computer code that per forms the steps of:
receiving, at an information handling device, a script comprising dialogue information between a plurality of characters in a narrative;
analyzing, using the processor, the script to identify dialogue patterns between the plurality of characters;
determining, based upon the identified dialogue patterns, at least one relationship profile between at least a subset of the plurality of characters, wherein the relationship profile is selected from the group consisting of an emotional profile and a personality profile; and
generating, based upon the at least one relationship profile, at least one graph comprising a plurality of edges and a plurality of nodes, wherein each of the plurality of nodes corresponds to one of the plurality of characters and wherein each of the plurality of edges corresponds to a relationship between two of the plurality of characters and wherein each of the plurality of edges comprises at least one word-based relationship label positioned at a location near each edge of the plurality of edges, wherein the at least one word-based relationship label describes the relationship between the characters represented in the nodes connected by the edge at a predefined time point;
wherein the at least one graph comprises at least two different groups, wherein each group comprises nodes and edges having characteristics, obtained from the relationship profile, similar to the other nodes and edges of the same group.
