Rethinking Word Similarity: Semantic Similarity through Classification Confusion

• URL: http://arxiv.org/abs/2502.05704v1
• Date: Sat, 08 Feb 2025 21:55:38 GMT
• Title: Rethinking Word Similarity: Semantic Similarity through Classification Confusion
• Authors: Kaitlyn Zhou, Haishan Gao, Sarah Chen, Dan Edelstein, Dan Jurafsky, Chen Shani,
• Abstract summary: We propose a new measure of similarity, Word Confusion, that reframes semantic similarity in terms of feature-based classification confusion. Our method is comparable to cosine similarity in matching human similarity judgments across several datasets. We demonstrate our model's ability to make use of dynamic features by applying it to test a hypothesis about changes in the 18th C. meaning of the French word "revolution"
• Score: 31.12253159483973
• License:
• Abstract: Word similarity has many applications to social science and cultural analytics tasks like measuring meaning change over time and making sense of contested terms. Yet traditional similarity methods based on cosine similarity between word embeddings cannot capture the context-dependent, asymmetrical, polysemous nature of semantic similarity. We propose a new measure of similarity, Word Confusion, that reframes semantic similarity in terms of feature-based classification confusion. Word Confusion is inspired by Tversky's suggestion that similarity features be chosen dynamically. Here we train a classifier to map contextual embeddings to word identities and use the classifier confusion (the probability of choosing a confounding word c instead of the correct target word t) as a measure of the similarity of c and t. The set of potential confounding words acts as the chosen features. Our method is comparable to cosine similarity in matching human similarity judgments across several datasets (MEN, WirdSim353, and SimLex), and can measure similarity using predetermined features of interest. We demonstrate our model's ability to make use of dynamic features by applying it to test a hypothesis about changes in the 18th C. meaning of the French word "revolution" from popular to state action during the French Revolution. We hope this reimagining of semantic similarity will inspire the development of new tools that better capture the multi-faceted and dynamic nature of language, advancing the fields of computational social science and cultural analytics and beyond.

Related papers

• Conjuring Semantic Similarity [59.18714889874088]
  The semantic similarity between two textual expressions measures the distance between their latent'meaning' We propose a novel approach whereby the semantic similarity among textual expressions is based not on other expressions they can be rephrased as, but rather based on the imagery they evoke. Our method contributes a novel perspective on semantic similarity that not only aligns with human-annotated scores, but also opens up new avenues for the evaluation of text-conditioned generative models.
  arXiv  Detail & Related papers  (2024-10-21T18:51:34Z)
• Relational Sentence Embedding for Flexible Semantic Matching [86.21393054423355]
  We present Sentence Embedding (RSE), a new paradigm to discover further the potential of sentence embeddings. RSE is effective and flexible in modeling sentence relations and outperforms a series of state-of-the-art embedding methods.
  arXiv  Detail & Related papers  (2022-12-17T05:25:17Z)
• Evaluation of taxonomic and neural embedding methods for calculating semantic similarity [0.0]
  We study the mechanisms between taxonomic and distributional similarity measures. We find that taxonomic similarity measures can depend on the shortest path length as a prime factor to predict semantic similarity. The synergy of retrofitting neural embeddings with concept relations in similarity prediction may indicate a new trend to leverage knowledge bases on transfer learning.
  arXiv  Detail & Related papers  (2022-09-30T02:54:21Z)
• Identifying Ambiguous Similarity Conditions via Semantic Matching [49.06931755266372]
  We introduce Weakly Supervised Conditional Similarity Learning (WS-CSL) WS-CSL learns multiple embeddings to match semantic conditions without explicit condition labels such as "can fly" We propose the Distance Induced Semantic COndition VERification Network (DiscoverNet), which characterizes the instance-instance and triplets-condition relations in a "decompose-and-fuse" manner.
  arXiv  Detail & Related papers  (2022-04-08T13:15:55Z)
• Comparing in context: Improving cosine similarity measures with a metric tensor [0.0]
  Cosine similarity is a widely used measure of the relatedness of pre-trained word embeddings, trained on a language modeling goal. We propose instead the use of an extended cosine similarity measure to improve performance on that task, with gains in interpretability. We learn contextualized metrics and compare the results with the baseline values obtained using the standard cosine similarity measure, which consistently shows improvement. We also train a contextualized similarity measure for both SimLex-999 and WordSim-353, comparing the results with the corresponding baselines, and using these datasets as independent test sets for the all-context similarity measure learned on
  arXiv  Detail & Related papers  (2022-03-28T18:04:26Z)
• Attributable Visual Similarity Learning [90.69718495533144]
  This paper proposes an attributable visual similarity learning (AVSL) framework for a more accurate and explainable similarity measure between images. Motivated by the human semantic similarity cognition, we propose a generalized similarity learning paradigm to represent the similarity between two images with a graph. Experiments on the CUB-200-2011, Cars196, and Stanford Online Products datasets demonstrate significant improvements over existing deep similarity learning methods.
  arXiv  Detail & Related papers  (2022-03-28T17:35:31Z)
• MNet-Sim: A Multi-layered Semantic Similarity Network to Evaluate Sentence Similarity [0.0]
  Similarity is a comparative-subjective measure that varies with the domain within which it is considered. This paper presents a multi-layered semantic similarity network model built upon multiple similarity measures. It is shown to have demonstrated better performance scores in assessing sentence similarity.
  arXiv  Detail & Related papers  (2021-11-09T20:43:18Z)
• Patterns of Lexical Ambiguity in Contextualised Language Models [9.747449805791092]
  We introduce an extended, human-annotated dataset of graded word sense similarity and co-predication. Both types of human judgements indicate that the similarity of polysemic interpretations falls in a continuum between identity of meaning and homonymy. Our dataset appears to capture a substantial part of the complexity of lexical ambiguity, and can provide a realistic test bed for contextualised embeddings.
  arXiv  Detail & Related papers  (2021-09-27T13:11:44Z)
• Fake it Till You Make it: Self-Supervised Semantic Shifts for Monolingual Word Embedding Tasks [58.87961226278285]
  We propose a self-supervised approach to model lexical semantic change. We show that our method can be used for the detection of semantic change with any alignment method. We illustrate the utility of our techniques using experimental results on three different datasets.
  arXiv  Detail & Related papers  (2021-01-30T18:59:43Z)
• Comparative Analysis of Word Embeddings for Capturing Word Similarities [0.0]
  Distributed language representation has become the most widely used technique for language representation in various natural language processing tasks. Most of the natural language processing models that are based on deep learning techniques use already pre-trained distributed word representations, commonly called word embeddings. selecting the appropriate word embeddings is a perplexing task since the projected embedding space is not intuitive to humans.
  arXiv  Detail & Related papers  (2020-05-08T01:16:03Z)
• Multiplex Word Embeddings for Selectional Preference Acquisition [70.33531759861111]
  We propose a multiplex word embedding model, which can be easily extended according to various relations among words. Our model can effectively distinguish words with respect to different relations without introducing unnecessary sparseness.
  arXiv  Detail & Related papers  (2020-01-09T04:47:14Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.