Compiling a Partition-Based Two-Level Formalism
| dc.creator | Grimley-Evans, Edmund | |
| dc.creator | Kiraz, George Anton | |
| dc.creator | Pulman, Stephen G. | |
| dc.date | 1996-05-02 | |
| dc.date.accessioned | 2026-07-07T09:10:14Z | |
| dc.date.available | 2026-07-07T09:10:14Z | |
| dc.description | 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. | |
| dc.description | Uuencoded gz-compressed .tar file created by csh script uufiles, needs colap.sty and psfig (available from the cmp-lg macro library). 6 pages, to appear in COLING-96 | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9605001 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9605001 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/151292 | |
| dc.subject | Computation and Language | |
| dc.title | Compiling a Partition-Based Two-Level Formalism | |
| dc.type | text |