IP Library Granted Patent US 12,354,599
Granted Patent B2
US 12,354,599 · App. 18/434,665 · Granted Jul 8, 2025

Speech decoding method and apparatus, computer device, and storage medium

Inventors: Yiheng Huang (Shenzhen, CN); Xiaozheng Jian (Shenzhen, CN); Liqiang He (Shenzhen, CN)
Assignee: TENCENT TECHNOLOGY (SHENZHEN) COMPANY LIMITED
G10L15/083G10L15/063G10L19/008G10L2015/085G10L2015/088
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,354,599
App. No.
18/434,665
Granted
Jul 8, 2025
Kind
B2
Abstract

A method for speech decoding is performed by a computer device. The method includes: obtaining audio data corresponding to a speech, the audio data including a first audio frame and a second audio frame; decoding the first audio frame using a first decoding network corresponding to a low-order language model and a second decoding network corresponding to a differential language model to obtain a plurality of first tokens, each first token having a corresponding decoding score according to the first and second decoding network; determining pruning parameters according to a target token of the plurality of first tokens having a smallest decoding score, wherein the pruning parameters is used for restricting a decoding process of the second audio frame; and decoding the second audio frame using the first decoding network and the second decoding network according to the first token list and the pruning parameters.

Claims (63)

1. A method for speech decoding performed by a computer device, the method comprising:

obtaining audio data corresponding to a speech, the audio data including a first audio frame and a second audio frame;

decoding the first audio frame using a first decoding network corresponding to a low-order language model and a second decoding network corresponding to a differential language model to obtain a plurality of first tokens, each first token having a corresponding decoding score according to the first and second decoding network;

obtaining a decoding score corresponding to a target token of the plurality of first tokens having a smallest decoding score;

determining a first pruning parameter according to a preset value and the decoding score corresponding to the target token;

traversing non-empty input edges in the first decoding network by using a first state of the target token as a start state to obtain a second pruning parameter;

rescoring a first decoding path formed by the non-empty input edges in the second decoding network by using a second state of the target token as a start state to obtain a third pruning parameter; and

decoding the second audio frame using the first decoding network and the second decoding network according to the first token list and the first pruning parameter, the second parameter, and the third parameter.

2. The method according to claim 1 , wherein the traversing non-empty input edges in the first decoding network by using a first state of the target token as a start state to obtain a second pruning parameter comprises:

obtaining a first acoustic score of the first decoding path under an acoustic model; and

obtaining the second pruning parameter according to the first acoustic score, the preset value, and the decoding score corresponding to the target token.

3. The method according to claim 1 , wherein the rescoring a first decoding path formed by the non-empty input edges in the second decoding network by using a second state of the target token as a start state to obtain a third pruning parameter comprises:

obtaining a first acoustic score of the first decoding path under an acoustic model;

obtaining a first path score of the first decoding path in the first decoding network;

obtaining a first rescoring score of the first decoding path in the second decoding network; and

obtaining the third pruning parameter according to the first acoustic score, the first path score, the first rescoring score, the preset value, and the decoding score corresponding to the target token.

4. The method according to claim 1 , wherein the decoding the second audio frame using the first decoding network and the second decoding network according to the first token list and the pruning parameters comprises:

for each first token in the first token list, traversing non-empty input edges in the first decoding network by using the first state of the first token as a start state, and determining whether to skip the first token according to the second pruning parameter and a second decoding path formed by each non-empty input edge;

rescoring the second decoding path formed by the non-empty input edge in the second decoding network by using the second state of the first token as a start state, and determining whether to skip the first token according to a rescoring result and the third pruning parameter;

obtaining a second token by performing a state jump on the first token, the second token comprising an updated state pair and a decoding score;

combining second tokens corresponding to all the first tokens into a second token list; and

determining a second token with a smallest decoding score in the second token list as a decoding result of the second audio frame.

5. The method according to claim 1 , wherein each first token includes a pair of states for characterizing a correspondence between a first state of the first token in the first decoding network and a second state of the first token in the second decoding network.

6. A computer device, comprising a processor and a memory, the memory storing computer-readable instructions that, when executed by the processor, cause the computer device to perform a method for speech decoding including:

obtaining audio data corresponding to a speech, the audio data including a first audio frame and a second audio frame;

