资源论文Aiming beyond the Obvious: Identifying Non-Obvious Cases in Semantic Similarity Datasets

Aiming beyond the Obvious: Identifying Non-Obvious Cases in Semantic Similarity Datasets

2019-09-19 | |  87 |   37 |   0 0 0
Abstract Existing datasets for scoring text pairs in terms of semantic similarity contain instances whose resolution differs according to the degree of difficulty. This paper proposes to distinguish obvious from non-obvious text pairs based on superficial lexical overlap and ground-truth labels. We characterise existing datasets in terms of containing difficult cases and find that recently proposed models struggle to capture the non-obvious cases of semantic similarity. We describe metrics that emphasise cases of similarity which require more complex inference and propose that these are used for evaluating systems for semantic similarity.

上一篇:A2N: Attending to Neighbors for Knowledge Graph Inference

下一篇:Assessing the Ability of Self-Attention Networks to Learn Word Order

用户评价
全部评价

热门资源

  • Learning to Predi...

    Much of model-based reinforcement learning invo...

  • Stratified Strate...

    In this paper we introduce Stratified Strategy ...

  • The Variational S...

    Unlike traditional images which do not offer in...

  • A Mathematical Mo...

    Direct democracy, where each voter casts one vo...

  • Rating-Boosted La...

    The performance of a recommendation system reli...