# US 2022/0044111 A1 · Automatic flow generation from customer tickets using deep neural networks

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

- Number: US 2022/0044111 A1
- Document ID: US20220044111A1
- Status: Published application
- Kind: A1
- Application number: 16/987,811
- Filed: 2020-08-07
- Published: 2022-02-10
- Earliest claimed: 2020-08-07
- Assignees: Sap SE
- Applicants: Sap SE
- Inventors: Mithilesh Kumar Singh; Mohammad Saad Rashid; Warren Mark Fernandes
- Web page: https://patentgrep.com/patent/US20220044111A1

## CPC

- G06N 3/08: Learning methods
- G06F 16/9032: Query formulation
- G06F 16/90332: {Natural language query formulation or dialogue systems}
- G06F 16/90335: {Query processing}
- G06F 18/214: Generating training patterns; Bootstrap methods, e.g. bagging or boosting
- G06F 18/22: Matching criteria, e.g. proximity measures
- G06F 40/30: Semantic analysis
- G06N 3/044: Recurrent networks, e.g. Hopfield networks
- G06N 3/0442: characterised by memory or gating, e.g. long short-term memory [LSTM] or gated recurrent units [GRU]
- G06N 3/045: Combinations of networks
- G06N 3/09: Supervised learning
- G06Q 30/01: Customer relationship services
- G06Q 30/016: After-sales
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

In an example embodiment, actionable flows are found from customer tickets by autonomously reading and understanding customer queries using neural networks. Specifically, in an example embodiment, a deep neural network is trained to be utilized at two separate stages in a flow generation process. In one stage, the neural network is used to identify a list of repetitive queries from a repository of customer tickets. In another stage, the neural network is used to identify actionable flows from query steps obtained from the list of repetitive queries.

## Claims

### Claim 1

A system comprising:
at least one hardware processor; and
a non-transitory computer-readable medium storing instructions that, when executed by the at least one hardware processor, cause the at least one hardware processor to perform operations comprising:
obtaining, from a ticket repository, a plurality of tickets, at least one ticket including text pertaining to a request;
converting the text of the plurality of tickets into a standard format;
feeding the converted text to a deep neural network trained to identify one or more queries in the text of a ticket, embed the one or more queries into a set of coordinates in a multidimensional space, and group the queries into groupings of semantically similar queries by calculating a similarity score between pairs of queries using a distance metric between the embedded sets of coordinates corresponding to the queries in the pair and then grouping queries together that have similarity scores among them that exceed a predetermined threshold; and
for one or more groups of queries output by the deep neural network:
dividing one or more queries in the group into one or more steps by comparing the text of a query to an object dictionary storing business objects available to be acted upon or about in the system and dividing the text such that each step contains a single object from the object dictionary; and
passing the steps in one or more queries in the group to the deep neural network, thus producing groupings of semantically similar steps; and
for a given input ticket, producing a flow of steps comprising one or more steps, each step in the flow of steps corresponding to a different grouping of semantically similar steps representing a portion of text in the input ticket.

### Claim 2 (depends on 1)

The system of claim 1, wherein the operations further comprise:
identifying the top n groups of queries, wherein n is a predetermined value and the top n groups of queries are selected based on a number of queries in a group of queries; and
wherein the dividing and passing are performed only for the top n groups of queries.

### Claim 3 (depends on 1)

The system of claim 1, wherein the deep neural network includes a sentence encoder pre-trained with general tasks and then fine-tuned with a multilayer perceptron network (MLP).

### Claim 4 (depends on 1)

The system of claim 1, wherein the converting includes removing any text in a language other than one or more preselected languages.

### Claim 5 (depends on 1)

The system of claim 1, wherein the converting includes performing stemming and lemmatization.

### Claim 6 (depends on 1)

The system of claim 1, wherein the dividing includes identifying if two business objects mentioned in the text of the query are joined by one or more predefined conjunctions.

### Claim 7 (depends on 1)

The system of claim 1, wherein the distance metric is cosine similarity.

### Claim 8

