Finite-State Reduplication in One-Level Prosodic Morphology

Simple item page
dc.creatorWalther, Markus
dc.date2000-05-22
dc.date.accessioned2026-07-07T03:16:14Z
dc.date.available2026-07-07T03:16:14Z
dc.descriptionReduplication, a central instance of prosodic morphology, is particularly challenging for state-of-the-art computational morphology, since it involves copying of some part of a phonological string. In this paper I advocate a finite-state method that combines enriched lexical representations via intersection to implement the copying. The proposal includes a resource-conscious variant of automata and can benefit from the existence of lazy algorithms. Finally, the implementation of a complex case from Koasati is presented.
dc.description7 pages
dc.identifierhttps://arxiv.org/abs/cs/0005025
dc.identifierhttp://arxiv.org/abs/cs/0005025
dc.identifierProc. NAACL-2000, Seattle/WA, pp.296-302
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/30274
dc.subjectComputation and Language
dc.subjectI.2.7
dc.titleFinite-State Reduplication in One-Level Prosodic Morphology
dc.typetext

Files

Collections

arXiv