The adapted Lesk Algorithm uses context instead of just one single word. The context is defined as k words around the word. All the senses of all the words around the given word identify their glosses. These glosses are compared with different glosses of all the senses for that particular word. The overall score for the word is calculated using a method (as given in the SLP 2nd Edition) The best sense is the one with the max overall score.

Some of the question lengths are less than 10 characters, those pairs have been left out.

q1id and q2id have been left out because they don't indicate anything, plus for the same question at different places, they are different.

Some labels do not seem true, especially for the duplicate ones. I decided to rely on the labels and defer pruning due to hard manual effort.

Semantic Relations - Find Semantic similarity between two sentences.

Lexical Chains

Entailment using Logic Representation of text (Extremely hard)

Technical Paper Style

Mention References

Write Logically

Title

Name

Abstract (100-200 words)

Introduction (problem description)

Related Work (by others, if any)

Approach (Justify it)

Implementation

• Data

• Software Architecture

Experiments and Results

Conclusions (Assessment of the complete project, your take on the whole project)

References