IP Library Granted Patent US 12,293,155
Granted Patent B2
US 12,293,155 · App. 18/630,772 · Granted May 6, 2025

Out-of-domain data augmentation for natural language processing

Inventors: Elias Luqman Jalaluddin (Seattle, WA); Vishal Vishnoi (Redwood City, CA); Thanh Long Duong (Melbourne, AU); Mark Edward Johnson (Sydney, AU); Poorya Zaremoodi (Melbourne, AU); Gautam Singaraju (Dublin, CA); Ying Xu (Albion, AU); Vladislav Blinov (Melbourne, AU); Yu-Heng Hong (Carlton, AU)
Assignee: Oracle International Corporation
G06F40/289G06F40/30G06N3/08H04L51/02
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 12,293,155
App. No.
18/630,772
Granted
May 6, 2025
Kind
B2
Abstract

A method includes receiving a training set of utterances for training a machine-learning model to identify one or more intents for one or more utterances, and augmenting the training set of utterances with out-of-domain (OOD) examples. The augmenting includes: generating a data set of OOD examples, filtering out OOD examples from the data set of OOD examples, determining a difficulty value for each OOD example remaining within the filtered data set of the OOD examples, and generating augmented batches of utterances including utterances from the training set of utterances and utterances from the filtered data set of the OOD based on the difficulty value for each OOD. Thereafter, the machine-learning model is trained using the augmented batches of utterances in accordance with a curriculum training protocol.

Claims (61)

1. A computer-implemented method comprising:

receiving a training set of utterances comprising in-domain examples;

augmenting the training set of utterances with out-of-domain (OOD) examples to generate augmented batches of utterances for training a machine-learning model, wherein the augmenting comprises:

generating a data set of the OOD examples,

filtering out a plurality of OOD examples from the data set of the OOD examples, based on a determination that context of each of the plurality of OOD examples has a substantial similarity to context of one or more of the utterances of the training set of utterances, and

generating the augmented batches of utterances, each of the augmented batches of utterances comprising utterances from the training set of utterances and utterances from the filtered data set of the OOD examples; and

training the machine-learning model using the augmented batches of utterances, wherein the trained machine-learning model is configured to, based on one or more utterances provided as an input by a user, identify an intent from a set of predetermined intents,

wherein the substantial similarity between the context of OOD utterances of the data set of the OOD examples and the context of the utterances of the training set is determined based on a distance measure using a Multilingual Universal Sentence Encoder (MUSE) single embedding, and

wherein if min (d_i) is less than a predetermined threshold, then the context of an OOD utterance of the data set of the OOD examples and the context of an utterance of the training set of utterances is determined to be substantially similar,

where d_i is an Euclidean distance (v_i, u),

v_i is a vector representation of an utterance (x_i) of the training set of utterances and is muse (x_i) where i=1→n, and

u is a vector representation of the OOD utterance of the data set of the OOD examples and is muse (OOD utterance).

2. The computer-implemented method of claim 1 , further comprising:

determining a difficulty value for each OOD example remaining within the filtered data set of the OOD examples.

3. The computer-implemented method of claim 2 , wherein the training the machine-learning model further comprises:

inputting the augmented batches of utterances to the machine-learning model based on the difficulty values of the OOD examples within each batch of the augmented batches of utterances.

4. The method of claim 3 , wherein the difficulty value is derived from the d_i value such that easy OOD examples will have a high d_i value, while hard OOD examples will have lower d_i values that are closer to the predetermined threshold.

5. The method of claim 4 , wherein the augmented batches of utterances are generated based on at least one from among (i) a predetermined batch size, (ii) incorporation of a predetermined number of the in-domain examples from the training set of utterances within each augmented batch, (iii) incorporation of a predetermined number of the OOD examples of utterances from the filtered data set of the OOD examples within each augmented batch, (iv) the predetermined number of the in-domain examples and the predetermined number of the OOD examples of utterances are selected to maintain the predetermined batch size, (v) the OOD examples of utterances incorporated into each augmented batch have a substantially similar difficulty value, and (vi) each OOD example from the filtered data set of the OOD examples is incorporated into a single batch of the augmented batches of utterances.

