To resolve the N-1 mismatch problem, we propose a template rewriting algorithm, which can rewrite a complicated expression into its simpler form.
we rewrite sentences based on a set of paraphrase template pairs P = {(t i1 , t i2 )|i = 1, 2, ..., n}, where each template t  is a sentence with an argument slot $y, and t i1 and t i2 are paraphrases.