MétaCan
Menu
Back to cohort
Record W4414087786 · doi:10.7152/nasko.v7i1.95650

Cosine Similarity Indexing of Word Embeddings Using Knowledge Organization Systems

2025· article· en· W4414087786 on OpenAlexaff
John Kausch

Bibliographic record

VenueNASKO · 2025
Typearticle
Languageen
FieldComputer Science
TopicNatural Language Processing Techniques
Canadian institutionsWestern University
Fundersnot available
KeywordsSearch engine indexingVector space modelCosine similarityWord (group theory)Similarity (geometry)Latent semantic analysisKnowledge organizationContext (archaeology)Probabilistic latent semantic analysis

Abstract

fetched live from OpenAlex

This paper proposes a new technique for cosine similarity indexing in the era of large language models (LLMs). It investigates how knowledge organization systems (KOS) can be used to index the latent spaces which LLMs produce. A latent space is a multidimensional feature space used by a model to encode the context of data items. In the case of an LLM, a typical latent space is a word embedding, which gives every word a “position” in a multidimensional feature space, where the features are opaque, and not human-readable. This work asks: can indexing such latent spaces with KOSs help make LLMs more explainable? It builds on previous work in latent semantic indexing for information retrieval models to see if similar techniques can be used to bridge KOSs and LLMs. It also investigates how this method can be applied to improving the performance of multilingual information retrieval. A cross-lingual ontology (called Horapollo) is used to index two latent spaces containing Wikipedia articles written in English and Arabic. Then, the distance between equivalent articles in both spaces are taken, raising questions about the use of KOSs for multilingual and transdisciplinary information retrieval tasks in the era of semantic search.

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.002
metaresearch head score (Gemma)0.015
Version: metacan-v3-hybrid-931329e0061cValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.008
Threshold uncertainty score0.011

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.015
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0080.011
Science and technology studies0.0010.001
Scholarly communication0.0030.008
Open science0.0010.003
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0030.001

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.014
GPT teacher head0.304
Teacher spread0.290 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations0
Published2025
Admission routes1
Has abstractyes

Explore more

Same venueNASKOSame topicNatural Language Processing TechniquesFrench-language works237,207