IP Library Granted Patent US 11,783,812
Granted Patent B2
US 11,783,812 · App. 17/234,745 · Granted Oct 10, 2023

Dialogue act classification in group chats with DAG-LSTMs

Inventors: Ozan Irsoy (New York, NY); Rakesh Gosangi (Long Island City, NY); Haimin Zhang (Short Hills, NJ); Mu-Hsin Wei (Redmond, WA); Peter John Lund (New York, NY); Duccio Pappadopulo (New York, NY); Brendan Michael Fahy (New York, NY); Neophytos Nephytou (Glen Cove, NY); Camilo Ortiz Diaz (New York, NY)
G10L15/16G10L15/28
View Patent ↗
Loading inventors, assignments & file history…
Monitor This Case
Get email alerts when status or documents change.
Order Certified Copies
Most orders are placed with the USPTO same day — all within 24 business hours.
Order via The Patent Place →
Pre-filled with this patent's details
Quick Facts
Patent No.
US 11,783,812
App. No.
17/234,745
Granted
Oct 10, 2023
Kind
B2
Abstract

Systems and methods for classifying a dialogue act in a chat log are provided. Each word of the dialogue act is mapped to a word vector representation. An utterance vector representation of the dialogue act is computed based on the word vector representations. An additional utterance vector representation of the dialogue act is computed based on the utterance vector representation. The additional utterance vector representation is mapped to a classification of the dialogue act.

Claims (41)

1. A computer implemented method for classifying a dialogue act in a chat log, comprising:

mapping each word of the dialogue act to a word vector representation;

computing an utterance vector representation of the dialogue act based on the word vector representations using a bidirectional long short-term memory (LSTM) architecture;

computing an additional utterance vector representation of the dialogue act based on the utterance vector representation, the computing the additional utterance vector representation comprising:

applying a skip connection between the dialogue act of a participant and an immediately prior dialogue act of the same participant; and

computing the additional utterance vector representation based on an utterance vector representation of the skip connection to the immediately prior dialogue act of the same participant;

mapping the additional utterance vector representation, with a directed-acyclic-graph long short-term memory network (DAG-LSTM), to a classification of the dialogue act; and

outputting the classification of the dialogue act.

2. The computer implemented method of claim 1 , wherein computing an additional utterance vector representation of the dialogue act based on the utterance vector representation comprises:

computing the additional utterance vector representation based on utterance vector representations of all prior dialogue acts in the chat log.

3. The computer implemented method of claim 1 , wherein computing an additional utterance vector representation of the dialogue act based on the utterance vector representation comprises:

computing the additional utterance vector representation of the dialogue act using a modified tree long short-term memory (LSTM) based architecture.

4. The computer implemented method of claim 1 , wherein the chat log is a transcript of a conversation between a plurality of participants.

5. An apparatus comprising:

a processor; and

a memory to store computer program instructions for classifying a dialogue act in a chat log, the computer program instructions when executed on a neural network of the processor cause the processor to perform operations comprising:

mapping each word of the dialogue act to a word vector representation;

computing an utterance vector representation of the dialogue act based on the word vector representations using a bidirectional long short-term memory (LSTM) architecture;

computing an additional utterance vector representation of the dialogue act based on the utterance vector representation, the computing the additional utterance vector representation comprising:

applying a skip connection between the dialogue act of a participant and an immediately prior dialogue act of the same participant; and

computing the additional utterance vector representation based on an utterance vector representation of the skip connection to the immediately prior dialogue act of the same participant;

mapping the additional utterance vector representation, with a directed-acyclic-graph long short-term memory network (DAG-LSTM), to a classification of the dialogue act; and

outputting the classification of the dialogue act.

6. The apparatus of claim 5 , wherein computing an additional utterance vector representation of the dialogue act based on the utterance vector representation comprises:

computing the additional utterance vector representation based on utterance vector representations of all prior dialogue acts in the chat log.

7. The apparatus of claim 5 , wherein computing an additional utterance vector representation of the dialogue act based on the utterance vector representation comprises:

computing the additional utterance vector representation of the dialogue act using a modified tree long short-term memory (LSTM) based architecture.

8. The apparatus of claim 5 , wherein the chat log is a transcript of a conversation between a plurality of participants.

9. A non-transitory computer readable medium storing computer program instructions for classifying a dialogue act in a chat log, the computer program instructions when executed by a processor cause the processor to perform operations comprising:

mapping each word of the dialogue act to a word vector representation;

computing an utterance vector representation of the dialogue act based on the word vector representations using a bidirectional long short-term memory (LSTM) architecture;

computing an additional utterance vector representation of the dialogue act based on the utterance vector representation, the computing the additional utterance vector representation comprising:

applying a skip connection between the dialogue act of a participant and an immediately prior dialogue act of the same participant; and

computing the additional utterance vector representation based on an utterance vector representation of the skip connection to the immediately prior dialogue act of the same participant;

mapping the additional utterance vector representation, with a directed-acyclic-graph long short-term memory network (DAG-LSTM), to a classification of the dialogue act; and

outputting the classification of the dialogue act.

10. The non-transitory computer readable medium of claim 9 , wherein computing an additional utterance vector representation of the dialogue act based on the utterance vector representation comprises:

computing the additional utterance vector representation based on utterance vector representations of all prior dialogue acts in the chat log.

11. The non-transitory computer readable medium of claim 9 , wherein computing an additional utterance vector representation of the dialogue act based on the utterance vector representation comprises:

computing the additional utterance vector representation of the dialogue act using a modified tree long short-term memory (LSTM) based architecture.

12. The non-transitory computer readable medium of claim 9 , wherein the chat log is a transcript of a conversation between a plurality of participants.

Assignments (2)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Aug 9, 2024
From: IRSOY, OZAN; GOSANGI, RAKESH; WEI, MU-HSIN; LUND, PETER JOHN; PAPPADOPULO, DUCCIO; FAHY, BRENDAN MICHAEL; NEPHYTOU, NEOPHYTOS; DIAZ, CAMILO ORTIZ
To: BLOOMBERG FINANCE L.P.
Reel/Frame 068235/0115 →
SECURITY INTEREST Recorded Dec 22, 2022
From: BLOOMBERG FINANCE L.P.
To: BANK OF AMERICA, N.A., AS ADMINISTRATIVE AGENT
Reel/Frame 062190/0224 →
Continuity (2)
Provisional Application 63016601 · Apr 28, 2020
Related Publication 20210335346A1 · Oct 28, 2021