Abstract
We consider metaphors to be analogies with one unknown. Explaining it means solving the variable of the resulting analogical square, the other three terms beeing fixed. We propose a detailed method to achieve this goal using the knowledge base JeuxDeMots. We proceed by recognizing previously identified relational patterns that allow us to evaluate the strength of the relational similarity and those of the two attributional similarities to deduce that of the analogy as a whole. The candidate term that allows us to obtain the best strength of analogy between the four terms of the analogy with the gap thus completed is elected. Finally, we seek to demonstrate that the use of inferences in this process allows us to achieve better results, that is, to increase the number of times a good candidate is elected.