The upper-bound time complexity of the decoding algorithm is is the maximum size of nodes, b is the beam size, and m is the sentence length.
a single model that can extract all of them has never been studied so far.