Computing Declarative Prosodic Morphology

Details Computing Declarative Prosodic Morphology Computing Declarative Prosodic Morphology

1998-09-25

arxiv.org/abs/cs/9809107v1

Proceedings of SIGPHON'98, pp. 11-20 (COLING-ACL'98 Post-Conference Workshop on The Computation of Phonological Constraints)

Computer Science

Computation and Language

10 pages

Scientific paper

This paper describes a computational, declarative approach to prosodic morphology that uses inviolable constraints to denote small finite candidate sets which are filtered by a restrictive incremental optimization mechanism. The new approach is illustrated with an implemented fragment of Modern Hebrew verbs couched in MicroCUF, an expressive constraint logic formalism. For generation and parsing of word forms, I propose a novel off-line technique to eliminate run-time optimization. It produces a finite-state oracle that efficiently restricts the constraint interpreter's search space. As a byproduct, unknown words can be analyzed without special mechanisms. Unlike pure finite-state transducer approaches, this hybrid setup allows for more expressivity in constraints to specify e.g. token identity for reduplication or arithmetic constraints for phonetics.

Affiliated with

Also associated with

No associations

Rating

Computing Declarative 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 Computing Declarative Prosodic Morphology, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Computing Declarative Prosodic Morphology will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-670420