The patent badge is an abbreviated version of the USPTO patent document. The patent badge does contain a link to the full patent document.

The patent badge is an abbreviated version of the USPTO patent document. The patent badge covers the following: Patent number, Date patent was issued, Date patent was filed, Title of the patent, Applicant, Inventor, Assignee, Attorney firm, Primary examiner, Assistant examiner, CPCs, and Abstract. The patent badge does contain a link to the full patent document (in Adobe Acrobat format, aka pdf). To download or print any patent click here.

Date of Patent:
Sep. 09, 2025

Filed:

Jan. 27, 2022
Applicant:

Accenture Global Solutions Limited, Dublin, IE;

Inventors:
Assignee:
Attorney:
Primary Examiner:
Int. Cl.
CPC ...
G10L 15/22 (2006.01); G06N 20/00 (2019.01); G10L 15/193 (2013.01); G06F 40/279 (2020.01); G10L 15/18 (2013.01);
U.S. Cl.
CPC ...
G10L 15/193 (2013.01); G06N 20/00 (2019.01); G10L 15/22 (2013.01); G06F 40/279 (2020.01); G10L 15/1822 (2013.01); G10L 2015/223 (2013.01);
Abstract

In some implementations, a system may receive non-deterministic finite state automata (NFSA) to represent a set of dialog flows associated with a human-machine interface. The system may generate a deterministic finite state automaton (DFSA) that includes a minimum set of states that represents all dialog flows included in the set of dialog flows represented in the NFSA and does not represent any dialog flows that are not included in the set of dialog flows represented in the NFSA. The system may traverse the DFSA to identify a set of K paths that have a highest total weight based on a weight assigned to each transition in the DFSA. The system may prune the DFSA to remove any states and any transitions that do not belong to the set of K paths. The system may generate an output related to one or more subsets of the set of K paths.


Find Patent Forward Citations

Loading…