Directed Replacement

Details Directed Replacement Directed Replacement

1996-06-23

arxiv.org/abs/cmp-lg/9606029v1

Computer Science

Computation and Language

To appear in the Proceedings of ACL-96

Scientific paper

This paper introduces to the finite-state calculus a family of directed replace operators. In contrast to the simple replace expression, UPPER -> LOWER, defined in Karttunen (ACL-95), the new directed version, UPPER @-> LOWER, yields an unambiguous transducer if the lower language consists of a single string. It transduces the input string from left to right, making only the longest possible replacement at each point. A new type of replacement expression, UPPER @-> PREFIX ... SUFFIX, yields a transducer that inserts text around strings that are instances of UPPER. The symbol ... denotes the matching part of the input which itself remains unchanged. PREFIX and SUFFIX are regular expressions describing the insertions. Expressions of the type UPPER @-> PREFIX ... SUFFIX may be used to compose a deterministic parser for a ``local grammar'' in the sense of Gross (1989). Other useful applications of directed replacement include tokenization and filtering of text streams.

Affiliated with

Also associated with

No associations

Rating

Directed Replacement 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 Directed Replacement, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Directed Replacement will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-76408