6. The method of claim 1 , further comprising deploying the trained machine-learning model in a chatbot system.

7. The method of claim 1 , wherein the augmented batches of utterances are generated using a batch balancing scheme.

8. A system comprising:

one or more processors; and

a memory coupled to the one or more processors, the memory storing a plurality of instructions executable by the one or more processors, the plurality of instructions, when executed by the one or more processors, cause the one or more processors to perform operations including:

receiving a training set of utterances comprising in-domain examples;

augmenting the training set of utterances with out-of-domain (OOD) examples to generate augmented batches of utterances for training a machine-learning model, wherein the augmenting includes:

generating a data set of the OOD examples,

filtering out a plurality of OOD examples from the data set of the OOD examples, based on a determination that context of each of the plurality of OOD examples has a substantial similarity to context of one or more of the utterances of the training set of utterances, and

generating the augmented batches of utterances, each of the augmented batches of utterances comprising utterances from the training set of utterances and utterances from the filtered data set of the OOD examples; and

training the machine-learning model using the augmented batches of utterances, wherein the trained machine-learning model is configured to, based on one or more utterances provided as an input by a user, identify an intent from a set of predetermined intents,

wherein the substantial similarity between the context of OOD utterances of the data set of the OOD examples and the context of the utterances of the training set is determined based on a distance measure using a Multilingual Universal Sentence Encoder (MUSE) single embedding, and

wherein if min (d_i) is less than a predetermined threshold, then the context of an OOD utterance of the data set of the OOD examples and the context of an utterance of the training set of utterances is determined to be substantially similar,

where d_i is an Euclidean distance (v_i, u),

v_i is a vector representation of an utterance (x_i) of the training set of utterances and is muse (x_i) where i=1→n, and

u is a vector representation of the OOD utterance of the data set of the OOD examples and is muse (OOD utterance).

9. The system of claim 8 , wherein the operations further include:

determining a difficulty value for each OOD example remaining within the filtered data set of the OOD examples.

10. The system of claim 9 , wherein the training the machine-learning model further includes:

inputting the augmented batches of utterances to the machine-learning model based on the difficulty values of the OOD examples within each batch of the augmented batches of utterances.

11. The system of claim 10 , wherein the difficulty value is derived from the d_i value such that easy OOD examples will have a high d_i value, while hard OOD examples will have lower d_i values that are closer to the predetermined threshold.

12. The system of claim 11 , wherein the augmented batches of utterances are generated based on at least one from among (i) a predetermined batch size, (ii) incorporation of a predetermined number of the in-domain examples from the training set of utterances within each augmented batch, (iii) incorporation of a predetermined number of OOD examples of utterances from the filtered data set of the OOD examples within each augmented batch, (iv) the predetermined number of the in-domain examples and the predetermined number of OOD examples of utterances are selected to maintain the predetermined batch size, (v) OOD examples of utterances incorporated into each augmented batch have a substantially similar difficulty value, and (vi) each OOD example from the filtered data set of the OOD examples is incorporated into a single batch of the augmented batches of utterances.

13. The system of claim 8 , wherein the operations further include deploying the trained machine-learning model in a chatbot system.

14. The system of claim 8 , wherein the augmented batches of utterances are generated using a batch balancing scheme.

15. A non-transitory computer-readable memory storing a plurality of instructions executable by one or more processors, the plurality of instructions, when executed by the one or more processors, cause the one or more processors to perform operations including:

receiving a training set of utterances comprising in-domain examples;

augmenting the training set of utterances with out-of-domain (OOD) examples to generate augmented batches of utterances for training a machine-learning model, wherein the augmenting includes:

generating a data set of the OOD examples,

filtering out a plurality of OOD examples from the data set of the OOD examples, based on a determination that context of each of the plurality of OOD examples has a substantial similarity to context of one or more of the utterances of the training set of utterances, and

generating the augmented batches of utterances, each of the augmented batches of utterances comprising utterances from the training set of utterances and utterances from the filtered data set of the OOD examples; and

training the machine-learning model using the augmented batches of utterances, wherein the trained machine-learning model is configured to, based on one or more utterances provided as an input by a user, identify an intent from a set of predetermined intents,

