Computer Science – Computation and Language
Scientific paper
1999-04-15
Computer Science
Computation and Language
8 pages, EACL 1999 Bergen
Scientific paper
Context sensitive rewrite rules have been widely used in several areas of natural language processing, including syntax, morphology, phonology and speech processing. Kaplan and Kay, Karttunen, and Mohri & Sproat have given various algorithms to compile such rewrite rules into finite-state transducers. The present paper extends this work by allowing a limited form of backreferencing in such rules. The explicit use of backreferencing leads to more elegant and general solutions.
Gerdemann Dale
Noord Gertjan van
No associations
LandOfFree
Transducers from Rewrite Rules with Backreferences 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 Transducers from Rewrite Rules with Backreferences, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Transducers from Rewrite Rules with Backreferences will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-144979