Compiling a Partition-Based Two-Level Formalism

a a t a A a a 1 a a College) A B no. a 92313384. a a College) College. a a Compiling Partition-Based Two-Level Formalism Edmund Grimley-Evans* George Anton Kiraz Stephen G. Pulman University of Cambridge University of Cambridge University of Cambridge (St John's (St John's Cointmter Laboratory Computer Laboratory Computer Laboratory Cambridge CB2 3QG, UK Cambridge CB2 3QG, UK Cambridge CB2 3QG, UK and SRI International, Cambridge Edmund. Grimley-Evans@cl. cam. ac. George. Kiraz@cl. cam. ac. uk sgpOcam, sri. com Abstract rages to Koskenniemi's notation. These are de- tailed more fully in (Black et al., 1987, pp. 13-15), This paper describes an algorithm for the and in (Ritchie et al., 1992, pp. 181-9). In brief: compilation of two (or more) level or- (1) Koskennienli rules are not easily interpretable thographic or phonological rule notation (by tile grammarian) locally, for the interpretation into finite state transducers. The no- of 'feasible pairs' depends on other rules in the tation is an alternative to the standard set. (2) There are frequently interactions between one deriving from Koskenniemi's work: rules: whenever the lexieal/surface pair affected it is believed to have some practical de- by rule appears in tile context of another rule scriptive advantages, and is quite widely B, the grammarian must check that its appearance used, but has different interpretation. in rule will not conflict with the requirements of ...