One of the most stubborn problems in natural language processing has just received a fresh attack. A researcher at the Software Competence Center Hagenberg in Austria has developed a new context-aware approach to measuring semantic similarity, designed to help machines determine which meaning of an ambiguous word applies in a given sentence without any annotated training data. The work, published in the journal Applied Intelligence, addresses a challenge that has haunted computational linguistics for decades: the fact that most common words carry multiple senses, and that choosing the right one is often essential for a machine to understand language at all.
Word sense disambiguation, the technical term for this task, is deceptively difficult. Consider a word like bank. In one sentence it may refer to a financial institution, in another to the edge of a river, and in yet another to an airplane tilting during a turn. Human readers resolve these ambiguities effortlessly by drawing on context, but computers have historically struggled. Supervised machine learning systems can perform this task well, but they depend on large collections of text in which every ambiguous word has been manually labeled with its correct sense. Creating such annotated datasets is expensive, slow, and often impractical, particularly for languages and specialized domains where linguistic resources are scarce.
This data scarcity is precisely the bottleneck that motivated the new research. Unsupervised word sense disambiguation methods have been developed specifically to overcome the lack of annotated data, relying instead on lexical knowledge bases, corpus statistics, and semantic similarity measures to make sense selections. The trouble, according to the study, is that many existing unsupervised techniques treat similarity measurement as a largely context-independent operation. They compare a word in isolation with candidate dictionary senses, often drawn from resources such as WordNet, and pick the closest match. What they frequently fail to do is fold the surrounding sentence into the comparison in a flexible, principled way.
The new approach tackles this gap directly. It provides a flexible mechanism for incorporating contextual information into the similarity measurement process, so that the meaning assigned to a word is conditioned not merely on the word itself but on the linguistic company it keeps. In essence, the method builds a representation of the context in which an ambiguous word appears and then evaluates how well each candidate sense fits within that representation. The candidate sense whose semantic profile aligns best with the contextual signal is selected as the intended meaning. This design reflects a long-standing insight from cognitive science and linguistics, famously formalized in work on the contextual correlates of semantic similarity dating back to the early 1990s: the meaning of a word is inseparable from the contexts in which it is used.
Technically, the approach sits at the intersection of several research traditions. Ontology-based semantic similarity measures, which compute the closeness of two concepts within a hierarchical knowledge structure, have been refined over decades through information-content formulations such as those introduced by Resnik, and by refinements from Jiang, Conrath, and Lin. Corpus-based approaches, from latent semantic analysis in the 1990s through modern word embeddings such as Word2Vec and fastText, capture distributional regularities in vast text collections. More recently, contextualized language models like BERT have produced dynamic word representations that change depending on the sentence. The new method does not simply discard this accumulated toolkit; rather, it provides a unifying framework in which contextual information can be injected into the similarity computation itself, allowing the strengths of different similarity signals to be combined adaptively for each disambiguation decision.
The author of the study, Jorge Martinez-Gil, has a track record in this area, including a comprehensive review of stacking methods for semantic similarity measurement published in Machine Learning with Applications. Stacking, in the machine learning sense, refers to combining the outputs of multiple models to produce a stronger overall prediction. That background is visible in the design philosophy of the current work: rather than betting everything on a single similarity formula, the framework accommodates multiple sources of evidence and allows context to modulate how heavily each source should count. The result is a system that behaves less like a rigid calculator of dictionary distances and more like a flexible reasoner weighing evidence from the sentence at hand.
To find out whether the idea actually works, the researcher evaluated the method on a popular benchmark dataset for word sense disambiguation, comparing it against state-of-the-art unsupervised techniques. The experimental results indicate that the approach substantially enhances disambiguation accuracy and surpasses the performance of several existing methods. That margin matters. In unsupervised settings, where no labeled examples guide the model, even modest percentage improvements in accuracy can translate into noticeably better downstream behavior in applications such as machine translation, information retrieval, question answering, and text summarization, all of which degrade when ambiguous words are assigned the wrong sense.
The broader significance of the finding lies in what it says about where progress in disambiguation is likely to come from. Surveys of the field, including influential overviews by Navigli and colleagues, have documented the steady evolution from knowledge-based methods through neural embeddings to transformer-based systems. Yet even large language models, which have absorbed enormous amounts of text, are not immune to ambiguity errors, and recent quantitative evaluations of their performance on word sense disambiguation show mixed results. The new study argues that explicitly integrating contextual information into semantic similarity measurement, rather than hoping that scale alone will resolve ambiguity, is a reliable path to better performance in settings where supervision is unavailable. It is a reminder that sometimes a targeted architectural insight can outperform brute-force scaling.
The practical implications extend well beyond English. Because the method does not require annotated corpora, it is attractive for under-resourced languages, a domain where researchers have previously built unsupervised disambiguation systems precisely because labeled data simply does not exist. Knowledge engineers, who maintain ontologies and knowledge-based systems that machines rely on for reasoning, also stand to benefit, since accurate sense resolution improves the quality of the semantic relationships such systems encode. The article lists natural language processing, knowledge engineering, and semantic similarity measurement among its core subjects, underscoring this interdisciplinary reach.
Transparency and reproducibility were also part of the design. All the data and source code needed to reproduce the research have been made publicly available in a GitHub repository, allowing other researchers to verify the benchmark results, experiment with alternative similarity measures, and adapt the framework to new languages and domains. The research was funded by the Austrian Federal Ministry for Climate Action, Environment, Energy, Mobility, Innovation, and Technology, the Federal Ministry for Digital and Economic Affairs, and the State of Upper Austria, through the COMET Competence Centers for Excellent Technologies Programme. As machines are asked to read, translate, and summarize an ever-growing volume of human text, work like this suggests that the path to genuine language understanding may run not through bigger models alone, but through smarter, context-sensitive ways of asking a deceptively simple question: what does this word mean, right here, in this sentence?
Subject of Research: Context-aware semantic similarity measurement for unsupervised word sense disambiguation in natural language processing
Article Title: Context-aware semantic similarity measurement for unsupervised word sense disambiguation
Article References: Context-aware semantic similarity measurement for unsupervised word sense disambiguation. (n.d.). https://doi.org/10.1007/s10489-026-07492-8
Image Credits: AI Generated
DOI: 10.1007/s10489-026-07492-8
Keywords: word sense disambiguation, semantic similarity, natural language processing, unsupervised learning, context-aware computing, knowledge engineering, ontologies, machine learning, word embeddings, computational linguistics, Applied Intelligence, Jorge Martinez-Gil
Cite Scienmag News
Denise Maddox. (September 22, 2026). New Context-Aware Method Helps Machines Understand What Words Really Mean. Scienmag. https://scienmag.com/new-context-aware-method-helps-machines-understand-what-words-really-mean/
Denise Maddox. "New Context-Aware Method Helps Machines Understand What Words Really Mean." Scienmag, 22 September 2026, https://scienmag.com/new-context-aware-method-helps-machines-understand-what-words-really-mean/. Accessed 22 September 2026.
Denise Maddox. "New Context-Aware Method Helps Machines Understand What Words Really Mean." Scienmag. September 22, 2026. https://scienmag.com/new-context-aware-method-helps-machines-understand-what-words-really-mean/