wherein the substantial similarity between the context of OOD utterances of the data set of the OOD examples and the context of the utterances of the training set is determined based on a distance measure using a Multilingual Universal Sentence Encoder (MUSE) single embedding, and

wherein if min (d_i) is less than a predetermined threshold, then the context of an OOD utterance of the data set of the OOD examples and the context of an utterance of the training set of utterances is determined to be substantially similar,

where d_i is an Euclidean distance (v_i, u),

v_i is a vector representation of an utterance (x_i) of the training set of utterances and is muse (x_i) where i=1→n, and

u is a vector representation of the OOD utterance of the data set of the OOD examples and is muse (OOD utterance).

16. The non-transitory computer-readable memory of claim 15 , wherein the operations further include:

determining a difficulty value for each OOD example remaining within the filtered data set of the OOD examples.

17. The non-transitory computer-readable memory of claim 16 , wherein the training the machine-learning model further includes:

inputting the augmented batches of utterances to the machine-learning model based on the difficulty values of the OOD examples within each batch of the augmented batches of utterances.

18. The non-transitory computer-readable memory of claim 17 , wherein the difficulty value is derived from the d_i value such that easy OOD examples will have a high d_i value, while hard OOD examples will have lower d_i values that are closer to the predetermined threshold.

19. The non-transitory computer-readable memory of claim 18 , wherein the augmented batches of utterances are generated based on at least one from among (i) a predetermined batch size, (ii) incorporation of a predetermined number of the in-domain examples from the training set of utterances within each augmented batch, (iii) incorporation of a predetermined number of OOD examples of utterances from the filtered data set of the OOD examples within each augmented batch, (iv) the predetermined number of the in-domain examples and the predetermined number of OOD examples of utterances are selected to maintain the predetermined batch size, (v) OOD examples of utterances incorporated into each augmented batch have a substantially similar difficulty value, and (vi) each OOD example from the filtered data set of the OOD examples is incorporated into a single batch of the augmented batches of utterances.

