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: ['Broxbourne Station has operator Uno.', 'Newport Beach is a city in Orange County.']

SOLUTION: DISSIMILAR

PROBLEM: ['The Waterman serves British fare at reasonable prices. Families welcome.', 'The Waterman serves English fare at reasonable prices. Families welcome.']

SOLUTION: SIMILAR

PROBLEM: ['The Vaults is family friendly and serves cheap French food', 'The Vaults serves cheap French food and is family friendly']

SOLUTION:
SIMILAR