Paper: Compiling A Partition-Based Two-Level Formalism

ACL ID C96-1077
Title Compiling A Partition-Based Two-Level Formalism
Venue International Conference on Computational Linguistics
Session Main Conference
Year 1996

This paper describes an algorithm for the compilation of a two (or more) level or- thographic or phonological rule notation into finite state transducers. The no- tation is an alternative to the standard one deriving from Koskenniemi's work: it is believed to have some practical de- scriptive advantages, and is quite widely used, but has a different interpretation. Etficient interpreters exist for the nota- tion, 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.