This application generally relates to automatically generating annotated ground-truth corpus for training an NLU model.
A natural-language understanding (NLU) model can receive input in the form of spoken or written natural language. Some NLU models can also provide output in natural language. For example, an electronic voice assistant can receive natural-language input, such as spoken queries, from a person; parse the natural-language input to determine appropriate corresponding actions for a computer to perform; and provide a natural-language output response to the person. For example, a person may input “when will it be light out tomorrow?” and a NLU model in a voice assistant may in response parse that input into a set of actions, perform those actions, and then assemble the results into natural-language output (e.g., “tomorrow, the sun will rise at approximately 5:59 a.m. and set at approximately 8:12 pm”). Examples of NLU models include BERT, GPTn, RoBERTa, and XLNet, among others.
Task-oriented dialogue systems, such as used by voice assistants or voice-enabled devices, typically operate in a limited set of languages due to a lack of annotated multilingual corpus. For instance, for each utterance in a corpus, the slot values in the utterance need to be identified and given slot label(s) that correspond to the slot labels used by the dialogue system so that the system can parse the utterance into input that can be understood and acted on by the system.
Machine learning systems, such as natural-language models used by a dialogue system, are good at generalizing from given ground truth examples. However, in order to build a useful natural-language model, the model needs to be trained using ground-truth examples, i.e., using utterances that are accurately annotated according to the model's labels. A corpus of ground-truth utterances can often consist of several million utterances, and creating these annotated utterances across many languages can be very resource-intensive, because for each language a person needs to identify the relevant slot values in each translated utterance, and accurately label those slot values with slot labels that the model understands. Repeating this process for each language is a difficult and intensive task, as the corpus builder must have expert knowledge of the translated language, the slot labels used by the system, and how those slot labels correspond to specific slot values in the translated language. However, generating an annotated ground-truth corpus is a necessary prerequisite for an NLU model, such as an NLU model used by a dialogue system, to perform tasks in a particular language.
Step 110 of the example method of
Steps 120-140 of the example method of
Step 120 of the example method of
Step 130 of the example method of
Step 150 of the example method of
Referring to step 150 in the example of
Intent label(s) for the utterance in the initial corpus can be used as intent label(s) for the translated, annotated utterance. Particular embodiments may translate the intent label to the second language, while particular embodiments may not perform this translation and may instead associated the translated, annotated utterances with their respective intent labels in the first language.
Step 160 of the example method of
In particular embodiments, a training process may begin with a pre-trained NLU model (e.g., a pre-trained XLM-Roberta model trained on the initial corpus), and multilingual training may then fine-tune the NLU model parameters to create a multilingual NLU. Particular embodiments may simultaneously train an NLU model's intent and slot recognition system.
Particular embodiments may train various classification heads of an NLU model. For example, some embodiments may train heads for intent and slots prediction, bag-of-slot labels, and language-order prediction. For example, an intent and slot prediction portion of an NLU model may perform intent classification and slot-filling tasks. To train this portion, the initial corpus may be used along with the annotated translated corpus described above. For intent classification, the model predicts the intent by using the pooled output from the XLM-R encoder, which is the sentence-level embedding vector. Then, the model predicts slot logits (e.g., as a sequence labeling task) using XLM-R encoder representations of each token in the utterance. Then a cross entropy loss function may be used to compare the intent and slot logits with ground truth labels to get the intent and slot loss.
As another example, a bag-of-slots portion of an NLU model may be trained using n second corpuses. Since each utterance has multiple annotated versions, the constraint that all utterances have the same intent and slot labels can be leveraged. The initial utterance (e.g., in English) and the corresponding utterances in other languages are first batched into one block. The meaning of the utterances in each block is the same, but they are expressed in different languages. Thus, the output of the NLU model on each utterance within a block should be the same or very similar. For instance, in a given block of translated multilingual utterances, each of the utterances should predict the same slot labels. Although the slot labels across languages may not be aligned at each token, the set of B-SLOTNAME and I-SLOTNAME slot tags (in the BIO format) in each utterance inside a batch is the same as others. The bag of slot labels is represented as a Dslots dimensional binary vector with each location indicating which slots labels are present in an utterance, where Dslots is the number of slot labels. Predictions in the different languages are output for intent classification and slot filling. Then, a cross entropy loss is applied between the predictions and the ground truth.
As another example, since the number of words in an utterance across the multiple languages and their word order might be different, computing loss per token may not always provide accurate prediction results because the tokens are not aligned across languages. Thus, the mean of the multiple languages' slot predictions may be determined and the frequency of each slot type among these utterances may be calculated. Computing a cross entropy loss between the mean slot label predictions and the frequency may align the slot label predictions across the n+1 (n second, translated corpuses plus the initial corpus) predictions.
As another example, word order is important in language. There are complicated rules for ordering words in different languages: two semantically identical utterances in different languages might have large differences in the word's position in the sentence. Some languages start a sentence with the subject (S) following the verb (V) and the object (O). Others might start with the verb and end with the object. Therefore, another classification head in an NLU model may be trained and used to predict the language word order given an input utterance. The training dataset may include a plurality of word order: types such as SVO, SOV, VSO, none type, and uncategorized. A cross entropy loss function may be determined between the order prediction and the ground truth for each of n+1 corpuses.
Prior to training a natural-language model, particular embodiments may augment 326 one or more of the n+1 corpuses and then train the model using the augmented corpus(es) 328. For example, particular embodiments may randomly select x percent (e.g., 5%, 10%, etc.) of the relexicalized utterances in an annotated corpus and, for each randomly selected utterance, perform random slot delexicalization 330 in which the slot values in the annotated utterance are replaced with corresponding slot labels. For example, the annotated utterance “Wake me up at [time: five am] [date: this Friday]” may be selected and delexicalized to “Wake me up at TIME_SLOT DATE_SLOT”, and this delexicalized utterance is then added to the, e.g., English corpus (which includes the selected, annotated utterance) to create an augmented English corpus. The same process may be randomly performed for utterances in any of the n other corpuses. Random slot delexicalization helps the NLU model learn general templates of utterances in addition to the specific utterances themselves. In addition, augmenting a corpus with random delexicalizations may improve the NLU model's ability to learn slot-usage patterns across languages, as the slot labels operate as anchors across various languages.
As another example augmentation, particular embodiments may randomly select x percent (e.g., 5%, 10%, etc.) of the utterances in a translated corpus and, for each randomly selected utterance, perform codeswitching 332 on the utterance by swapping one or more words in the utterance with a corresponding translation of the one or more words in another language. For instance, in the example of
Particular embodiments may repeat one or more steps of the method of
Once the trained multilingual natural language model is created, e.g., as in step 160 of the example method of
This disclosure contemplates any suitable number of computer systems 500. This disclosure contemplates computer system 500 taking any suitable physical form. As example and not by way of limitation, computer system 500 may be an embedded computer system, a system-on-chip (SOC), a single-board computer system (SBC) (such as, for example, a computer-on-module (COM) or system-on-module (SOM)), a desktop computer system, a laptop or notebook computer system, an interactive kiosk, a mainframe, a mesh of computer systems, a mobile telephone, a personal digital assistant (PDA), a server, a tablet computer system, or a combination of two or more of these. Where appropriate, computer system 500 may include one or more computer systems 500; be unitary or distributed; span multiple locations; span multiple machines; span multiple data centers; or reside in a cloud, which may include one or more cloud components in one or more networks. Where appropriate, one or more computer systems 500 may perform without substantial spatial or temporal limitation one or more steps of one or more methods described or illustrated herein. As an example and not by way of limitation, one or more computer systems 500 may perform in real time or in batch mode one or more steps of one or more methods described or illustrated herein. One or more computer systems 500 may perform at different times or at different locations one or more steps of one or more methods described or illustrated herein, where appropriate.
In particular embodiments, computer system 500 includes a processor 502, memory 504, storage 506, an input/output (I/O) interface 508, a communication interface 510, and a bus 512. Although this disclosure describes and illustrates a particular computer system having a particular number of particular components in a particular arrangement, this disclosure contemplates any suitable computer system having any suitable number of any suitable components in any suitable arrangement.
In particular embodiments, processor 502 includes hardware for executing instructions, such as those making up a computer program. As an example and not by way of limitation, to execute instructions, processor 502 may retrieve (or fetch) the instructions from an internal register, an internal cache, memory 504, or storage 506; decode and execute them; and then write one or more results to an internal register, an internal cache, memory 504, or storage 506. In particular embodiments, processor 502 may include one or more internal caches for data, instructions, or addresses. This disclosure contemplates processor 502 including any suitable number of any suitable internal caches, where appropriate. As an example and not by way of limitation, processor 502 may include one or more instruction caches, one or more data caches, and one or more translation lookaside buffers (TLBs). Instructions in the instruction caches may be copies of instructions in memory 504 or storage 506, and the instruction caches may speed up retrieval of those instructions by processor 502. Data in the data caches may be copies of data in memory 504 or storage 506 for instructions executing at processor 502 to operate on; the results of previous instructions executed at processor 502 for access by subsequent instructions executing at processor 502 or for writing to memory 504 or storage 506; or other suitable data. The data caches may speed up read or write operations by processor 502. The TLBs may speed up virtual-address translation for processor 502. In particular embodiments, processor 502 may include one or more internal registers for data, instructions, or addresses. This disclosure contemplates processor 502 including any suitable number of any suitable internal registers, where appropriate. Where appropriate, processor 502 may include one or more arithmetic logic units (ALUs); be a multi-core processor; or include one or more processors 502. Although this disclosure describes and illustrates a particular processor, this disclosure contemplates any suitable processor.
In particular embodiments, memory 504 includes main memory for storing instructions for processor 502 to execute or data for processor 502 to operate on. As an example and not by way of limitation, computer system 500 may load instructions from storage 506 or another source (such as, for example, another computer system 500) to memory 504. Processor 502 may then load the instructions from memory 504 to an internal register or internal cache. To execute the instructions, processor 502 may retrieve the instructions from the internal register or internal cache and decode them. During or after execution of the instructions, processor 502 may write one or more results (which may be intermediate or final results) to the internal register or internal cache.
Processor 502 may then write one or more of those results to memory 504. In particular embodiments, processor 502 executes only instructions in one or more internal registers or internal caches or in memory 504 (as opposed to storage 506 or elsewhere) and operates only on data in one or more internal registers or internal caches or in memory 504 (as opposed to storage 506 or elsewhere). One or more memory buses (which may each include an address bus and a data bus) may couple processor 502 to memory 504. Bus 512 may include one or more memory buses, as described below. In particular embodiments, one or more memory management units (MMUs) reside between processor 502 and memory 504 and facilitate accesses to memory 504 requested by processor 502. In particular embodiments, memory 504 includes random access memory (RAM). This RAM may be volatile memory, where appropriate Where appropriate, this RAM may be dynamic RAM (DRAM) or static RAM (SRAM). Moreover, where appropriate, this RAM may be single-ported or multi-ported RAM. This disclosure contemplates any suitable RAM. Memory 504 may include one or more memories 504, where appropriate. Although this disclosure describes and illustrates particular memory, this disclosure contemplates any suitable memory.
In particular embodiments, storage 506 includes mass storage for data or instructions. As an example and not by way of limitation, storage 506 may include a hard disk drive (HDD), a floppy disk drive, flash memory, an optical disc, a magneto-optical disc, magnetic tape, or a Universal Serial Bus (USB) drive or a combination of two or more of these. Storage 506 may include removable or non-removable (or fixed) media, where appropriate. Storage 506 may be internal or external to computer system 500, where appropriate. In particular embodiments, storage 506 is non-volatile, solid-state memory. In particular embodiments, storage 506 includes read-only memory (ROM). Where appropriate, this ROM may be mask-programmed ROM, programmable ROM (PROM), erasable PROM (EPROM), electrically erasable PROM (EEPROM), electrically alterable ROM (EAROM), or flash memory or a combination of two or more of these. This disclosure contemplates mass storage 506 taking any suitable physical form. Storage 506 may include one or more storage control units facilitating communication between processor 502 and storage 506, where appropriate. Where appropriate, storage 506 may include one or more storages 506. Although this disclosure describes and illustrates particular storage, this disclosure contemplates any suitable storage.
In particular embodiments, I/O interface 508 includes hardware, software, or both, providing one or more interfaces for communication between computer system 500 and one or more I/O devices. Computer system 500 may include one or more of these I/O devices, where appropriate. One or more of these I/O devices may enable communication between a person and computer system 500. As an example and not by way of limitation, an I/O device may include a keyboard, keypad, microphone, monitor, mouse, printer, scanner, speaker, still camera, stylus, tablet, touch screen, trackball, video camera, another suitable I/O device or a combination of two or more of these. An I/O device may include one or more sensors. This disclosure contemplates any suitable I/O devices and any suitable I/O interfaces 508 for them. Where appropriate, I/O interface 508 may include one or more device or software drivers enabling processor 502 to drive one or more of these I/O devices. I/O interface 508 may include one or more I/O interfaces 508, where appropriate. Although this disclosure describes and illustrates a particular I/O interface, this disclosure contemplates any suitable I/O interface.
In particular embodiments, communication interface 510 includes hardware, software, or both providing one or more interfaces for communication (such as, for example, packet-based communication) between computer system 500 and one or more other computer systems 500 or one or more networks. As an example and not by way of limitation, communication interface 510 may include a network interface controller (NIC) or network adapter for communicating with an Ethernet or other wire-based network or a wireless NIC (WNIC) or wireless adapter for communicating with a wireless network, such as a WI-FI network. This disclosure contemplates any suitable network and any suitable communication interface 510 for it. As an example and not by way of limitation, computer system 500 may communicate with an ad hoc network, a personal area network (PAN), a local area network (LAN), a wide area network (WAN), a metropolitan area network (MAN), or one or more portions of the Internet or a combination of two or more of these. One or more portions of one or more of these networks may be wired or wireless. As an example, computer system 500 may communicate with a wireless PAN (WPAN) (such as, for example, a BLUETOOTH WPAN), a WI-FI network, a WI-MAX network, a cellular telephone network (such as, for example, a Global System for Mobile Communications (GSM) network), or other suitable wireless network or a combination of two or more of these. Computer system 500 may include any suitable communication interface 510 for any of these networks, where appropriate. Communication interface 510 may include one or more communication interfaces 510, where appropriate. Although this disclosure describes and illustrates a particular communication interface, this disclosure contemplates any suitable communication interface.
In particular embodiments, bus 512 includes hardware, software, or both coupling components of computer system 500 to each other. As an example and not by way of limitation, bus 512 may include an Accelerated Graphics Port (AGP) or other graphics bus, an Enhanced Industry Standard Architecture (EISA) bus, a front-side bus (FSB), a HYPERTRANSPORT (HT) interconnect, an Industry Standard Architecture (ISA) bus, an INFINIBAND interconnect, a low-pin-count (LPC) bus, a memory bus, a Micro Channel Architecture (MCA) bus, a Peripheral Component Interconnect (PCI) bus, a PCI-Express (PCIe) bus, a serial advanced technology attachment (SATA) bus, a Video Electronics Standards Association local (VLB) bus, or another suitable bus or a combination of two or more of these. Bus 512 may include one or more buses 512, where appropriate. Although this disclosure describes and illustrates a particular bus, this disclosure contemplates any suitable bus or interconnect.
Herein, a computer-readable non-transitory storage medium or media may include one or more semiconductor-based or other integrated circuits (ICs) (such, as for example, field-programmable gate arrays (FPGAs) or application-specific ICs (ASICs)), hard disk drives (HDDs), hybrid hard drives (HHDs), optical discs, optical disc drives (ODDs), magneto-optical discs, magneto-optical drives, floppy diskettes, floppy disk drives (FDDs), magnetic tapes, solid-state drives (SSDs), RAM-drives, SECURE DIGITAL cards or drives, any other suitable computer-readable non-transitory storage media, or any suitable combination of two or more of these, where appropriate. A computer-readable non-transitory storage medium may be volatile, non-volatile, or a combination of volatile and non-volatile, where appropriate.
Herein, “or” is inclusive and not exclusive, unless expressly indicated otherwise or indicated otherwise by context. Therefore, herein, “A or B” means “A, B, or both,” unless expressly indicated otherwise or indicated otherwise by context. Moreover, “and” is both joint and several, unless expressly indicated otherwise or indicated otherwise by context. Therefore, herein, “A and B” means “A and B, jointly or severally,” unless expressly indicated otherwise or indicated otherwise by context.
The scope of this disclosure encompasses all changes, substitutions, variations, alterations, and modifications to the example embodiments described or illustrated herein that a person having ordinary skill in the art would comprehend. The scope of this disclosure is not limited to the example embodiments described or illustrated herein. Moreover, although this disclosure describes and illustrates respective embodiments herein as including particular components, elements, feature, functions, operations, or steps, any of these embodiments may include any combination or permutation of any of the components, elements, features, functions, operations, or steps described or illustrated anywhere herein that a person having ordinary skill in the art would comprehend.
This application claims the benefit under 35 U.S.C. § 119 of U.S. Provisional Patent Application 63/426,239 filed Nov. 17, 2022, which is incorporated by reference herein.
Number | Date | Country | |
---|---|---|---|
63426239 | Nov 2022 | US |