RE: Mathematical Typography, Layout and Rendering

Math Working Group,
 
Greetings.  In an earlier discussion, described were "machine learning components which output a heuristic or mapping between two domains of trees, outputting an abstract syntax tree describing logical processing upon the input trees and other typographical parameters.  The situation could be described as inducing tree transformations, inducing tree-based automata or transducers, or, generically, inductive logical programming.  Additionally, for a constant mapping, the topic could be phrased as inducing parameters per box depending upon the layout tree's box model." (http://lists.w3.org/Archives/Public/www-math/2012Feb/0031.html)
 
For researchers interested in such topics and approaches, some related publications include:
Erwig, Martin. (2003). Toward the Automatic Derivation of XML Transformations
http://web.engr.oregonstate.edu/~erwig/papers/AutoXMLTransf_XSDM03.pdf Schmid, Ute, & Waltermann, Jens. (2004). Automatic Synthesis of XSL-Transformations from Example Documentshttp://www2.informatik.uni-osnabrueck.de/schmid/pub-ps/aia04sh2.pdf Guta, Gábor. (2010). Finite State Transducer Modification by Examples
http://www.risc.jku.at/publications/download/risc_4085/tr1.pdf
Varró, Dániel. (2006). Model Transformation by Example
http://www.springerlink.com/content/a34jhvh4j01l7514/ Balogh, Zoltán, & Varró, Dániel. (2009). Model transformation by example using inductive logic programming
http://www.springerlink.com/content/tr584564787k23t1/
  Kind regards, Adam Sobieski