# US 2024/0256790 A1 · Structure self-aware model for discourse parsing on multi-party dialogues

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

- Number: US 2024/0256790 A1
- Document ID: US20240256790A1
- Status: Published application
- Kind: A1
- Application number: 18/635,699
- Filed: 2024-04-15
- Published: 2024-08-01
- Earliest claimed: 2021-02-22
- Assignees: Tencent America LLC
- Applicants: Tencent America LLC
- Inventors: Linfeng SONG
- Web page: https://patentgrep.com/patent/US20240256790A1

## CPC

- G06F 40/35: Discourse or dialogue representation
- G06F 17/16: Matrix or vector computation {, e.g. matrix-matrix or matrix-vector multiplication, matrix factorization (matrix transposition G06F7/78)}
- G06F 40/205: Parsing
- G06F 40/279: Recognition of textual entities
- G06N 3/0442: characterised by memory or gating, e.g. long short-term memory [LSTM] or gated recurrent units [GRU]
- G06N 3/049: Temporal neural networks, e.g. delay elements, oscillating neurons or pulsed inputs
- G06N 3/09: Supervised learning
- G06N 3/044: Recurrent networks, e.g. Hopfield networks
- G06N 3/045: Combinations of networks
- G06N 3/08: Learning methods
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A method, computer program, and computer system is provided for parsing multi-party dialogue. Dialogue data having one or more elementary discourse units is received. A local representation and a global representation are determined for each of the elementary discourse units based on performing a pairwise comparison on the elementary discourse units. Relationships between the elementary discourse units are identified based on the determined local and global representations. A contextual link is predicted between non-adjacent elementary discourse units based on the identified relationships.

## Claims

### Claim 1

A method of dialogue parsing, executable by a processor, comprising:
receiving dialogue data;
initializing nodes and edges of a structural self-aware graph neural network (SSA-GNN) based on the dialogue data;
determining a local representation, by multiple bidirectional gated recurrent units (GRUs) consuming utterances represented by the dialogue data and then concatenating a last hidden state in the multiple GRUs, and a global representation, by applying another bidirectional GRU on the local representations;
identifying relationships between the elementary discourse units based on structure-aware scaled dot-product attention of the SSA-GNN and a layer-wise classifier on edge hidden states; and
predicting a contextual link between non-adjacent elementary discourse units based on the identified relationships.

### Claim 2 (depends on 1)

The method of claim 1, wherein the determining of the local representations comprises:
processing each elementary discourse unit of the dialogue data through a first bidirectional gated recurrence unit; and
concatenating a hidden state generated by the first bidirectional gated recurrence unit in two directions for each elementary discourse unit.

### Claim 3 (depends on 2)

The method of claim 2, further comprising updating the hidden state based on structure-aware scaled dot-product attention.

### Claim 4 (depends on 2)

The method of claim 2, wherein determining the global representations comprises:
processing each local representation through a second bidirectional gated recurrence unit.

### Claim 5 (depends on 1)

The method of claim 1, wherein the relationships between elementary discourse units of the dialogue data are identified based on capturing implicit structural information corresponding to:
a node-specific vector for each elementary discourse unit, and
an edge-specific vector, of the at least one edge-specific vector generated in the neural network, for each pair of elementary discourse units.

### Claim 6 (depends on 1)

The method of claim 1, further comprising training the neural network based on a layer-wise relation classification on edge hidden states of each layer of the neural network for each pair of elementary discourse units.

### Claim 7 (depends on 6)

The method of claim 6, wherein the layer-wise relation classification is based on at least one interim edge-specific vector at each layer of the neural network.

### Claim 8 (depends on 1)

The method of claim 1,
wherein the dialogue data comprises one or more elementary discourse units,
wherein initializing the nodes and the edges of the SSA-GNN based on the dialogue data comprises initializing the nodes and the edges of the SSA-GNN based on the one or more elementary discourse units of the dialogue data, and
wherein determining the local representation, by the multiple GRUs consuming the utterances represented by the dialogue data and then concatenating the last hidden state in the multiple GRUs, and the global representation, by applying the other bidirectional GRU on the local representations comprises determining the local representation, by the multiple GRUs consuming each utterance represented by the one or more elementary discourse units of the dialogue data and then concatenating the last hidden state in the multiple GRUs, and the global representation, by applying the other bidirectional GRU on the local representations for each of the elementary discourse units.

### Claim 9 (depends on 8)

