EP3948851A1 - Dynamic combination of acoustic model states - Google Patents
Dynamic combination of acoustic model statesInfo
- Publication number
- EP3948851A1 EP3948851A1 EP20708877.4A EP20708877A EP3948851A1 EP 3948851 A1 EP3948851 A1 EP 3948851A1 EP 20708877 A EP20708877 A EP 20708877A EP 3948851 A1 EP3948851 A1 EP 3948851A1
- Authority
- EP
- European Patent Office
- Prior art keywords
- speech
- models
- state
- features
- input
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L15/00—Speech recognition
- G10L15/08—Speech classification or search
- G10L15/16—Speech classification or search using artificial neural networks
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N20/00—Machine learning
- G06N20/20—Ensemble learning
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/04—Architecture, e.g. interconnection topology
- G06N3/044—Recurrent networks, e.g. Hopfield networks
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/04—Architecture, e.g. interconnection topology
- G06N3/044—Recurrent networks, e.g. Hopfield networks
- G06N3/0442—Recurrent networks, e.g. Hopfield networks characterised by memory or gating, e.g. long short-term memory [LSTM] or gated recurrent units [GRU]
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/04—Architecture, e.g. interconnection topology
- G06N3/045—Combinations of networks
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/04—Architecture, e.g. interconnection topology
- G06N3/0464—Convolutional networks [CNN, ConvNet]
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/08—Learning methods
-
- G—PHYSICS
- G06—COMPUTING OR CALCULATING; COUNTING
- G06N—COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS
- G06N3/00—Computing arrangements based on biological models
- G06N3/02—Neural networks
- G06N3/08—Learning methods
- G06N3/09—Supervised learning
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L15/00—Speech recognition
- G10L15/06—Creation of reference templates; Training of speech recognition systems, e.g. adaptation to the characteristics of the speaker's voice
- G10L15/065—Adaptation
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L15/00—Speech recognition
- G10L15/02—Feature extraction for speech recognition; Selection of recognition unit
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L15/00—Speech recognition
- G10L15/20—Speech recognition techniques specially adapted for robustness in adverse environments, e.g. in noise, of stress induced speech
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L15/00—Speech recognition
- G10L15/22—Procedures used during a speech recognition process, e.g. man-machine dialogue
-
- G—PHYSICS
- G10—MUSICAL INSTRUMENTS; ACOUSTICS
- G10L—SPEECH ANALYSIS TECHNIQUES OR SPEECH SYNTHESIS; SPEECH RECOGNITION; SPEECH OR VOICE PROCESSING TECHNIQUES; SPEECH OR AUDIO CODING OR DECODING
- G10L25/00—Speech or voice analysis techniques not restricted to a single one of groups G10L15/00 - G10L21/00
- G10L25/27—Speech or voice analysis techniques not restricted to a single one of groups G10L15/00 - G10L21/00 characterised by the analysis technique
- G10L25/30—Speech or voice analysis techniques not restricted to a single one of groups G10L15/00 - G10L21/00 characterised by the analysis technique using neural networks
Definitions
- Deep learning has been instrumental in bringing speech products to a variety of technology platforms. Many on-device as well as on-cloud speech applications have been developed, which deliver strong ASR (automated speech recognition) performance. Deep learning has also enabled digital personal assistants that have become an important resource for everyday use. Speech recognition-based products are expected to work well in not just controlled environments but also in acoustic scenarios including noise, far-field conditions, non-native speech, child voices, whisper, natural conversation, and side-speech etc. These expectations are difficult to meet with a single deep learning model. While some speech models have been combined, the combinations generally result in the need for significantly more computing resources to execute.
- a computer implemented method classifies an input corresponding to multiple different kinds of input.
- the method includes obtaining a set of features from the input, providing the set of features to multiple different models to generate state predictions, generating a set of state-dependent predicted weights, and combining the state predictions from the multiple models, based on the state-dependent predicted weights for classification of the set of features.
- FIG. 1 is block diagram of a system that combines two acoustic models according to an example embodiment.
- FIG. 2 is a flowchart illustrating a computer implemented method of combining acoustic models according to an example embodiment.
- FIG. 3 is a block diagram of a framework for dynamically determining combination weights for combining acoustic models according to an example
- FIG. 4 is a block diagram of an alternative framework for dynamically determining combination weights for combining acoustic models according to an example embodiment.
- FIG. 5 is a block schematic diagram of a computer system to implement one or more example embodiments.
- the functions or algorithms described herein may be implemented in software in one embodiment.
- the software may consist of computer executable instructions stored on computer readable media or computer readable storage device such as one or more non-transitory memories or other type of hardware-based storage devices, either local or networked.
- modules which may be software, hardware, firmware or any combination thereof. Multiple functions may be performed in one or more modules as desired, and the embodiments described are merely examples.
- the software may be executed on a digital signal processor, ASIC, microprocessor, or other type of processor operating on a computer system, such as a personal computer, server or other computer system, turning such computer system into a specifically programmed machine.
- the functionality can be configured to perform an operation using, for instance, software, hardware, firmware, or the like.
- the phrase“configured to” can refer to a logic circuit structure of a hardware element that is to implement the associated functionality.
- the phrase“configured to” can also refer to a logic circuit structure of a hardware element that is to implement the coding design of associated functionality of firmware or software.
- the term“module” refers to a structural element that can be implemented using any suitable hardware (e.g., a processor, among others), software (e.g., an application, among others), firmware, or any combination of hardware, software, and firmware.
- the term,“logic” encompasses any functionality for performing a task.
- each operation illustrated in the flowcharts corresponds to logic for performing that operation.
- An operation can be performed using, software, hardware, firmware, or the like.
- the terms,“component,”“system,” and the like may refer to computer-related entities, hardware, and software in execution, firmware, or combination thereof.
- a component may be a process running on a processor, an object, an executable, a program, a function, a subroutine, a computer, or a combination of software and hardware.
- the term,“processor,” may refer to a hardware component, such as a processing unit of a computer system.
- the claimed subject matter may be implemented as a method, apparatus, or article of manufacture using standard programming and engineering techniques to produce software, firmware, hardware, or any combination thereof to control a computing device to implement the disclosed subject matter.
- article of manufacture as used herein is intended to encompass a computer program accessible from any computer-readable storage device or media.
- Computer-readable storage media can include, but are not limited to, magnetic storage devices, e.g., hard disk, floppy disk, magnetic strips, optical disk, compact disk (CD), digital versatile disk (DVD), smart cards, flash memory devices, among others.
- computer-readable media i.e., not storage media, may additionally include communication media such as transmission media for wireless signals and the like.
- LSTM deep long-short term memory
- SR speech recognition
- SI speaker-independent
- AMOC acoustic model combination
- the present inventive subject matter uses static and dynamic combination of acoustic model states to provide an improvement to many types and applications of ASR.
- a state-dependent set of weights are learned in a data-driven framework that aligns with ASR training criterion. These weights are can be static, i.e. fixed for the models, or dynamic, where the weights are obtained from a prediction model.
- the accuracy of speech recognition is improved through combination of different acoustic models. State predictions from two different models are combined, element by element, with a different weight for each element. The weights may be determined statically or dynamically. This allows a lower confidence level for an element to receive less weight in the overall confidence level. This leads to better accuracy in speech recognition.
- FIG. 1 is block diagram of a system 100 that combines two acoustic models, model 1 at 110 and model 2 at 115. Note that many more acoustic models may be combined in further examples.
- Model 110 may be an acoustic model that has been trained to work very well for a broad range of acoustic scenarios. Model 110 may be referred to as a generic acoustic model.
- Model 115 may be a dedicated model that is specifically trained for a far-field speaker scenario, or another scenario.
- Features 120 such as speech or image features are provided to the two models. The features may include different kinds of input, such as normal speech, far field speech, or other kinds of speech.
- the feature may include input corresponding to daylight images or images taken at night, or in the rain.
- the generic model may be trained on a training data set that includes many if not all the different kinds of speech, while dedicated models may be trained on one or a few of the different kinds of speech.
- the two models 110 and 115 are combined at 125 such that the single combined model shows strong gains for each of the scenarios over the previous best results in that scenario.
- more than two models such as N models may be combined.
- the combination is performed based on state dependent weights 130, which have been derived based on the different kinds of input expected.
- the weights for each state are independently derived, such as by a deep learning model.
- the states may comprise senones, speech segments, or other sounds, while in image recognition, the states may comprise sets of pixels representing lines or other combinations of pixels.
- the ability to combine models at the state level can be applied to many other practical applications by identifying different conditions under which input is collected and training different models for such different conditions.
- a diverse number of dedicated models for different speech and noise scenarios may be used.
- the ability to combine such dedicated models can be helpful for server applications, where robust ASR performance may be obtained despite highly varied acoustic application environments, audio processing pipelines, and speaker bases, etc.
- the diverse acoustic scenarios and applications may be served without the need for additional modifications.
- LSTM-RNN models consist of a few layers of LSTM cells along with a top layer that includes a function to receive an input vector of K real numbers and normalize the input function into a probability distribution consisting of K probabilities.
- the top layer may be referred to as a SoftMax layer.
- Context-dependent tied tri-phones, a class of sounds in context constitute the acoustic states in one example.
- the output of the combined model provides a predication distribution over the states for a given frame of speech features.
- the combination weights in the framework of the ASR itself may be used.
- a data-driven framework is used for learning the combination weights for both static state prediction (SSP) and dynamic state prediction (DSP) approaches.
- FIG. 2 is a flowchart illustrating a computer implemented method 200 for combining model states utilizing state dependent combination weights. Multiple different kinds of related input is classified by method 200 The input is related in that it is of the same general type, such as speech, or images, or other types of input, however, the kind of speech or images are different as previously described. Multiple operations are described at a general level, with algorithm details described further below.
- Method 200 starts by obtaining a set of features from an input at operation
- the input in one example is speech, such as the phrase:“set an alarm.”
- the features may be obtained in a known manner and comprise digital representations of speech.
- the features are provided to multiple speech recognition models that have been trained on different kinds of speech and/or each of the multiple models may have different structures or modeling technologies.
- the different kinds of speech may include two or more of speech in a noisy environment, native speech, non-native speech, child speech, whispered speech, natural conversation speech, and distant speech, as well as other kinds of speech, which may vary for different applications.
- the models may be deep learning LSTM acoustic models in one embodiment. Some types of models may be used in further embodiments, such as Bidirectional LSTM, generic Recurrent Neural Networks (RNN), Convolutional Neural Networks (CNN) or other Feed-forward acoustic models.
- RNN generic Recurrent Neural Networks
- CNN Convolutional Neural Networks
- Two different models with different structure or modeling technologies may be trained on the same kind of speech, or on different kinds of speech.
- the models generate state predictions based on the features in accordance with their specific training.
- state dependent predicted weights are obtained.
- the predicted weights may be generated by a trained deep learning network, which is trained on a training set of state labeled features. Weights may be time dependent static weights or may be provided by a prediction cell based on the current features.
- the state predictions from the models are combined based on the state dependent predicted weights for classification of the set of features at operation 240.
- An utterance from a user desiring to set an alarm may take the form of“set an alarm.”
- a prediction of the input -“set an alarm” - is then provided at operation 250. Note that the prediction may take any form, such as the actual spoken words, or even a code
- State dependent weights 130 may utilize a small prediction model, referred to as a combination cell that dynamically evaluates the model combination weight O [k ⁇ for time instant t and acoustic state k.
- a time-independent a [&] may also be trained for static state prediction such that a prediction model need not be used.
- Equation 1 the combined model states are represented in Equation 1 :
- Equation 1 the state combination weights are a [&] with k indicating an acoustic state. Equation 1 is state dependent with dimension as the number of states in the acoustic model, and Si and S2 are the state predictions from the two acoustic models. If N acoustic models are to be combined, the weight for the states of each of the separate models will add up to 1.
- All weights a[&] are between 0 and 1, and may be initialized to a fixed value, such as i.
- Standard ASR training criterion may be used to train state-dependent combination weights.
- a [&] may be restrained to be identical for all states but is sub-optimal compared state-dependent a [£].
- the choice of the value of initialization parameter i likely depends on the application scenario, and the nature of the models.
- the initialization weight, i 0.5 is used and works well as an initialized value for the weights. Equation 1, referred to as, combination, may be applied to the Softmax Si and S2 state predictions by models 110 and 115 respectively.
- Equation 1 The state-independent combination weights, i.e. with identical a.[k ⁇ for all states, is a special case of the state-dependent weights.
- a special case exists where for a particular speech frame, only one of the states, say k, is dominant for both the models, and rest of states, i.e., Si[j] and S2[j] are either 0 or significantly small for j 1 k.
- Equation 1 is equivalent to:
- SSP offers additional advantages.
- SSP training aligns with the ASR training objectives to learn state-dependent combination weights. This allows SSP to best leverage the state classification boundaries from individual models.
- the training criterion converges to a state-dependent a.
- the predicted a for states like“sil”,“noise” strongly favor the generic model.
- the generic model, model 1 at 110 may be trained using a large corpus including mobile and close-talking data.
- the generic model learns the classification for silence and noise.
- the dedicated model training in one acoustic based example may predominantly consist of far-field and noisy data, where the classification boundaries for silence and noise are fuzzy.
- SSP learns a way to best leverage the classification boundaries from the individual models.
- DSP dynamic state prediction
- SR training criterion is leveraged to train state-dependent combination weights. Audio from different acoustic conditions exhibit different characteristics, therefore, static combination weights are likely sub- optimal.
- FIG. 3 is a block diagram of a framework 300 for dynamic acoustic model combination using SSP.
- Framework 300 is described in terms of a speech recognition application, but is also applicable to other applications, such as image recognition.
- Audio 310 is provided to a feature extraction mechanism 315 to extract features from speech.
- the speech may be received from a microphone, or received in digital form from a recording.
- the extracted features from mechanism 315 is provided to two different models 320 and 325 that have been trained for generating states based on different kinds of input.
- the features are also provided to a weight prediction model 330 that operates to predict weights for combining the states as indicated at a combining mechanism 335.
- the combined states are used to provide predictions using a small prediction model based on the combination of states.
- the predictions are provided to a speech decoder 340, which outputs the predicted speech at 345.
- Scenario-dependent combination may be leveraged by dynamically predicting time and state-dependent combination weights c [&] in:
- a prediction model is used to predict ⁇ /.i[k ⁇ at time instant t and acoustic state k.
- a variety of prediction models may be used in the DSP framework.
- the acoustic model consists of LSTM cells, making it logical to use a one- layer LSTM cell to model and predict ou[k ⁇ .
- the prediction model aligns well with the core ASR models; SR features and ASR training criterion may be reused to predict at[k
- FIG. 4 illustrates a framework 400 that is an extension of the DSP approach.
- Features 410 are provided to model 1 415 and model 2 420.
- Hidden layer outputs Hit and H2t respectively from the models are provided to a concatenation function 425.
- the concatenated hidden layer outputs are provided to the weight prediction model 430, with the weights provided to a combiner 435 to produce the prediction that is provided to speech decoder 437, which outputs the predicted speech at 440.
- Framework 400 is based on an understanding that in a deep network, the initial layers normalize the features and make it robust across speakers and acoustic environments. Whereas, the upper layers gradually learn decision boundaries. Framework 400 allows incorporation of some information from the individual ASR models.
- FIG. 5 is a block schematic diagram of a computer system 500 to implement one or more methods of combining states of multiple models for providing predictions corresponding to different types of input according to example embodiments. All components need not be used in various embodiments.
- One example computing device in the form of a computer 500 may include a processing unit 502, memory 503, removable storage 510, and non-removable storage 512.
- the example computing device is illustrated and described as computer 500, the computing device may be in different forms in different embodiments.
- the computing device may instead be a smartphone, a tablet, smartwatch, smart storage device (SSD), or other computing device including the same or similar elements as illustrated and described with regard to FIG. 5.
- Devices, such as smartphones, tablets, and smartwatches, are generally collectively referred to as mobile devices or user equipment.
- the storage may also or alternatively include cloud-based storage accessible via a network, such as the Internet or server based storage.
- a network such as the Internet or server based storage.
- an SSD may include a processor on which the parser may be run, allowing transfer of parsed, filtered data through I/O channels between the SSD and main memory.
- Memory 503 may include volatile memory 514 and non-volatile memory
- Computer 500 may include - or have access to a computing environment that includes - a variety of computer-readable media, such as volatile memory 514 and non volatile memory 508, removable storage 510 and non-removable storage 512.
- Computer storage includes random access memory (RAM), read only memory (ROM), erasable programmable read-only memory (EPROM) or electrically erasable programmable read only memory (EEPROM), flash memory or other memory technologies, compact disc read-only memory (CD ROM), Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium capable of storing computer-readable instructions.
- Computer 500 may include or have access to a computing environment that includes input interface 506, output interface 504, and a communication interface
- Output interface 504 may include a display device, such as a touchscreen, that also may serve as an input device.
- the input interface 506 may include one or more of a touchscreen, touchpad, mouse, keyboard, camera, one or more device-specific buttons, one or more sensors integrated within or coupled via wired or wireless data connections to the computer 500, and other input devices.
- the computer may operate in a networked environment using a communication connection to connect to one or more remote computers, such as database servers.
- the remote computer may include a personal computer (PC), server, router, network PC, a peer device or other common data flow network switch, or the like.
- the communication connection may include a Local Area Network (LAN), a Wide Area Network (WAN), cellular, Wi-Fi, Bluetooth, or other networks.
- the various components of computer 500 are connected with a system bus 520.
- Computer-readable instructions stored on a computer-readable medium are executable by the processing unit 502 of the computer 500, such as a program 518.
- the program 518 in some embodiments comprises software to implement one or more methods described herein.
- a hard drive, CD-ROM, and RAM are some examples of articles including a non-transitory computer-readable medium such as a storage device.
- the terms computer-readable medium and storage device do not include carrier waves to the extent carrier waves are deemed too transitory.
- Storage can also include networked storage, such as a storage area network (SAN).
- Computer program 518 along with the workspace manager 522 may be used to cause processing unit 502 to perform one or more methods or algorithms described herein.
- a computer implemented method classifies input corresponding to multiple different kinds of input.
- the method includes obtaining a set of features from the input, providing the set of features to multiple different models to generate state predictions, generating a set of state-dependent predicted weights, and combining the state predictions from the multiple models, based on the state-dependent predicted weights for classification of the set of features.
- a machine-readable storage device has instructions for execution by a processor of a machine to cause the processor to perform operations to perform a method of classifying different kinds of input.
- the operations include obtaining a set of features from the input, providing the set of features to multiple different models to generate state predictions, generating a set of state dependent predicted weights, and combining the state predictions from the multiple models, based on the state dependent predicted weights for classification of the set of features.
- the device of example 15 wherein the different kinds of speech include two or more of speech in a noisy environment, native speech, non-native speech, child speech, whispered speech, natural conversation speech, and distant speech.
- a device includes a processor and a memory device coupled to the processor and having a program stored thereon for execution by the processor to perform operations.
- the operations include obtaining a set of features from the input, providing the set of features to multiple different models to generate state predictions, generating a set of state dependent predicted weights, and combining the state predictions from the multiple models, based on the state dependent predicted weights for classification of the set of features.
- the input comprises speech
- the set of features comprise digital representations of speech
- the multiple different models comprise speech recognition models independently trained on different kinds of speech, or each of the multiple models trained for input corresponding to a different kind of input, or combinations thereof, and wherein the different kinds of speech include two or more of speech in a noisy environment, native speech, non-native speech, child speech, whispered speech, natural conversation speech, and distant speech.
Landscapes
- Engineering & Computer Science (AREA)
- Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Artificial Intelligence (AREA)
- Evolutionary Computation (AREA)
- Computational Linguistics (AREA)
- Health & Medical Sciences (AREA)
- Software Systems (AREA)
- Mathematical Physics (AREA)
- General Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- Computing Systems (AREA)
- Data Mining & Analysis (AREA)
- Biophysics (AREA)
- General Health & Medical Sciences (AREA)
- Molecular Biology (AREA)
- Biomedical Technology (AREA)
- Life Sciences & Earth Sciences (AREA)
- Multimedia (AREA)
- Acoustics & Sound (AREA)
- Human Computer Interaction (AREA)
- Audiology, Speech & Language Pathology (AREA)
- Computer Vision & Pattern Recognition (AREA)
- Medical Informatics (AREA)
- Image Analysis (AREA)
- User Interface Of Digital Computer (AREA)
Abstract
Description
Claims
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| US16/363,705 US12014728B2 (en) | 2019-03-25 | 2019-03-25 | Dynamic combination of acoustic model states |
| PCT/US2020/015760 WO2020197627A1 (en) | 2019-03-25 | 2020-01-30 | Dynamic combination of acoustic model states |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| EP3948851A1 true EP3948851A1 (en) | 2022-02-09 |
| EP3948851B1 EP3948851B1 (en) | 2024-11-06 |
Family
ID=69740671
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| EP20708877.4A Active EP3948851B1 (en) | 2019-03-25 | 2020-01-30 | Dynamic combination of acoustic model states |
Country Status (3)
| Country | Link |
|---|---|
| US (1) | US12014728B2 (en) |
| EP (1) | EP3948851B1 (en) |
| WO (1) | WO2020197627A1 (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113762585B (en) * | 2021-05-17 | 2023-08-01 | 腾讯科技(深圳)有限公司 | Data processing method, account type identification method and device |
| KR102862872B1 (en) * | 2024-03-27 | 2025-09-23 | 주식회사 크랜베리 | System and method for analysising audio |
| CN118380011B (en) * | 2024-04-16 | 2024-10-25 | 泰德网聚(北京)科技股份有限公司 | Speech data analysis method and device based on multiple models |
Family Cites Families (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2008058842A1 (en) * | 2006-11-16 | 2008-05-22 | International Business Machines Corporation | Voice activity detection system and method |
| US8935167B2 (en) * | 2012-09-25 | 2015-01-13 | Apple Inc. | Exemplar-based latent perceptual modeling for automatic speech recognition |
| US9240184B1 (en) * | 2012-11-15 | 2016-01-19 | Google Inc. | Frame-level combination of deep neural network and gaussian mixture models |
| US20180174576A1 (en) * | 2016-12-21 | 2018-06-21 | Google Llc | Acoustic-to-word neural network speech recognizer |
| EP3432094A1 (en) * | 2017-07-20 | 2019-01-23 | Siemens Aktiengesellschaft | System state prediction |
-
2019
- 2019-03-25 US US16/363,705 patent/US12014728B2/en active Active
-
2020
- 2020-01-30 WO PCT/US2020/015760 patent/WO2020197627A1/en not_active Ceased
- 2020-01-30 EP EP20708877.4A patent/EP3948851B1/en active Active
Also Published As
| Publication number | Publication date |
|---|---|
| EP3948851B1 (en) | 2024-11-06 |
| US12014728B2 (en) | 2024-06-18 |
| US20200312307A1 (en) | 2020-10-01 |
| WO2020197627A1 (en) | 2020-10-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US11450312B2 (en) | Speech recognition method, apparatus, and device, and storage medium | |
| CN111081230B (en) | Speech recognition method and device | |
| US11170788B2 (en) | Speaker recognition | |
| EP3424044B1 (en) | Modular deep learning model | |
| CN109410924B (en) | Identification methods and identification equipment | |
| US10262260B2 (en) | Method and system for joint training of hybrid neural networks for acoustic modeling in automatic speech recognition | |
| US10832685B2 (en) | Speech processing device, speech processing method, and computer program product | |
| US12321846B2 (en) | Knowledge distillation using deep clustering | |
| US12541691B2 (en) | Mixup data augmentation for knowledge distillation framework | |
| US11735190B2 (en) | Attentive adversarial domain-invariant training | |
| US20190147854A1 (en) | Speech Recognition Source to Target Domain Adaptation | |
| WO2020232860A1 (en) | Speech synthesis method and apparatus, and computer readable storage medium | |
| EP4310838A1 (en) | Speech wakeup method and apparatus, and storage medium and system | |
| US20210358497A1 (en) | Wakeword and acoustic event detection | |
| CN108269569A (en) | Audio recognition method and equipment | |
| Grzeszick et al. | Bag-of-features methods for acoustic event detection and classification | |
| KR20210136706A (en) | Electronic apparatus and method for controlling thereof | |
| CN117337467A (en) | End-to-end speaker separation via iterative speaker embeddings | |
| KR20190136578A (en) | Method and apparatus for speech recognition | |
| US12014728B2 (en) | Dynamic combination of acoustic model states | |
| WO2020209957A1 (en) | Automated speech recognition confidence classifier | |
| KR20240164885A (en) | Dummy Prototype Networks for Pew-Shot Open-Set Keyword Spotting | |
| EP4497132A1 (en) | Multi-task learning for personalized keyword spotting | |
| US11593641B2 (en) | Automatic generation of synthetic samples using dynamic deep autoencoders | |
| Yang et al. | A chaotic time series prediction model for speech signal encoding based on genetic programming |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: UNKNOWN |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE INTERNATIONAL PUBLICATION HAS BEEN MADE |
|
| PUAI | Public reference made under article 153(3) epc to a published international application that has entered the european phase |
Free format text: ORIGINAL CODE: 0009012 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: REQUEST FOR EXAMINATION WAS MADE |
|
| 17P | Request for examination filed |
Effective date: 20210817 |
|
| AK | Designated contracting states |
Kind code of ref document: A1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
| DAV | Request for validation of the european patent (deleted) | ||
| DAX | Request for extension of the european patent (deleted) | ||
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
| 17Q | First examination report despatched |
Effective date: 20230706 |
|
| GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: GRANT OF PATENT IS INTENDED |
|
| INTG | Intention to grant announced |
Effective date: 20240328 |
|
| GRAJ | Information related to disapproval of communication of intention to grant by the applicant or resumption of examination proceedings by the epo deleted |
Free format text: ORIGINAL CODE: EPIDOSDIGR1 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: EXAMINATION IS IN PROGRESS |
|
| GRAP | Despatch of communication of intention to grant a patent |
Free format text: ORIGINAL CODE: EPIDOSNIGR1 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: GRANT OF PATENT IS INTENDED |
|
| INTC | Intention to grant announced (deleted) | ||
| P01 | Opt-out of the competence of the unified patent court (upc) registered |
Effective date: 20240425 |
|
| INTG | Intention to grant announced |
Effective date: 20240527 |
|
| GRAS | Grant fee paid |
Free format text: ORIGINAL CODE: EPIDOSNIGR3 |
|
| GRAA | (expected) grant |
Free format text: ORIGINAL CODE: 0009210 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: THE PATENT HAS BEEN GRANTED |
|
| AK | Designated contracting states |
Kind code of ref document: B1 Designated state(s): AL AT BE BG CH CY CZ DE DK EE ES FI FR GB GR HR HU IE IS IT LI LT LU LV MC MK MT NL NO PL PT RO RS SE SI SK SM TR |
|
| REG | Reference to a national code |
Ref country code: GB Ref legal event code: FG4D |
|
| REG | Reference to a national code |
Ref country code: CH Ref legal event code: EP |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R096 Ref document number: 602020040767 Country of ref document: DE |
|
| REG | Reference to a national code |
Ref country code: IE Ref legal event code: FG4D |
|
| REG | Reference to a national code |
Ref country code: LT Ref legal event code: MG9D |
|
| REG | Reference to a national code |
Ref country code: NL Ref legal event code: MP Effective date: 20241106 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: PT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250306 Ref country code: IS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250306 Ref country code: HR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FI Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 Ref country code: NL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| REG | Reference to a national code |
Ref country code: AT Ref legal event code: MK05 Ref document number: 1740295 Country of ref document: AT Kind code of ref document: T Effective date: 20241106 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BG Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: ES Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: NO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250206 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LV Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 Ref country code: GR Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250207 Ref country code: AT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: PL Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: RS Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20250206 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SM Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: DK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: EE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: RO Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SK Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CZ Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IT Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| REG | Reference to a national code |
Ref country code: DE Ref legal event code: R097 Ref document number: 602020040767 Country of ref document: DE |
|
| REG | Reference to a national code |
Ref country code: CH Ref legal event code: PL |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: SE Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| PLBE | No opposition filed within time limit |
Free format text: ORIGINAL CODE: 0009261 |
|
| STAA | Information on the status of an ep patent application or granted ep patent |
Free format text: STATUS: NO OPPOSITION FILED WITHIN TIME LIMIT |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: LU Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20250130 Ref country code: MC Free format text: LAPSE BECAUSE OF FAILURE TO SUBMIT A TRANSLATION OF THE DESCRIPTION OR TO PAY THE FEE WITHIN THE PRESCRIBED TIME-LIMIT Effective date: 20241106 |
|
| 26N | No opposition filed |
Effective date: 20250807 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: BE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20250131 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: FR Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20250131 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: CH Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20250131 |
|
| REG | Reference to a national code |
Ref country code: BE Ref legal event code: MM Effective date: 20250131 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: GB Payment date: 20251220 Year of fee payment: 7 |
|
| PG25 | Lapsed in a contracting state [announced via postgrant information from national office to epo] |
Ref country code: IE Free format text: LAPSE BECAUSE OF NON-PAYMENT OF DUE FEES Effective date: 20250130 |
|
| PGFP | Annual fee paid to national office [announced via postgrant information from national office to epo] |
Ref country code: DE Payment date: 20251217 Year of fee payment: 7 |