Compiling a Partition-Based Two-Level Formalism

Details Compiling a Partition-Based Two-Level Formalism Compiling a Partition-Based Two-Level Formalism

1996-05-02

arxiv.org/abs/cmp-lg/9605001v1

Computer Science

Computation and Language

Uuencoded gz-compressed .tar file created by csh script uufiles, needs colap.sty and psfig (available from the cmp-lg macro li

Scientific paper

This paper describes an algorithm for the compilation of a two (or more) level orthographic or phonological rule notation into finite state transducers. The notation is an alternative to the standard one deriving from Koskenniemi's work: it is believed to have some practical descriptive advantages, and is quite widely used, but has a different interpretation. Efficient interpreters exist for the notation, but until now it has not been clear how to compile to equivalent automata in a transparent way. The present paper shows how to do this, using some of the conceptual tools provided by Kaplan and Kay's regular relations calculus.

Affiliated with

Also associated with

No associations

Rating

Compiling a Partition-Based Two-Level Formalism 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 Compiling a Partition-Based Two-Level Formalism, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Compiling a Partition-Based Two-Level Formalism will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-296960