Transducers from Rewrite Rules with Backreferences
| dc.creator | Gerdemann, Dale | |
| dc.creator | van Noord, Gertjan | |
| dc.date | 1999-04-15 | |
| dc.date.accessioned | 2026-07-07T03:24:04Z | |
| dc.date.available | 2026-07-07T03:24:04Z | |
| dc.description | 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. | |
| dc.description | 8 pages, EACL 1999 Bergen | |
| dc.identifier | https://arxiv.org/abs/cs/9904008 | |
| dc.identifier | http://arxiv.org/abs/cs/9904008 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/33184 | |
| dc.subject | Computation and Language | |
| dc.subject | F.1.1; F.4.3; I.2.1; J.5 | |
| dc.title | Transducers from Rewrite Rules with Backreferences | |
| dc.type | text |