Paper: Compiling Regular Formalisms With Rule Features Into Finite-State Automata

ACL ID P97-1042
Title Compiling Regular Formalisms With Rule Features Into Finite-State Automata
Venue Annual Meeting of the Association of Computational Linguistics
Session Main Conference
Year 1997
Authors

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 au- tomata.