However, finding the highest-scoring label sequence is a computationally hard problem, since the conversation-level RNN does not lend itself to dynamic programming.
we employ a greedy decoding approach, where, going left-toright, at each step we choose the y t with the highest probability in the local DA distribution.