Optimizations to decoding of wfst models for automatic speech recognition
AssigneeIntel Corporation
InventorsJoachim HOFER, Georg STEMMER
Life of this patent
Estimating the term…
Abstract
A method in a computing device for decoding a weighted finite state transducer (WFST) for automatic speech recognition is described. The method includes sorting a set of one or more WFST arcs based on their arc weight in ascending order. The method further includes iterating through each arc in the sorted set of arcs according to the ascending order until the score of the generated token corresponding to an arc exceeds a score threshold. The method further includes discarding any remaining arcs in the set of arcs that have yet to be considered.
Claims25
A method for performing weighted finite state transducer (WFST) speech recognition, comprising:
- sorting a set of one or more WFST arcs based on their weight in ascending order;
- iterating through each arc in the sorted set of arcs according to the ascending order until the score of a generated token corresponding to the arc exceeds a score threshold;
- and
- discarding any remaining arcs in the set of arcs that have yet to be considered.
An apparatus for weighted finite state transducer (WFST) speech recognition, comprising:
- an acoustic frontend configured to receive a digital audio signal representing human speech from an analog/digital converter and convert the digital audio signal into a set of one or more acoustic features;
- a memory to store a trained WFST model for speech recognition;
- a WFST decoder to use token passing to decode the acoustic features into transcribed words based on the WFST model, the WFST decoder to execute instructions to:
- sort a set of one or more WFST arcs based on their arc weight in ascending order;
- iterate through each arc in the sorted set of arcs according to the ascending order until the score of the generated token corresponding to the arc exceeds a score threshold;
- and
- discard any remaining arcs in the set of arcs that have yet to be considered;
- and
- a language interpreter execution unit to output the transcribed words to at least one of a sound output and a visual output.
A non-transitory computer-readable storage medium having instructions stored therein, wherein the instructions, when executed by a processor of a client device, causes the processor to perform operations for weighted finite state transducer (WFST) speech recognition, the operations comprising:
- sorting a set of one or more arcs based on their arc weight in ascending order;
- iterating through each arc in the sorted set of arcs according to the ascending order until the score of the generated token corresponding to the arc exceeds a score threshold;
- and
- discarding any remaining arcs in the set of arcs that have yet to be considered.
Dependencies are inferred from the claim text.