decoding the first audio frame using a first decoding network corresponding to a low-order language model and a second decoding network corresponding to a differential language model to obtain a plurality of first tokens, each first having a state pair that includes a first state and a second state having a correspondence with the first state;

obtaining a decoding score corresponding to a target token of the plurality of first tokens having a smallest decoding score:

determining a first pruning parameter according to a preset value and the decoding score corresponding to the target token;

traversing non-empty input edges in the first decoding network by using a first state of the target token as a start state to obtain a second pruning parameter:

rescoring a first decoding path formed by the non-empty input edges in the second decoding network by using a second state of the target token as a start state to obtain a third pruning parameter; and

decoding the second audio frame using the first decoding network and the second decoding network according to the first token list and the first pruning parameter, the second parameter, and the third parameter.

7. The computer device according to claim 6 , wherein the traversing non-empty input edges in the first decoding network by using a first state of the target token as a start state to obtain a second pruning parameter comprises:

obtaining a first acoustic score of the first decoding path under an acoustic model; and

obtaining the second pruning parameter according to the first acoustic score, the preset value, and the decoding score corresponding to the target token.

8. The computer device according to claim 6 , wherein the rescoring a first decoding path formed by the non-empty input edges in the second decoding network by using a second state of the target token as a start state to obtain a third pruning parameter comprises:

obtaining a first acoustic score of the first decoding path under an acoustic model;

obtaining a first path score of the first decoding path in the first decoding network;

obtaining a first rescoring score of the first decoding path in the second decoding network; and

obtaining the third pruning parameter according to the first acoustic score, the first path score, the first rescoring score, the preset value, and the decoding score corresponding to the target token.

9. The computer device according to claim 6 , wherein the decoding the second audio frame using the first decoding network and the second decoding network according to the first token list and the pruning parameters comprises:

for each first token in the first token list, traversing non-empty input edges in the first decoding network by using the first state of the first token as a start state, and determining whether to skip the first token according to the second pruning parameter and a second decoding path formed by each non-empty input edge;

rescoring the second decoding path formed by the non-empty input edge in the second decoding network by using the second state of the first token as a start state, and determining whether to skip the first token according to a rescoring result and the third pruning parameter;

obtaining a second token by performing a state jump on the first token, the second token comprising an updated state pair and a decoding score;

combining second tokens corresponding to all the first tokens into a second token list; and

determining a second token with a smallest decoding score in the second token list as a decoding result of the second audio frame.

10. The computer device according to claim 6 , wherein each first token includes a pair of states for characterizing a correspondence between a first state of the first token in the first decoding network and a second state of the first token in the second decoding network.

11. A non-transitory computer-readable storage medium, storing computer-readable instructions that, when executed by one or more processors of a computer device, cause the computer device to perform a method for speech decoding including:

obtaining audio data corresponding to a speech, the audio data including a first audio frame and a second audio frame;

decoding the first audio frame using a first decoding network corresponding to a low-order language model and a second decoding network corresponding to a differential language model to obtain a plurality of first tokens, each first token having a corresponding decoding score according to the first and second decoding network;

obtaining a decoding score corresponding to a target token of the plurality of first tokens having a smallest decoding score;

determining a first pruning parameter according to a preset value and the decoding score corresponding to the target token;

traversing non-empty input edges in the first decoding network by using a first state of the target token as a start state to obtain a second pruning parameter;

rescoring a first decoding path formed by the non-empty input edges in the second decoding network by using a second state of the target token as a start state to obtain a third pruning parameter; and

decoding the second audio frame using the first decoding network and the second decoding network according to the first token list and the first pruning parameter, the second parameter, and the third parameter.

12. The non-transitory computer-readable storage medium according to claim 11 , wherein the traversing non-empty input edges in the first decoding network by using a first state of the target token as a start state to obtain a second pruning parameter comprises:

obtaining a first acoustic score of the first decoding path under an acoustic model; and

obtaining the second pruning parameter according to the first acoustic score, the preset value, and the decoding score corresponding to the target token.

13. The non-transitory computer-readable storage medium according to claim 11 , wherein the rescoring a first decoding path formed by the non-empty input edges in the second decoding network by using a second state of the target token as a start state to obtain a third pruning parameter comprises:

obtaining a first acoustic score of the first decoding path under an acoustic model;

obtaining a first path score of the first decoding path in the first decoding network;

obtaining a first rescoring score of the first decoding path in the second decoding network; and

obtaining the third pruning parameter according to the first acoustic score, the first path score, the first rescoring score, the preset value, and the decoding score corresponding to the target token.

14. The non-transitory computer-readable storage medium according to claim 11 , wherein each first token includes a pair of states for characterizing a correspondence between a first state of the first token in the first decoding network and a second state of the first token in the second decoding network.

Priority Claims (1)
CN 201811536173.X · Dec 14, 2018 · national
Continuity (3)
Continuation 17191604 · Mar 3, 2021
Continuation PCTCN2019116686 · Nov 8, 2019
Related Publication 20240212671A1 · Jun 27, 2024
References Cited (30)
US 9047868B1 · O'Neill et al. · 2015 [cited by applicant]
US 10943583B1 · Gandhe et al. · 2021 [cited by applicant]
US 11017778B1 · Thomson et al. · 2021 [cited by applicant]
US 11935517B2 · Huang · 2024 [cited by examiner]
US 20030061046A1 · Zhao et al. · 2003 [cited by applicant]
US 20040158457A1 · Veprek et al. · 2004 [cited by applicant]
US 20140297267A1 · Spencer et al. · 2014 [cited by applicant]
US 20160093292A1 · Hofer · 2016 [cited by examiner]
US 20190279618A1 · Yadav et al. · 2019 [cited by applicant]
US 20210193123A1 · Huang et al. · 2021 [cited by applicant]
CN 1455387A · 2003 [cited by applicant]
CN 105513589A · 2016 [cited by applicant]
CN 105575386A · 2016 [cited by applicant]
CN 105654945A · 2016 [cited by applicant]
CN 105845128A · 2016 [cited by applicant]
CN 108288467A · 2018 [cited by applicant]
CN 108305634A · 2018 [cited by applicant]
CN 108682415A · 2018 [cited by applicant]
CN 110164421A · 2019 [cited by applicant]
DE 2018108856A1 · 2018 [cited by applicant]
WO WO2012076895A1 · 2012 [cited by applicant]
Y. Fujii, D. Genzel, A. C. Popat and R. Teunen, “Label transition and selection pruning and automatic decoding parameter optimization for time-synchronous Viterbi decoding,” 2015 13th International Conference on Documen… [cited by examiner]
Takaaki Hori, Chiori Hori, and Yasuhiro Minam, “Fast On-The-Fly Composition for Weighted Finite-State Transducers in 1.8 Million-Word Vocabulary Continuous Speech Recognition” NTT Communication Science Laboratories, NTT… [cited by examiner]
D. Willett and S. Katagiri, “Recent advances in efficient decoding combining on-line transducer composition and smoothed language model incorporation,” 2002 IEEE International Conference on Acoustics, Speech, and Signal… [cited by examiner]
D. Nolden, R. Schluter and H. Ney, “Extended Search Space Pruning in LVCSR,” 2012 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), Kyoto, Japan, 2012, pp. 4429-4432, DOI: 10.1109/ICASSP… [cited by applicant]
Disclosed Anonymously, “Contextual Speech Recognition Using Rescore-Aware Pruning” An IP.com Prior Art Database Technical Disclosure, IP.com No. IPCOM000252757D (Year: 2018). [cited by applicant]
I. Illina and Y. Gong, “Improvement in N-Best Search for Continuous Speech Recognition,” Proceeding of Fourth International Conference on Spoken Language Processing. ICSLP '96, Philadelphia, PA, USA, 1996, pp. 2147-2150… [cited by applicant]
Tencent Technology, ISR/WO, PCT/CN2019/116686, Feb. 18, 2020, 8 pgs. [cited by applicant]
Tencent Technology, IPRP, PCT/CN2019/116686, Jun. 8, 2021, 6 pgs. [cited by applicant]
Y. Fujii, et al., “Label Transition and Selection Pruning and Automatic Decoding Parameter Optimization for Time-Synchronous Viterbi Decoding,” 2015 13th International Conference on Document Analysis and Recognition, DO… [cited by applicant]