A method comprising:
obtaining, from a ticket repository, a plurality of tickets, at least one ticket including text pertaining to a request;
converting the text of the plurality of tickets into a standard format;
feeding the converted text to a deep neural network trained to identify one or more queries in the text of a ticket, embed the one or more queries into a set of coordinates in a multidimensional space, and group the queries into groupings of semantically similar queries by calculating a similarity score between pairs of queries using a distance metric between the embedded sets of coordinates corresponding to the queries in the pair and then grouping queries together that have similarity scores among them that exceed a predetermined threshold; and
for one or more groups of queries output by the deep neural network:
dividing one or more queries in the group into one or more steps by comparing the text of a query to an object dictionary storing business objects available to be acted upon or about in the system and dividing the text such that each step contains a single object from the object dictionary; and
passing the steps in one or more queries in the group to the deep neural network, thus producing groupings of semantically similar steps; and for a given input ticket, producing a flow of steps comprising one or more steps, each step in the flow of steps corresponding to a different grouping of semantically similar steps representing a portion of text in the input ticket.

### Claim 9 (depends on 8)

The method of claim 8, further comprising:
identifying the top n groups of queries, wherein n is a predetermined value and the top n groups of queries are selected based on a number of queries in a group of queries; and
wherein the dividing and passing are performed only for the top n groups of queries.

### Claim 10 (depends on 8)

The method of claim 8, wherein the deep neural network includes a sentence encoder pre-trained with general tasks and then fine-tuned with a multilayer perceptron network (MLP).

### Claim 11 (depends on 8)

The method of claim 8, wherein the converting includes removing any text in a language other than one or more preselected languages.

### Claim 12 (depends on 8)

The method of claim 8, wherein the converting includes performing stemming and lemmatization.

### Claim 13 (depends on 8)

The method of claim 8, wherein the dividing includes identifying if two business objects mentioned in the text of the query are joined by one or more predefined conjunctions.

### Claim 14 (depends on 8)

The method of claim 8, wherein the distance metric is cosine similarity.

### Claim 15

A non-transitory machine-readable medium storing instructions which, when executed by one or more processors, cause the one or more processors to perform operations comprising:
obtaining, from a ticket repository, a plurality of tickets, at least one ticket including text pertaining to a request;
converting the text of the plurality of tickets into a standard format;
feeding the converted text to a deep neural network trained to identify one or more queries in the text of a ticket, embed the one or more queries into a set of coordinates in a multidimensional space, and group the queries into groupings of semantically similar queries by calculating a similarity score between pairs of queries using a distance metric between the embedded sets of coordinates corresponding to the queries in the pair and then grouping queries together that have similarity scores among them that exceed a predetermined threshold; and
for one or more groups of queries output by the deep neural network:
dividing one or more queries in the group into one or more steps by comparing the text of a query to an object dictionary storing business objects available to be acted upon or about in the system and dividing the text such that each step contains a single object from the object dictionary; and
passing the steps in one or more queries in the group to the deep neural network, thus producing groupings of semantically similar steps; and for a given input ticket, producing a flow of steps comprising one or more steps, each step in the flow of steps corresponding to a different grouping of semantically similar steps representing a portion of text in the input ticket.

### Claim 16 (depends on 15)

The non-transitory machine-readable medium of claim 15, wherein the operations further comprise:
identifying the top n groups of queries, wherein n is a predetermined value and the top n groups of queries are selected based on a number of queries in a group of queries; and
wherein the dividing and passing are performed only for the top n groups of queries.

### Claim 17 (depends on 15)

The non-transitory machine-readable medium of claim 15, wherein the deep neural network includes a sentence encoder pre-trained with general tasks and then fine-tuned with a multilayer perceptron network (MLP).

### Claim 18 (depends on 15)

The non-transitory machine-readable medium of claim 15, wherein the converting includes removing any text in a language other than one or more preselected languages.

### Claim 19 (depends on 15)

The non-transitory machine-readable medium of claim 15, wherein the converting includes performing stemming and lemmatization.

### Claim 20 (depends on 15)

The non-transitory machine-readable medium of claim 15, wherein the dividing includes identifying if two business objects mentioned in the text of the query are joined by one or more predefined conjunctions.
