TASK DEFINITION: In this task you are given a sentence pair from wikipedia that have high lexical overlap. If the sentences have the same meaning and are just paraphrases of each other label them as "Paraphrase" , if not label them as "Not paraphrase". The two sentences are seperated by a new line.
PROBLEM: She began the practice of grouping and teaching students with the same language problem together .
She began the practice of teaching and grouping students with the same language problem together .

SOLUTION: Not paraphrase

PROBLEM: The most surviving Latin literature is classical Latin from the 2nd century BC to the first century AD .
The most surviving Latin literature is classical Latin from the 1st century BC to 2nd century AD .

SOLUTION: Not paraphrase

PROBLEM: Generalized Turing machines and simple inductive turing machines are two classes of super-recursive algorithms that come closest to the recursive algorithms .
Generalized Turing machines and super-recursive Turing machines are two classes of simple inductive algorithms that are the closest to recursive algorithms .

SOLUTION:
Not paraphrase