 We show that best-first beam search can be used with length normalization and mutual information decoding , among other rescoring functions . Lastly, we propose a memory-reduced variant of best-first beam search , which has a similar  search bias in terms of downstream performance, but runs in a fraction of the time.
<clarity>  We show that best-first beam search can be used with length normalization and mutual information decoding , among other rescoring functions . Lastly, we propose a memory-reduced variant of best-first beam search , which has a similar  search bias in terms of downstream performance, but runs in a fraction of the time.
 We show that best-first beam search can be used with length normalization and mutual information decoding . Lastly, we propose a memory-reduced variant of best-first beam search , which has a similar search bias in terms of downstream performance, but runs in a fraction of the time.