Grimley Evans, EdmundEdmundGrimley EvansKiraz, George A.George A.KirazPulman, StephenStephenPulman2026-08-202026-08-201996Grimley-Evans, Edmund, George A. Kiraz, and Stephen G. Pulman, ‘Compiling a Partition-based Two-level Formalism.’ In Proceedings of the 16th International Conference on Computational Linguistics. Copenhagen: Center for Sprogteknologi, 1996.https://hdl.handle.net/20.500.12111/10900This 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.en-USConference paper