Computer Science – Computation and Language
Scientific paper
2000-05-22
Proc. NAACL-2000, Seattle/WA, pp.296-302
Computer Science
Computation and Language
7 pages
Scientific paper
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.
No associations
LandOfFree
Finite-State Reduplication in One-Level Prosodic Morphology does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Finite-State Reduplication in One-Level Prosodic Morphology, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite-State Reduplication in One-Level Prosodic Morphology will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-82718