Computer Science – Computation and Language
Scientific paper
1996-07-05
COLING-96, Copenhagen DK. August 5, 1996.
Computer Science
Computation and Language
6 pages, dvi (+ 1x eps) tar gzip uuencode
Scientific paper
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.
Karttunen Lauri
Kempe André
No associations
LandOfFree
Parallel Replacement in Finite State Calculus does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Parallel Replacement in Finite State Calculus, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Parallel Replacement in Finite State Calculus will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-80907