IP Library › Granted Patent US 12,475,881
Granted Patent B2
US 12,475,881 · App. 17/805,191 · Granted Nov 18, 2025

Method of generating conversation information using examplar-based generation model and apparatus for the same

Inventors: Enkhbayar Erdenee (Seoul, KR); Beom Su Kim (Seoul, KR); Seok Jun Seo (Seoul, KR); Sang Il Ahn (Cheongju-si, KR); Bu Ru Chang (Seoul, KR); Seung Ju Han (Seoul, KR)
Assignee: Hyperconnect LLC
G10L15/063G10L15/16
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,475,881
App. No.
17/805,191
Granted
Nov 18, 2025
Kind
B2
Abstract

A training method of a conversation model according to various example embodiments of the present disclosure may include identifying a first context, identifying a first response set corresponding to the first context based on a first model, identifying a response subset selected from the first response set based on a gold response corresponding to the first context and training a second model based on the first context information and the response subset.

Claims (30)

1 . A method of training a conversation model in an electronic apparatus, the method comprising:

identifying a first context;

identifying a first response set corresponding to the first context based on a first model;

excluding, from the first response set, at least one response that exists outside a first range in an embedding space from a gold response corresponding to the first context, wherein the first range is determined based on a k-means algorithm or a k-Nearest Neighbor (kNN) algorithm;

excluding, from the first response set, at least another response that is included in a second range in the embedding space from the gold response, wherein the second range indicates a Jaccard Filter Boundary in the embedding space;

identifying a response subset including a plurality of responses selected from the first response set based on the gold response;

calculate relevance scores, each relevance score indicating a degree of relevance to the gold response for a response in the plurality of responses; and

training a second model based on the first context, the response subset, and the relevance scores.

2 . The method of claim 1 , wherein the second model identifies a second context for a conversation obtained from a user, and provides a gold response for the second context based on the second context.

3 . The method of claim 1 , wherein the first context includes one or more conversations obtained from a user.

4 . The method of claim 1 , wherein the second model is trained by performing a backpropagation operation using a loss function calculated based on a set of weights, wherein each weight of the set of weights is calculated by normalizing the relevance scores for each response.

5 . An electronic apparatus for performing a method of generating a conversation, the electronic apparatus comprising:

a memory in which at least one program is stored; and

a processor, wherein the processor is configured to identify a first context;

identify a first response set corresponding to the first context based on a first model;

identify a gold response corresponding to the first context based on a second model;

exclude, from the first response set, at least one response that exists outside a first range in an embedding space from the gold response, wherein the first range is determined based on a k-means algorithm or a k-Nearest Neighbor (kNN) algorithm;

exclude, from the first response set, at least another response that is included in a second range in the embedding space from the gold response, wherein the second range indicates a Jaccard Filter Boundary in the embedding space;

identify a response subset including a plurality of responses selected from the first response set based on the gold response;

calculate relevance scores, each relevance score indicating a degree of relevance to the gold response for a response in the plurality of responses; and

train the second model based on the first context, the response subset, and the relevance scores.

6 . A non-transitory computer-readable recording medium, comprising a medium configured to store computer readable instructions, wherein, when the computer readable instructions are executed by a processor, the processor performs operations comprising:

identifying a first context;

identifying a first response set corresponding to the first context based on a first model;

identifying a gold response corresponding to the first context based on a second model;

excluding, from the first response set, at least one response that exists outside a first range in an embedding space from the gold response, wherein the first range is determined based on a k-means algorithm or a k-Nearest Neighbor (kNN) algorithm;

excluding, from the first response set, at least another response that is included in a second range in the embedding space from the gold response, wherein the second range indicates a Jaccard Filter Boundary in the embedding space;

identifying a response subset including a plurality of responses selected from the first response set based on the gold response;

calculating relevance scores, each relevance score indicating a degree of relevance to the gold response for a response in the plurality of responses; and

training the second model based on the first context, the response subset, and the relevance scores.

