Transducers from Rewrite Rules with Backreferences
Dale Gerdemann, Gertjan van Noord
Abstract
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.
Create a lesson
Related papers
ToolSpace: Scaling Tool-Centric Environment Synthesis for Long-Horizon Agents
Guanting Dong, Zhichao Sun, Xinyu Yang et al.
Whose Effect Is It? How Objectives Inflate Learned Subspace Interventions
Toygar Tanyel, Serkan Ayvaz
Who is the Pronoun Pro? Comparing LLMs and Humans at Number-Disambiguation of 'they'
Carlos Hartmann
Shuffled OPSD: When Semantic Consistency Hurts On-Policy Self-Distillation?
Qingyuan Zheng, Zhihao Dou
HERIT: Enabling Global Access to Hanja-to-English Historical Translation by Mitigating Temporal Bias
Dayeon Jeong, Kyeongpil Kang
Residual Attribute Leakage Is an Interface: Auditing Privacy Evaluation After Text De-identification
Tuan Thanh Duong, Joongmin Shin, Jeongho Yoon et al.