Parallel Replacement in Finite State Calculus
| dc.creator | Kempe, Andre | |
| dc.creator | Karttunen, Lauri | |
| dc.date | 1996-07-05 | |
| dc.date | 1996-08-12 | |
| dc.date.accessioned | 2026-07-07T08:58:43Z | |
| dc.date.available | 2026-07-07T08:58:43Z | |
| dc.description | This paper extends the calculus of regular expressions with new types of replacement expressions that enhance the expressiveness of the simple replace operator defined in Karttunen (1995). Parallel replacement allows multiple replacements to apply simultaneously to the same input without interfering with each other. We also allow a replacement to be constrained by any number of alternative contexts. With these enhancements, the general replacement expressions are more versatile than two-level rules for the description of complex morphological alternations. | |
| dc.description | 6 pages, dvi (+ 1x eps) tar gzip uuencode | |
| dc.identifier | https://arxiv.org/abs/cmp-lg/9607007 | |
| dc.identifier | http://arxiv.org/abs/cmp-lg/9607007 | |
| dc.identifier | COLING-96, Copenhagen DK. August 5, 1996. | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/147434 | |
| dc.subject | Computation and Language | |
| dc.title | Parallel Replacement in Finite State Calculus | |
| dc.type | text |