Hypotheses are called complete if they end with < /s > and partial if they do not.
beam search is the ubiquitous decoding algorithm for NMT, but it is prone to search errors as the number of active hypotheses is limited by n. beam search never compares partial hypotheses of different lengths with each other.