In this paper we are interested in semi-automatically generating labelled graph (model) transformations conform to a particular syntax (meta-model). Those transformations are basic operations in model driven engineering. They are usually developed by specialised programmers and for every change the source code must be updated. Our proposition is about generating transformation rules between two particular syntaxes using transformation examples (transformation traces) as input data. Examples are easier to write than a transformation program and often are already available. We are proposing a method based on FCA using relational descriptions of objects to find transformation rules. This method has been implemented and tested on transformations such as LATEX to HTML.