The Theoretical Background of (Dis) similarity Algorithms: Analyzing the Voynich Manuscript as an Application

This paper gathers, in self-contained form, the mathematical background of tagged sets, a generalization of fuzzy sets, and of the (dis) similarity measures built on them: inward products, scalar products and norms of arbitrary order, Minkowskian metric vectors, Gram matrices and hypermatrices, and collective distances and similarity indices. As an application, the text of the Voynich manuscript is compared with the Universal Declaration of Human Rights in 62 languages and orthographies, with medieval Catalan, Castilian, and Latin texts, and with ciphers and text generators of known nature. At the character level, the manuscript lies more than eight standard deviations from the nearest reference text, although distance alone does not single it out, since a natural language in an unusual orthography can lie as far. The anomaly is located inside the word, in the information carried by its fourth and fifth characters, and a slot-grammar generator fitted to the manuscript reproduces most of it, far better than the same construction reproduces any language tested. At the word level, the vocabulary statistics of the manuscript are those of a language, and its adjacent words carry as little mutual information as those of the sparsest Latin technical prose measured. The analysis neither deciphers the manuscript nor proves it meaningless; it characterizes the text as more compatible with a word-building procedure than with a simply enciphered language.

Authors

Institutions

Publication Details

Journal
Qeios
Published
2026-11-17
DOI
https://doi.org/10.32388/dliilj
Primary Topic
Digital Humanities and Scholarship
Type
preprint
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
NOV
preprint

The Theoretical Background of (Dis) similarity Algorithms: Analyzing the Voynich Manuscript as an Application

Ramon Carbó‐Dorca
3 links
Qeios
Digital Humanities and Scholarship
preprint

The Theoretical Background of (Dis) similarity Algorithms: Analyzing the Voynich Manuscript as an Application

Ramon Carbó‐Dorca
preprint en

Abstract

This paper gathers, in self-contained form, the mathematical background of tagged sets, a generalization of fuzzy sets, and of the (dis) similarity measures built on them: inward products, scalar products and norms of arbitrary order, Minkowskian metric vectors, Gram matrices and hypermatrices, and collective distances and similarity indices. As an application, the text of the Voynich manuscript is compared with the Universal Declaration of Human Rights in 62 languages and orthographies, with medieval Catalan, Castilian, and Latin texts, and with ciphers and text generators of known nature. At the character level, the manuscript lies more than eight standard deviations from the nearest reference text, although distance alone does not single it out, since a natural language in an unusual orthography can lie as far. The anomaly is located inside the word, in the information carried by its fourth and fifth characters, and a slot-grammar generator fitted to the manuscript reproduces most of it, far better than the same construction reproduces any language tested. At the word level, the vocabulary statistics of the manuscript are those of a language, and its adjacent words carry as little mutual information as those of the sparsest Latin technical prose measured. The analysis neither deciphers the manuscript nor proves it meaningless; it characterizes the text as more compatible with a word-building procedure than with a simply enciphered language.

Qeios
Universitat de Girona (ES)
Digital Humanities and Scholarship
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

Laika access coming soon