For most sentence models including TBCNN, the overall complexity is at least O(n).
an efficient matching approach is still important, especially to retrieval-and-reranking systems (Yan et al., 2016;Li et al., 2016).