Finite-State Non-Concatenative Morphotactics

Details Finite-State Non-Concatenative Morphotactics Finite-State Non-Concatenative Morphotactics

2000-06-30

arxiv.org/abs/cs/0006044v1

Computer Science

Computation and Language

SIGPHON-2000, Proceedings of the Fifth Workshop of the ACL Special Interest Group in Computational Phonology, p. 1-12. Aug. 6,

Scientific paper

Finite-state morphology in the general tradition of the Two-Level and Xerox implementations has proved very successful in the production of robust morphological analyzer-generators, including many large-scale commercial systems. However, it has long been recognized that these implementations have serious limitations in handling non-concatenative phenomena. We describe a new technique for constructing finite-state transducers that involves reapplying the regular-expression compiler to its own output. Implemented in an algorithm called compile-replace, this technique has proved useful for handling non-concatenative phenomena; and we demonstrate it on Malay full-stem reduplication and Arabic stem interdigitation.

Affiliated with

Also associated with

No associations

Rating

Finite-State Non-Concatenative Morphotactics 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 Non-Concatenative Morphotactics, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Finite-State Non-Concatenative Morphotactics will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-287929