Assignments (1)
ASSIGNMENT OF ASSIGNOR'S INTEREST Recorded Nov 1, 2023
From: ERDENEE, ENKHBAYAR; KIM, BEOM SU; SEO, SEOK JUN; AHN, SANG IL; CHANG, BU RU; HAN, SEUNG JU
To: HYPERCONNECT INC.
Reel/Frame 065424/0983 →
Priority Claims (2)
KR 10-2021-0112545 · Aug 25, 2021 · national
KR 10-2022-0010973 · Jan 25, 2022 · national
Continuity (1)
Related Publication 20230077528A1 · Mar 16, 2023
References Cited (177)
US 6571234B1 · Knight et al. · 2003 [cited by applicant]
US 6731307B1 · Strubbe et al. · 2004 [cited by applicant]
US 6735615B1 · Iwayama et al. · 2004 [cited by applicant]
US 6804647B1 · Heck et al. · 2004 [cited by applicant]
US 6804675B1 · Knight et al. · 2004 [cited by applicant]
US 7277855B1 · Acker et al. · 2007 [cited by applicant]
US 7685237B1 · Weaver et al. · 2010 [cited by applicant]
US 9311823B2 · Byron · 2016 [cited by examiner]
US 9443033B2 · Lambert · 2016 [cited by examiner]
US 10140977B1 · Raux · 2018 [cited by examiner]
US 10176819B2 · Sun et al. · 2019 [cited by applicant]
US 10853580B1 · Amrite · 2020 [cited by examiner]
US 10930263B1 · Mahyar · 2021 [cited by applicant]
US 10963792B1 · Kim · 2021 [cited by examiner]
US 11081104B1 · Su · 2021 [cited by examiner]
US 11418461B1 · Elfardy · 2022 [cited by examiner]
US 11615777B2 · Ahn et al. · 2023 [cited by applicant]
US 11645547B2 · Tian et al. · 2023 [cited by applicant]
US 12118977B2 · Ahn et al. · 2024 [cited by applicant]
US 20020120450A1 · Junqua et al. · 2002 [cited by applicant]
US 20040111271A1 · Tischer · 2004 [cited by applicant]
US 20050144247A1 · Christensen et al. · 2005 [cited by applicant]
US 20060149558A1 · Kahn et al. · 2006 [cited by applicant]
US 20060210034A1 · Beadle et al. · 2006 [cited by applicant]
US 20060235932A1 · Celi et al. · 2006 [cited by applicant]
US 20070005754A1 · Horvitz et al. · 2007 [cited by applicant]
US 20070071206A1 · Gainsboro et al. · 2007 [cited by applicant]
US 20080082333A1 · Nurminen et al. · 2008 [cited by applicant]
US 20080147385A1 · Nurminen et al. · 2008 [cited by applicant]
US 20080183473A1 · Nagano et al. · 2008 [cited by applicant]
US 20080207242A1 · Ekberg · 2008 [cited by applicant]
US 20080235024A1 · Goldberg et al. · 2008 [cited by applicant]
US 20090037179A1 · Liu et al. · 2009 [cited by applicant]
US 20090171657A1 · Tian et al. · 2009 [cited by applicant]
US 20090177473A1 · Aaron et al. · 2009 [cited by applicant]
US 20090204510A1 · Hwang · 2009 [cited by applicant]
US 20100161327A1 · Chandra et al. · 2010 [cited by applicant]
US 20110251468A1 · Osorio · 2011 [cited by applicant]
US 20120030157A1 · Tsuchida · 2012 [cited by examiner]
US 20120189272A1 · Kunigita et al. · 2012 [cited by applicant]
US 20120226500A1 · Balasubramanian et al. · 2012 [cited by applicant]
US 20130332167A1 · Kilgore · 2013 [cited by applicant]
US 20140195227A1 · Rudzicz et al. · 2014 [cited by applicant]
US 20140303958A1 · Lee et al. · 2014 [cited by applicant]
US 20150379654A1 · Deshmukh et al. · 2015 [cited by applicant]
US 20160005403A1 · Agiomyrgiannakis et al. · 2016 [cited by applicant]
US 20160036962A1 · Rand · 2016 [cited by applicant]
US 20160098992A1 · Renard et al. · 2016 [cited by applicant]
US 20160104474A1 · Bunn et al. · 2016 [cited by applicant]
US 20160203827A1 · Leff et al. · 2016 [cited by applicant]
US 20160379643A1 · Ito et al. · 2016 [cited by applicant]
US 20170171509A1 · Huang et al. · 2017 [cited by applicant]
US 20170171599A1 · Peng · 2017 [cited by applicant]
US 20170249953A1 · Yassa et al. · 2017 [cited by applicant]
US 20170301340A1 · Yassa et al. · 2017 [cited by applicant]
US 20180048865A1 · Taylor et al. · 2018 [cited by applicant]
US 20180052818A1 · Bethard · 2018 [cited by examiner]
US 20180063556A1 · Kalmanson et al. · 2018 [cited by applicant]
US 20180090126A1 · Peterson et al. · 2018 [cited by applicant]
US 20180130471A1 · Trufinescu et al. · 2018 [cited by applicant]
US 20180197106A1 · Fujitani · 2018 [cited by examiner]
US 20180204576A1 · Dhoot et al. · 2018 [cited by applicant]
US 20180316964A1 · Dillon et al. · 2018 [cited by applicant]
US 20190013017A1 · Kang et al. · 2019 [cited by applicant]
US 20190044985A1 · Jo et al. · 2019 [cited by applicant]
US 20190079941A1 · Sarkar et al. · 2019 [cited by applicant]
US 20190108242A1 · Liu et al. · 2019 [cited by applicant]
US 20190155905A1 · Bachrach · 2019 [cited by examiner]
US 20190221225A1 · Bricklin et al. · 2019 [cited by applicant]
US 20190251952A1 · Arik et al. · 2019 [cited by applicant]
US 20190334842A1 · Sato · 2019 [cited by applicant]
US 20190354594A1 · Foster et al. · 2019 [cited by applicant]
US 20200013422A1 · Matkin · 2020 [cited by applicant]
US 20200082807A1 · Kim et al. · 2020 [cited by applicant]
US 20200193085A1 · Tanaka · 2020 [cited by applicant]
US 20200197810A1 · Kung et al. · 2020 [cited by applicant]
US 20200265829A1 · Liu et al. · 2020 [cited by applicant]
US 20200279017A1 · Norton · 2020 [cited by examiner]
US 20200334578A1 · Ikeda · 2020 [cited by examiner]
US 20200372898A1 · Olabiyi et al. · 2020 [cited by applicant]
US 20200395008A1 · Cohen et al. · 2020 [cited by applicant]
US 20210012199A1 · Zhang et al. · 2021 [cited by applicant]
US 20210020161A1 · Gao · 2021 [cited by applicant]
US 20210043187A1 · Ahn et al. · 2021 [cited by applicant]
US 20210050002A1 · Bastide · 2021 [cited by examiner]
US 20210150284A1 · Chiang et al. · 2021 [cited by applicant]
US 20210182489A1 · Barkan et al. · 2021 [cited by applicant]
US 20210183369A1 · Yamada · 2021 [cited by examiner]
US 20210217404A1 · Jia et al. · 2021 [cited by applicant]
US 20220083744A1 · Li · 2022 [cited by examiner]
US 20220092651A1 · Sureshkumar · 2022 [cited by examiner]
US 20220199068A1 · Ahn et al. · 2022 [cited by applicant]
US 20220246136A1 · Yang et al. · 2022 [cited by applicant]
US 20220269934A1 · Song · 2022 [cited by examiner]
US 20220277141A1 · Nijkamp · 2022 [cited by examiner]
US 20220328038A1 · Otani · 2022 [cited by examiner]
US 20220358918A1 · Kim · 2022 [cited by examiner]
US 20220382978A1 · Wagner · 2022 [cited by examiner]
US 20230080930A1 · Seo et al. · 2023 [cited by applicant]
US 20230154453A1 · Erdenee et al. · 2023 [cited by applicant]
US 20230195600A1 · Clement et al. · 2023 [cited by applicant]
US 20230214697A1 · Kim et al. · 2023 [cited by applicant]
US 20230215418A1 · Ahn et al. · 2023 [cited by applicant]
US 20230229864A1 · Kim et al. · 2023 [cited by applicant]
US 20230229964A1 · Kim et al. · 2023 [cited by applicant]
US 20240078393A1 · Song · 2024 [cited by examiner]
US 20240131439A1 · Kim et al. · 2024 [cited by applicant]
US 20240144095A1 · Farrar et al. · 2024 [cited by applicant]
US 20240152458A1 · Ji · 2024 [cited by applicant]
US 20240226755A9 · Kim et al. · 2024 [cited by applicant]
CA 3216020A1 · 2024 [cited by examiner]
CN 110633357A · 2019 [cited by applicant]
CN 111708871A · 2020 [cited by applicant]
CN 112541060A · 2021 [cited by applicant]
CN 117411109A · 2024 [cited by applicant]
JP H0772900B2 · 1995 [cited by applicant]
JP 2003202885A · 2003 [cited by applicant]
JP 2018004977A · 2018 [cited by applicant]
JP 2019179257A · 2019 [cited by applicant]
JP 2020160319A · 2020 [cited by applicant]
KR 20000036463A · 2000 [cited by applicant]
KR 20010091677A · 2001 [cited by applicant]
KR 20090028151A · 2009 [cited by applicant]
KR 101632435B1 · 2016 [cited by applicant]
KR 20170107683A · 2017 [cited by applicant]
KR 20180059322A · 2018 [cited by applicant]
KR 20190008137A · 2019 [cited by applicant]
KR 20190085882A · 2019 [cited by applicant]
KR 102170563B1 · 2020 [cited by applicant]
KR 102173553B1 · 2020 [cited by applicant]
WO 2018074516A1 · 2018 [cited by applicant]
WO 2019139430A1 · 2019 [cited by applicant]
WO 2019222591A1 · 2019 [cited by applicant]
Yang et al., “A Hybrid Retrieval-Generation Neural Conversation Model”, arXiv:1904.09068v1 [cs.IR], Apr. 19, 2019, 11 pgs. [cited by applicant]
Extended European Search Report for Application No. 20189677.6, Dated Sep. 28, 2020, 9 Pgs. [cited by applicant]
Extended European Search Report for Application No. 22189981.8, mailed Jan. 17, 2023, 9 pages. [cited by applicant]
Extended European Search Report for Application No. 22207004.7 dated Mar. 9, 2023, 9 pgs. [cited by applicant]
Japanese Office Action for Application No. 2020-134046, Dated Sep. 10, 2021, 8 Pgs. [cited by applicant]
Korean Office Action for Application No. 10-2019-0097398, Dated Aug. 18, 2021, 15 Pgs. [cited by applicant]
Korean Office Action for Application No. 10-2019-0097398, Dated Jun. 25, 2020, 11 Pgs. [cited by applicant]
Office Action for Japanese Patent Application No. 2021-083959 dated Sep. 28, 2022, 2 pages. [cited by applicant]
Choi et al., “Attentron: Few-Shot Text-to-Speech Utilizing Attention-Based Variable-Length Embedding”, ArXiv abs/2005.08484, Aug. 12, 2020 (Version 2), 5 pages. [cited by applicant]
Choi et al., “Attentron: Few-Shot Text-to-Speech Utilizing Attention-Based Variable-Length Embedding”, ArXiv abs/2005.08484, May 18, 2020 (Version 1), 5 pages. [cited by applicant]
Cooper et al., “Zero-Shot Multi-Speaker Text-to-Speech with State-of-the-Art Neural Speaker Embeddings”, arXiv:1910.10838v2, Feb. 4, 2020, 5pgs. [cited by applicant]
Fu et al., “Stylistic Retrieval-based Dialogue System with Unparallel Training Data”, arXiv:2109.05477, Sep. 12, 2021, 9 pages. [cited by applicant]
Han et al., “Meet Your Favorite Character: Open-domain Chatbot Mimicking Fictional Characters with only a Few Utterances”, arXiv:2204.10825, Apr. 22, 2022, 19 pages. [cited by applicant]
Hsu et al., “Hierarchical generative modeling for controllable speech synthesis”, arXiv preprint arXiv:1810.07217v2, Dec. 27, 2018, 27 pgs. [cited by applicant]
Kim et al., “Distilling the Knowledge of Large-scale Generative Models into Retrieval Models for Efficient Open-domain Conversation”, Findings of the Association for Computational Linguistics, EMNLP 2021, Nov. 7-11, 202… [cited by applicant]
Kim et al., “Sequence-Level Knowledge Distillation”, Proceedings of the 2016 Conference on Empirical Methods in Natural Language Processing, Austin, TX, Nov. 1-5, 2016, pp. 1317-1327. [cited by applicant]
Lee et al., “Robust and Fine-Grained Prosody Control of End-to-End Speech Synthesis”, arXiv:1811.02122v2, Feb. 18, 2019, 5pgs. [cited by applicant]
Zhang et al., “Dialogue Distillation: Open-Domain Dialogue Augmentation Using Unpaired Data”, Proceedings of the 2020 Conference on Empirical Methods in Natural Language Processing, Nov. 16-20, 2020, pp. 3449-3460. [cited by applicant]
Adiwardana et al., “Towards a Human-like Open-Domain Chatbot”, arXiv:2001.09977v3 [cs.CL], Feb. 27, 2020, 38 pgs. [cited by applicant]
Brown et al., “Language Models are Few-Shot Learners”, arXiv:2005.14165v4 [cs.CL], Jul. 22, 2020, 75 pgs. [cited by applicant]
Cai et al., “Retrieval-guided Dialogue Response Generation via a Matching-to-Generation Framework”, Proceedings of the 2019 Conference on Empirical Methods in Natural Language Processing and the 9th International Joint … [cited by applicant]
Cai et al., “Skeleton-to-Response: Dialogue Generation Guided by Retrieval Memory”, arXiv:1809.05296v5 [cs.CL], Feb. 28, 2020, 8 pgs. [cited by applicant]
Fan et al., “Augmenting Transformers with KNN-Based Composite Memory for Dialog”, Transactions of the Association for Computational Linguistics, vol. 9, Mar. 1, 2021, pp. 82-99, https://doi.org/10.1162/tacl_a_00356. [cited by applicant]
Gupta et al., “Controlling Dialogue Generation with Semantic Exemplars”, Proceedings of the 2021 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, Ju… [cited by applicant]
Guu et al., “REALM: Retrieval-Augmented Language Model Pre-Training”, arXiv:2002.08909v1 [cs.CL], Feb. 10, 2020, 12 pgs. [cited by applicant]
Holtzman et al., “The Curious Case of Neural Text Degeneration”, arXiv:1904.09751v2 [cs.CL], Feb. 14, 2020, 16 pgs. [cited by applicant]
Humeau et al., “Poly-Encoders: Architectures and Pre-Training Strategies for Fast and Accurate Multi-Sentence Scoring”, International Conference on Learning Representations, Apr. 30, 2020, 14 pgs. [cited by applicant]
Lewis et al., “Retrieval-Augmented Generation for Knowledge-Intensive NLP Tasks”, arXiv:2005.11401v4 [cs.CL], Apr. 12, 2021, 19 pgs. [cited by applicant]
Li et al., “A Diversity-Promoting Objective Function for Neural Conversation Models”, Proceedings of NAACL-HLT 2016, San Diego, California, Jun. 12-17, 2016, pp. 110-119. [cited by applicant]
Li et al., “Don't Say That! Making Inconsistent Dialogue Unlikely with Unlikelihood Training”, arXiv:1911.03860v2 [cs.CL], May 6, 2020, 15 pgs. [cited by applicant]
Liu et al., “How Not to Evaluate Your Dialogue System: An Empirical Study of Unsupervised Evaluation Metrics for Dialogue Response Generation”, Proceedings of the 2016 Conference on Empirical Methods in Natural Language… [cited by applicant]
Mazare et al., “Training Millions of Personalized Dialogue Agents”, arXiv:1809.01984v1 [cs.CL], Sep. 6, 2018, 5 pgs. [cited by applicant]
Papineni et al., “BLEU: a Method for Automatic Evaluation of Machine Translation”, Proceedings of the 40th Annual Meeting of the Association for Computational Linguistics (ACL), Philadelphia, Jul. 2002, pp. 311-318. [cited by applicant]
Roller et al., “Recipes for building an open-domain chatbot”, arXiv:2004.13637v2 [cs.CL], Apr. 30, 2020, 25 pgs. [cited by applicant]
Serban et al., “Multiresolution Recurrent Neural Networks: An Application to Dialogue Response Generation”, arXiv:1606.00776v2 [cs.CL], Jun. 14, 2016, 21 pgs. [cited by applicant]
Welleck et al., “Neural Text Degeneration with Unlikelihood Training”, arXiv:1908.04319v2 [cs.LG], Sep. 26, 2019, 17 pgs. [cited by applicant]
Weston et al., “Retrieve and Refine: Improved Sequence Generation Models for Dialogue”, arXiv:1808.04776v2 [cs.CL], Sep. 6, 2018, 6 pgs. [cited by applicant]
Wu et al., “Response Generation by Context-aware Prototype Editing”, arXiv:1806.07042v4 [cs.CL], Nov. 16, 2018, 9 pgs. [cited by applicant]
Zhang et al., “Dialogpt: Large-Scale Generative Pre-training for Conversational Response Generation”, Proceedings of the 58th Annual Meeting of the Association for Computational Linguistics, Jul. 5-10, 2020, pp. 270-278. [cited by applicant]
Office Action for Japanese Patent Application No. 2022-103809 mailed Aug. 9, 2024, 4 pages. [cited by applicant]
“Launch of “Koestation,” a smartphone app that uses voice synthesis to create an avatar of your own voice”, Toshiba Digital Solutions Corporation, Apr. 17, 2018, 8 pages, obtained from https://www.global.toshiba/jp/comp… [cited by applicant]
“Trends in live streaming services (tipping, etc.)”, Mitsubishi UFJ Research and Consulting, 64 pages, Dec. 14, 2018, obtained from https://www.caa.go.jp/policies/policy/consumer_policy/policy_coordination/internet_comm… [cited by applicant]
Fakoor et al., “Fast, Accurate, and Simple Models for Tabular Data via Augmented Distillation”, Advances in Neural Information Processing Systems, 2020, vol. 33, pp. 8671-8681. [cited by applicant]
Gou et al., “Knowledge Distillation: A Survey”, International Journal of Computer Vision 129.6, 2021, p. 1789-1819. [cited by applicant]