This paper presents a new approach to the ancient scripts decipherment problem based on combinatorial optimisation and coupled simulated annealing, an advanced non-convex optimisation procedure. Solutions are encoded by using k-permutations allowing for null, one-to-many, and many-to-one mappings between signs. The proposed system is able to produce enhanced results in cognate identification when compared to the state-of-the-art systems on standard evaluation benchmarks used in literature.
Decipherment of Lost Ancient Scripts as Combinatorial Optimisation using Coupled Simulated Annealing / Tamburini F.. - ELETTRONICO. - (2023), pp. 82-91. (Intervento presentato al convegno Workshop on Computation and Written Language (CAWL 2023) tenutosi a Toronto, Canada nel 14 July 2023) [10.18653/v1/2023.cawl-1.10].
Decipherment of Lost Ancient Scripts as Combinatorial Optimisation using Coupled Simulated Annealing
Tamburini F.
2023
Abstract
This paper presents a new approach to the ancient scripts decipherment problem based on combinatorial optimisation and coupled simulated annealing, an advanced non-convex optimisation procedure. Solutions are encoded by using k-permutations allowing for null, one-to-many, and many-to-one mappings between signs. The proposed system is able to produce enhanced results in cognate identification when compared to the state-of-the-art systems on standard evaluation benchmarks used in literature.I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
