Skip to content

Commit 04881fa

Browse files
author
Yibing Liu
committed
tiny adjust
1 parent c26dab9 commit 04881fa

File tree

2 files changed

+2
-5
lines changed

2 files changed

+2
-5
lines changed

deep_speech_2/decoder.py

Lines changed: 2 additions & 4 deletions
Original file line numberDiff line numberDiff line change
@@ -1,4 +1,4 @@
1-
"""Contains various CTC decoder."""
1+
"""Contains various CTC decoders."""
22
from __future__ import absolute_import
33
from __future__ import division
44
from __future__ import print_function
@@ -103,7 +103,7 @@ def ctc_beam_search_decoder(probs_seq,
103103
beam_size to find many paths to one label, return beam_size labels in
104104
the descending order of probabilities. The implementation is based on Prefix
105105
Beam Search(https://arxiv.org/abs/1408.2873), and the unclear part is
106-
redesigned, need to be verified.
106+
redesigned.
107107
108108
:param probs_seq: 2-D list with length num_time_steps, each element
109109
is a list of normalized probabilities over vocabulary
@@ -262,9 +262,7 @@ def ctc_beam_search_decoder_nproc(probs_split,
262262
:type num_processes: int
263263
:return: Decoding log probabilities and result sentences in descending order.
264264
:rtype: list
265-
266265
'''
267-
268266
if num_processes is None:
269267
num_processes = multiprocessing.cpu_count()
270268
if not num_processes > 0:

deep_speech_2/infer.py

Lines changed: 0 additions & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -151,7 +151,6 @@ def infer():
151151
## decode and print
152152
# best path decode
153153
wer_sum, wer_counter = 0, 0
154-
total_time = 0.0
155154
if args.decode_method == "best_path":
156155
for i, probs in enumerate(probs_split):
157156
target_transcription = ''.join([

0 commit comments

Comments
 (0)