It is proved that logical embeddings encapsulate the logical semantics of an argument, allowing for a better representation of its meaning, and that this encoding is optimal, in the sense that no logical information is lost in the process.
Abstract
We propose a new framework for machine-learning-oriented argument analysis tasks. Our proposal involves replacing traditional contextualized word embeddings used in most NLP tasks with logical embeddings, an alternative encoding that directly exploits argumentation structures. In essence, logical embeddings encapsulate the logical semantics of an argument, allowing for a better representation of its meaning. Supporting these embeddings is a mathematical logic-based similarity measure that offers a transparent notion of proximity and is guaranteed to satisfy several desirable theoretical properties that current cosine similarity-based contextualized word embeddings cannot assure. This similarity measure induces a positive semi-definite kernel on the set of arguments, enabling us to uniquely define logical embeddings using the theory of Reproducing Kernel Hilbert Spaces (RKHS). Moreover, we prove that this encoding is optimal, in the sense that no logical information is lost in the process. As with other RKHS applications, logical embeddings can be used in numerous supervised and unsupervised tasks. We provide an implementation of the method and aim to test it against literature benchmarks. Additionally, we demonstrate that logical embeddings outperform most standard embedding methods on a classification task.
Recent developments in NLP and web-scale document analysis have increasingly emphasized the importance of interpretability and contextual dependence in semantic representations. Although modern word embeddings achieve remarkable empirical performance, their semantic structure is often difficult to interpret, since meaning is encoded through latent geometric relations in high-dimensional spaces. This paper discusses an alternative conceptual framework based on explicit contextual semantic relations. Building on ideas from distributional semantics, co-occurrence analysis, and fuzzy set theory, the study revisits semantic projections and related count-based representations as interpretable directional semantic structures for semantic analysis in document corpora and web-based information environments. In this setting, several classical association measures, including PMI and related transformations, may be understood as derived from simpler conditional semantic projections. The methodology is illustrated through a comparative analysis of semantic associations related to “ChatGPT” across general web-scale data and specialized scientific repositories. Our results demonstrate that semantic projections effectively capture persistent contextual structures while remaining sensitive to corpus-specific discourse communities. The resulting perspective emphasizes interpretability, asymmetry, contextual dependence, and direct empirical meaning as central principles for semantic representation.
Mabel López-Bordao, Antonia Ferrer-Sapena, Pablo Lara-Navarra et al.· Information· 0 citations
This paper introduces diagnostic word-ablation metrics to quantify this phenomenon and proposes a data-centric solution that can alleviate the observed overcorrection in stance-aware argument retrieval and demonstrates that, for sufficiently powerful models, this approach can alleviate the observed overcorrection.
Angelo Sparacino, Francesca Toni, Adam Dejl· 0 citations
Semantic analysis has become a central challenge in natural language processing, driven by exponential growth in digitized textual data and the need for automated content processing across multiple applications including machine translation, text classification, sentiment analysis, and information retrieval. However, while semantic analysis methods are well-developed for resource-rich languages such as English, morphologically complex languages like Uzbek suffer from deficiencies in annotated corpora, lexical-semantic resources, and high-quality vector models – a gap amplified by governmental initiatives in digital economy development and national language technology advancement. This section grounds semantic analysis in the distributional semantics hypothesis principle that words exhibiting similar contexts possess similar meanings – thereby recasting the problem as a geometric challenge within continuous vector spaces. Two principal mathematical strategies are formalized: (1) prediction-based models (word2vec: CBOW/Skip-gram), which optimize context prediction objectives, and (2) count-based models (GloVe), which leverage global co-occurrence statistics through matrix factorization. Both project high-dimensional word co-occurrence relationships into low-dimensional dense vector spaces, enabling semantic analogy representation. For resource-scarce languages like Uzbek, cross-lingual embedding alignment (Procrustes optimization) enables semantic knowledge transfer from resource-rich languages, facilitating shared semantic spaces across the Turkic language family. The section concludes with formal problem specification: given vocabulary V and corpus C, semantic analysis is formalized as (1) a mapping problem preserving distributional properties, (2) an optimization problem minimizing loss through gradient-based methods, and (3) an evaluation problem assessing quality through semantic similarity, analogy, and downstream NLP task performance.
D. Akhmedjanova· Международный Журнал Теорети...· 0 citations
When it comes to generating vector representations of words, current language models are achieving high-quality results. However, what is not known is the extent to which knowledge about semantic relations is represented in the geometry of the semantic spaces created in this way. In order to answer this question, we study the relation geometry of such semantic spaces from three perspectives. We first examine whether words standing in a particular relation to a target word~(called relata) occupy the same region in semantic space, and whether the regions corresponding to different relations are distinct from each other. We then verify to what extent semantic spaces reflect certain well-known properties of relations, such as symmetry, asymmetry, and transitivity. Finally, we consider which information about the target words and relata is more important for relation geometry: their surface forms, or their contexts. We conduct experiments on six semantic relations using causal, masked, and diffusion language models. The results show that relata in asymmetric relations relatively clearly occupy a distinct region in semantic space. Asymmetric relations'properties are only moderately well encoded in the semantic space, yet better than those of symmetric ones. Furthermore, when considering the question which information source has the strongest impact on results amongst the models we evaluated, we find that lexical information tends to be more important for the causal language model, whereas contextual information is more important for the masked and diffusion language models. Our results empirically show that relation geometry is not equally well-represented for all relations in semantic space, suggesting that there is a difference in how well semantic relations might be learned from distributional information alone.
Zhihan Cao, Hiroaki Yamada, Simone Teufel et al.· 0 citations