Using finite-state machines to automatically scan Ancient Greek hexameter.

This article presents a fully automatic approach to the scansion of Ancient Greek hexameter verse. In particular, the article describes an algorithm that uses deterministic finite-state automata and local linguistic rules to implement a targeted search for valid spondeus patterns and, in addition, a...

Descripción completa

Detalles Bibliográficos
Publicado en:Digital Scholarship in the Humanities Vol. 37; no. 1; pp. 242 - 254
Autores principales: Schumann, Anne-Kathrin, Beierle, Christoph, Blößner, Norbert
Formato: Artículo
Publicado: Oxford University Press / USA Apr2022
Materias:
Acceso en línea:Ver este registro en EBSCOhost
Descripción
Sumario:This article presents a fully automatic approach to the scansion of Ancient Greek hexameter verse. In particular, the article describes an algorithm that uses deterministic finite-state automata and local linguistic rules to implement a targeted search for valid spondeus patterns and, in addition, a weighted finite-state transducer to correct and complete partial analyses and to reject invalid candidates. The article also details the results of an empirical evaluation of the annotation quality resulting from this approach on hand-annotated data. It is shown that a finite-state approach provides quick and linguistically sound analyses of hexameter verses as well as an efficient formalization of linguistic knowledge. The project code is available online.