The linguistics of the Voynich manuscript

CL Bowern, L Lindemann - Annual Review of Linguistics, 2021 - annualreviews.org
The Voynich Manuscript is a fifteenth-century illustrated cipher manuscript. In this overview
of recent approaches to the Voynich Manuscript, we summarize and evaluate current work …

Paragraph-based representation of texts: A complex networks approach

HF de Arruda, VQ Marinho, LF Costa… - Information Processing & …, 2019 - Elsevier
An interesting model to represent texts as a graph (also called network) is the word
adjacency (co-occurrence) representation, which is known to capture mainly syntactical …

Decipherment of historical manuscript images

X Yin, N Aldarrab, B Megyesi… - … Conference on Document …, 2019 - ieeexplore.ieee.org
European libraries and archives are filled with enciphered manuscripts from the early
modern period. These include military and diplomatic correspondence, records of secret …

Can Sequence-to-Sequence Models Crack Substitution Ciphers?

N Aldarrab, J May - arXiv preprint arXiv:2012.15229, 2020 - arxiv.org
Decipherment of historical ciphers is a challenging problem. The language of the target
plaintext might be unknown, and ciphertext can have a lot of noise. State-of-the-art …

Sign clustering and topic extraction in Proto-Elamite

L Born, K Kelley, N Kambhatla, C Chen… - Proceedings of the 3rd …, 2019 - aclanthology.org
We describe a first attempt at using techniques from computational linguistics to analyze the
undeciphered proto-Elamite script. Using hierarchical clustering, n-gram frequencies, and …

[图书][B] Dijital Psikolojik Devrim

M Dağıtmaç, Ş Ekmen - 2019 - books.google.com
Dijital Göçmenler Kimler? Dijital Sağırlık Değişen Suç Tanımı! Dijital Kölelik Gerçeklik
İlkesinin Yitimi Dijital Zombilik Yapay Zeka ve Aile Katil Robotları Durdurun! Dijital …

Decipherment as regression: Solving historical substitution ciphers by learning symbol recurrence relations

N Kambhatla, L Born, A Sarkar - Findings of the Association for …, 2023 - aclanthology.org
Solving substitution ciphers involves mapping sequences of cipher symbols to fluent text in a
target language. This has conventionally been formulated as a search problem, to find the …

An exact no free lunch theorem for community detection

AD McCarthy, T Chen, S Ebner - International Conference on Complex …, 2019 - Springer
A precondition for a No Free Lunch theorem is evaluation with a loss function which does
not assume a priori superiority of some outputs over others. A previous result for community …

Metrics matter in community detection

AD McCarthy, T Chen, R Rudinger… - … Conference on Complex …, 2019 - Springer
We critically evaluate normalized mutual information (NMI) as an evaluation metric for
community detection. NMI exaggerates the leximin method's performance on weak …

A hidden Markov model for the linguistic analysis of the Voynich manuscript

L Acedo - Mathematical and Computational Applications, 2019 - mdpi.com
Hidden Markov models are a very useful tool in the modeling of time series and any
sequence of data. In particular, they have been successfully applied to the field of …