TASK DEFINITION: This task is about classifying the similarity of two sentences. The sentences can be classified as (a) SIMILAR - similar to each other, and (b) DISSIMILAR - not similar to each other. Sentences that have the same RDF relationship in terms of [subject, predicate, object] are similar to each other. The input is a list of two sentences and the output is either SIMILAR or DISSIMILAR.
PROBLEM: ["In City Centre, the Green Man offers British food at an inexpensive price.   It's family friendly and near All Bar One.", "Near All Bar One in City Centre, the Green Man offers British food at an inexpensive price.  It's family friendly."]

SOLUTION: SIMILAR

PROBLEM: ['Abhandlungen aus dem Mathematischen Seminar der Universität Hamburg can be located by the ISSN number "0025-5858" and has the abbreviation Abh. Math. Semin. Univ. Hambg.', 'The ISSN number for Abhandlungen aus dem Mathematischen Seminar der Universitat Hamburg (abbreviating to Abh. Math. Semin. Univ. Hambg.) is 0025-5858.']

SOLUTION: SIMILAR

PROBLEM: ["The fourth edition women's winner is Karolina Szabó (HUN)", 'The Vaults is a friendly-friendly restaurant serving moderately-priced traditional British food.']

SOLUTION:
DISSIMILAR