The method of claim 8, further comprising generating, in a neural network, at least one edge-specific vector representing an edge between a pair of elementary discourse units, the at least one edge-specific vector being generated based on the determined local and global representations, the at least one edge-specific vector capturing relation information for the pair of elementary discourse units.

### Claim 10 (depends on 9)

The method of claim 9, wherein identifying the relationships between the elementary discourse units based on the structure-aware scaled dot-product attention of the SSA-GNN and the layer-wise classifier on the edge hidden states comprises identifying the relationships between the elementary discourse units based on the at least one edge specific vector generated in the neural network and based on the structure-aware scaled dot-product attention of the SSA-GNN and the layer-wise classifier on the edge hidden states of each SSA GNN layer.

### Claim 11

A computer system for dialogue parsing, the computer system comprising:
one or more computer-readable non-transitory storage media configured to store computer program code; and
one or more computer processors configured to access said computer program code and operate as instructed by said computer program code, said computer program code including:
receiving code configured to cause the one or more computer processors to receive dialogue data;
initializing code configured to cause the one or more computer processors to initialize nodes and edges of a structural self-aware graph neural network (SSA-GNN) based on the dialogue data;
determining code configured to cause the one or more computer processors to determine a local representation, by multiple bidirectional gated recurrent units (GRUs) consuming utterances represented by the dialogue data and then concatenating a last hidden state in the multiple GRUs, and a global representation, by applying another bidirectional GRU on the local representations; identifying code configured to cause the one or more computer processors to identify relationships between the elementary discourse units based on structure-aware scaled dot-product attention of the SSA-GNN and a layer-wise classifier on edge hidden states; and
predicting code configured to cause the one or more computer processors to predict a contextual link between non-adjacent elementary discourse units based on the identified relationships.

### Claim 12 (depends on 11)

The computer system of claim 11, wherein the determining code comprises:
processing code configured to cause the one or more computer processors to process each elementary discourse unit of the dialogue data through a first bidirectional gated recurrence unit; and
concatenating code configured to cause the one or more computer processors to concatenate a hidden state generated by the first bidirectional gated recurrence unit in two directions for each elementary discourse unit.

### Claim 13 (depends on 12)

The computer system of claim 12, further comprising updating code configured to cause the one or more computer processors to update the hidden state based on structure-aware scaled dot-product attention.

### Claim 14 (depends on 12)

The computer system of claim 12, wherein the determining code further comprises:
second processing code configured to cause the one or more computer processors to process each local representation through a second bidirectional gated recurrence unit.

### Claim 15 (depends on 11)

The computer system of claim 11, wherein the relationships between the elementary discourse units of the dialogue data are identified based on capturing implicit structural information corresponding to:
a node-specific vector for each elementary discourse unit, and
an edge-specific vector, of the at least one edge-specific vector generated in the neural network, for each pair of elementary discourse units.

### Claim 16 (depends on 11)

The computer system of claim 11, further comprising training code configured to cause the one or more computer processors to train the neural network based on a layer-wise relation classification on edge hidden states of each layer of the neural network for each pair of elementary discourse units.

### Claim 17 (depends on 16)

The computer system of claim 16, wherein the layer-wise relation classification is based on at least one interim edge-specific vector at each layer of the neural network.

### Claim 18

A non-transitory computer readable medium having stored thereon a computer program for dialogue parsing, the computer program configured to cause one or more computer processors to:
receive dialogue data;
initialize nodes and edges of a structural self-aware graph neural network (SSA-GNN) based on the dialogue data;
determine a local representation, by multiple bidirectional gated recurrent units (GRUs) consuming utterances represented by the dialogue data and then concatenating a last hidden state in the multiple GRUs, and a global representation, by applying another bidirectional GRU on the local representations; identify relationships between the elementary discourse units based on structure-aware scaled dot-product attention of the SSA-GNN and a layer-wise classifier on edge hidden states; and
predict a contextual link between non-adjacent elementary discourse units based on the identified relationships.

### Claim 19 (depends on 15)

The computer readable medium of claim 15, wherein the computer program is further configured to cause one or more computer processors to:
process each elementary discourse unit through a first bidirectional gated recurrence unit; and
concatenate a hidden state generated by the first bidirectional gated recurrence unit in two directions for each elementary discourse unit.

### Claim 20 (depends on 16)

The computer readable medium of claim 16, wherein the computer program is further configured to cause one or more computer processors to update the hidden state based on structure-aware scaled dot-product attention.
