ComputingComputer ScienceFormal MethodsProgramming LanguagesSyntaxPredicate LogicRegular LanguagesOperatorsRegular ExpressionsReplacementRewrite SystemsRewriting Systems
This paper introduces to the calculus of regular expressions a replace operator and defines a set of replacement expressions that concisely encode alternate variations of the operation. Replace expressions denote regular relations, defined in terms of other regular expression operators. The basic case is unconditional obligatory replacement. We develop several versions of conditional replacement that allow the operation to be constrained by context.
5
Regular models of phonological rule systems
Ronald M. Kaplan, Martin Kay · 1994 · 816 citations
Two-level morphology with composition
Lauri Karttunen, Ronald M. Kaplan, Annie Zaenen · 1992 · 158 citations · Full text
Constructing lexical transducers
Lauri Karttunen · 1994 · 125 citations · Full text
Finite-state parsing and disambiguation
Kimmo Koskenniemi · 1990 · 78 citations · Full text
Compiling and using finite-state syntactic rules
Kimmo Koskenniemi, Pasi Tapanainen, Atro Voutilainen · 1992 · 48 citations · Full text
Computing, Computer Science, English +15