In this paper the authors describe a new approach to rewrite rule extraction and analysis, using Minimal Representation Graphs. This approach provides a mechanism for obtaining the smallest possible rule set – within a context-dependent rewrite rule formalism – that describes a set of discrete training data completely, as an indirect approach to obtaining optimal accuracy on an unseen test set. They demonstrate the application of this technique for a pronunciation prediction task.
Reference:
Davel, M and Barnard, E. Obtaining a minimal set of rewrite rules. Sixteenth Annual Symposium of the Pattern Recognition Association of South Africa, Langebaan, South Africa, 23-25 November 2005
Davel, M., & Barnard, E. (2005). Obtaining a minimal set of rewrite rules. PRASA. http://hdl.handle.net/10204/5588
Davel, M, and E Barnard. "Obtaining a minimal set of rewrite rules." (2005): http://hdl.handle.net/10204/5588
Davel M, Barnard E, Obtaining a minimal set of rewrite rules; PRASA; 2005. http://hdl.handle.net/10204/5588 .