Automatically inferring new relations from already existing ones is a way to improve the qual-ity and coverage of a lexical network and to perform error detection. In this paper, we devise such an approach for the crowdsourced JeuxDeMots lexical network and we focus especially on word refinements. We first present deduction (generic to specific) and induction (specific to generic) which are two inference schemes ontologically founded and then propose a trans-fer schema devoted to infer relations with and for word refinements.