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.
Tamburini Fabio (2023). Decipherment of Lost Ancient Scripts as Combinatorial Optimisation using Coupled Simulated Annealing. Stroudsburg, PA 18360 : Association for Computational Linguistics [10.18653/v1/2023.cawl-1.10].
Decipherment of Lost Ancient Scripts as Combinatorial Optimisation using Coupled Simulated Annealing
Tamburini Fabio
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.File | Dimensione | Formato | |
---|---|---|---|
2023.cawl-1.10.pdf
accesso aperto
Descrizione: Contributo
Tipo:
Versione (PDF) editoriale
Licenza:
Licenza per Accesso Aperto. Creative Commons Attribuzione (CCBY)
Dimensione
308.62 kB
Formato
Adobe PDF
|
308.62 kB | Adobe PDF | Visualizza/Apri |
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.