@@ -175,7 +175,7 @@ def _remove_layers_from_spec(nn_spec, layers_to_delete):
175175
176176 def _get_disconnected_layers_rec (nn_spec ):
177177 """
178- - Iteraters over layers in bottom-up fashion
178+ - Iterates over layers in bottom-up fashion
179179 - Collect layers if it's output is not being used (marks and does lazy deletion)
180180 - Recursively iterates over NN Spec if layer is Loop or Branch
181181 """
@@ -245,7 +245,7 @@ def _decrease_input_degree(layer):
245245 and len (else_layers_to_delete ) == total_else_layers
246246 ):
247247 # If both branches are empty after dead-layer elimination
248- # remove branch layer altogehter
248+ # remove branch layer altogether
249249 layers_to_delete .append (_layer )
250250 _decrease_input_degree (_layer )
251251 continue
@@ -422,7 +422,7 @@ def solve_dp(layers):
422422 For example, if sol_num[10] = 5, this means after index 10, we can at most remove 5 nodes.
423423 sol_bt[i] keeps the first starting point of identity sequence which results in the
424424 optimal solution after index i.
425- For example, if sol_num[10] = 12, means that in order to get rid of the maxium number of
425+ For example, if sol_num[10] = 12, means that in order to get rid of the maximum number of
426426 nodes after 10, the first starting point is index 12.
427427 After construct sol_num and sol_bt by dynamic programming, we backtrack for the optimal
428428 solution using sol_bt.
0 commit comments