System and method of automatic speech recognition using parallel processing for weighted finite state transducer-based speech decoding

A computer-implemented method of speech recognition, comprising:

• forming a weighted finite state transducer (WFST) having nodes associated with states and interconnected by arcs, and to identify at least one word or word sequence hypothesis;
• identifying multiple sub-graphs on the WFST, each sub-graph having the same arrangement of multiple states and at least one arc;
• and
• propagating tokens in parallel through the sub-graphs.

A computer-implemented system of speech recognition comprising:

• at least one acoustic signal receiving unit;
• at least one processor communicatively connected to the acoustic signal receiving unit;
• at least one memory communicatively coupled to the at least one processor;
• and
• a weighted finite state transducer (WFST) decoder communicatively coupled to the processor, and to:
• form a weighted finite state transducer (WFST) having nodes associated with states and interconnected by arcs, and to identify at least one word or word sequence hypothesis;
• identify multiple sub-graphs on the WFST, each sub-graph having the same arrangement of multiple states and at least one arc;
• and
• propagate tokens in parallel through the sub-graphs.

At least one computer readable medium comprising a plurality of instructions that in response to being executed on a computing device, causes the computing device to:

• form a weighted finite state transducer (WFST) having nodes associated with states and interconnected by arcs, and to identify at least one word or word sequence hypothesis;
• identify multiple sub-graphs on the WFST, each sub-graph having the same arrangement of multiple states and at least one arc;
• and
• propagate tokens in parallel through the sub-graphs.