20. The non-transitory computer-readable memory of claim 15 , wherein the operations further include deploying the trained machine-learning model in a chatbot system.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Apr 10, 2024
From: JALALUDDIN, ELIAS LUQMAN; VISHNOI, VISHAL; DUONG, THANH LONG; JOHNSON, MARK EDWARD; ZAREMOODI, POORYA; SINGARAJU, GAUTAM; XU, YING; BLINOV, VLADISLAV; HONG, YU-HENG
To: ORACLE INTERNATIONAL CORPORATION
Reel/Frame 067061/0768 →
Continuity (3)
Continuation 17452743 · Oct 28, 2021
Provisional Application 63119526 · Nov 30, 2020
Related Publication 20240256777A1 · Aug 1, 2024
References Cited (36)
US 10498898B2 · Mazza et al. · 2019 [cited by applicant]
US 10748526B2 · Yalla et al. · 2020 [cited by applicant]
US 10970487B2 · Sapugay et al. · 2021 [cited by applicant]
US 11216619B2 · Yu et al. · 2022 [cited by applicant]
US 11562297B2 · Goldszmidt et al. · 2023 [cited by applicant]
US 12153881B2 · Jalaluddin et al. · 2024 [cited by applicant]
US 20160350288A1 · Wick et al. · 2016 [cited by applicant]
US 20170069310A1 · Hakkani-Tur et al. · 2017 [cited by applicant]
US 20200227030A1 · Tan et al. · 2020 [cited by applicant]
US 20200257857A1 · Peper et al. · 2020 [cited by applicant]
US 20210150340A1 · Liu · 2021 [cited by examiner]
US 20210224485A1 · Sapugay · 2021 [cited by examiner]
US 20210374603A1 · Xia · 2021 [cited by examiner]
US 20220108220A1 · Qin · 2022 [cited by examiner]
Yinfei Yang, Daniel Cer, Amin Ahmad, Mandy Guo, Jax Law, Noah Constant, Gustavo Hernandez Abrego, Steve Yuan, Chris Tar, Yun-Hsuan Sung, Brian Strope, Ray Kurzweil. “Multilingual Universal Sentence Encoder for Semantic … [cited by examiner]
U.S. Appl. No. 17/452,742, Notice of Allowance, Mailed on Jul. 18, 2024, 11 pages. [cited by applicant]
U.S. Appl. No. 17/452,742, Final Office Action, Mailed on Mar. 26, 2024, 22 pages. [cited by applicant]
U.S. Appl. No. 17/452,742, Non-Final Office Action, Mailed on Dec. 27, 2023, 46 pages. [cited by applicant]
Abulaish et al., “A Text Data Augmentation Approach for Improving the Performance of CNN”, 2019 11th International Conference on Communication Systems & Networks (COMSNETS), Jan. 7, 2019, 6 pages. [cited by applicant]
Anaby-Tavor et al., “Do Not Have Enough Data? Deep Learning to the Rescue!”, Available Online at: arXiv:1911.03118v2, Cornell University Library, Nov. 27, 2019, 9 pages. [cited by applicant]
Bird et al., “Chatbot Interaction with Artificial Intelligence: Human Data Augmentation with TS and Language Transformer Ensemble for Text Classification”, Available Online at: arXiv:2010.05990v2, Cornell University Lib… [cited by applicant]
D'Ascoli et al., “Conditioned Text Generation with Transfer for Closed-Domain Dialogue System”, 2020, pp. 1-13. [cited by applicant]
Gao et al., “Paraphrase Augmented Task-Oriented Dialog Generation”, Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, Jul. 5-10, 2020, pp. 639-649. [cited by applicant]
Hou et al., “Sequence-to-Sequence Data Augmentation for Dialogue Language Understanding”, Proceedings of the 27th International Conference on Computational Linguistics, Aug. 20-26, 2018, pp. 1234-1245. [cited by applicant]
Jalalvand et al., “Automatic Data Expansion for Customer-Care Spoken Language Understanding”, Available Online at: arXiv:1810.00670v1, Cornell University Library, Sep. 27, 2018, 10 pages. [cited by applicant]
Jurafsky et al., “Regular Expressions, Text Normalization, Edit Distance”, Speech and Language Processing, Available Online at:: https://web.archive.org/web/20180219015352if_/http://web.stanford.edu:80/˜jurafsky/slp3/2.… [cited by applicant]
Mintz et al., “Distant Supervision for Relation Extraction Without Labeled Data”, Proceedings of the Joint Conference of the 47th Annual Meeting of the ACL and the 4th International Joint Conference on Natural Language … [cited by applicant]
Nugraha et al., “Typographic-Based Data Augmentation to Improve a Question Retrieval in Short Dialogue System”, International Seminar on Research of Information Technology and Intelligent Systems, 2019, pp. 44-49. [cited by applicant]
Parikh et al., “Automated Utterance Generation”, Proceedings of the AAAI Conference on Artificial Intelligence, vol. 34, No. 08, Apr. 2020, pp. 13344-13349. [cited by applicant]
International Application No. PCT/US2021/060953, International Preliminary Report on Patentability, Mailed on Jun. 15, 2023, 9 pages. [cited by applicant]
International Application No. PCT/US2021/060953, International Search Report and Written Opinion, Mailed on Mar. 15, 2022, 14 pages. [cited by applicant]
International Application No. PCT/US2021/060956, International Preliminary Report on Patentability, Mailed on Jun. 15, 2023, 6 pages. [cited by applicant]
International Application No. PCT/US2021/060956, International Search Report and the Written Opinion, Mailed on May 24, 2022, 9 pages. [cited by applicant]
Quan et al., “Effective Data Augmentation Approaches to End-to-End Task-Oriented Dialogue”, International Conference on Asian Language Processing, 2019, 6 pages. [cited by applicant]
Regina et al., “Text Data Augmentation: Towards Better Detection of Spear-Phishing Emails”, arXiv:2007.02033, Jul. 2020, pp. 1-22. [cited by applicant]
Yang et al., “Multilingual Universal Sentence Encoder for Semantic Retrieval”, Available online at: https://arxiv.org/pdf/1907.04307.pdf, Jul. 9, 2019, 6 pages. [cited by applicant]
Cited By (1)
US 12,608,562