Transducers from Rewrite Rules with Backreferences

Thumbnail Image

Date

Authors

Journal Title

Journal ISSN

Volume Title

Publisher

Abstract

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.
8 pages, EACL 1999 Bergen

Keywords

Computation and Language, F.1.1; F.4.3; I.2.1; J.5

Citation

URI

http://salesiana.dossiersoluciones.com/handle/123456789/33184

Consulte el texto completo en el siguiente enlace:

https://arxiv.org/abs/cs/9904008
 http://arxiv.org/abs/cs/9904008

Collections

arXiv