Compiling Regular Formalisms with Rule Features into Finite-State Automata

This paper presents an algorithm for the compilation of regular formalisms with rule features into finite-state automata. Rule features are incorporated into the right context of rules. This general notion can also be applied to other algorithms which compile regular rewrite rules into automata.

• Type: Conference
• Year: 1997
• Where: ACL
• Authors: George Anton Kiraz
• Keywords: ACL 1997, ACL 2007, Finite-state Automata, Regular Rewrite Rules, Rule Features