In this paper, we propose a model of deep fusion LSTMs (DF-LSTMs) to model the strong interaction of text pair in a recursive matching way.
dF-LSTMs consist of two interdependent LSTMs, each of which models a sequence under the influence of another.