Computer Science – Computation and Language
Scientific paper
1995-04-29
Computer Science
Computation and Language
To appear in the Proceedings of ACL-95. 8 pages, PostScript
Scientific paper
This paper introduces to the calculus of regular expressions a replace operator, ->, and defines a set of replacement expressions that concisely encode several alternate variations of the operation. The basic case is unconditional obligatory replacement: UPPER -> LOWER Conditional versions of replacement, such as, UPPER -> LOWER || LEFT _ RIGHT constrain the operation by left and right contexts. UPPER, LOWER, LEFT, and RIGHT may be regular expressions of any complexity. Replace expressions denote regular relations. The replace operator is defined in terms of other regular expression operators using techniques introduced by Ronald M. Kaplan and Martin Kay in "Regular Models of Phonological Rule Systems" (Computational Linguistics 20:3 331-378. 1994).
Karttunen Lauri
Research Centre Rank Xerox
No associations
LandOfFree
The Replace Operator 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 The Replace Operator, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Replace Operator will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-442150