Logic Constrained Pointer Networks for Interpretable Textual Similarity

15 Jul 2020Subhadeep MajiRohan KumarManish BansalKalyani RoyPawan Goyal

Systematically discovering semantic relationships in text is an important and extensively studied area in Natural Language Processing, with various tasks such as entailment, semantic similarity, etc. Decomposability of sentence-level scores via subsequence alignments has been proposed as a way to make models more interpretable... (read more)

PDF Abstract

Results from the Paper

  Submit results from this paper to get state-of-the-art GitHub badges and help the community compare results to other papers.

Methods used in the Paper