Finite-State Reduplication in One-Level Prosodic Morphology
<|reference_start|>Finite-State Reduplication in One-Level Prosodic Morphology: Reduplication, 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.<|reference_end|>
@article{walther2000finite-state,
    title={Finite-State Reduplication in One-Level Prosodic Morphology},
    author={Markus Walther (University of Marburg)},
    journal={Proc. NAACL-2000, Seattle/WA, pp.296-302},
    year={2000},
    archivePrefix={arXiv},
    eprint={cs/0005025},
    primaryClass={cs.CL}
}