Dendric words were introduced in 2013 as a generalization of both Arnoux-Rauzy words and codings of interval exchanges, themselves generalizing Sturmian words over larger alphabets. Their definition was later relaxed to obtain the notion of eventually dendric words. When faced with a new family of words, two questions arise naturally: how do we determine if a given word is in that family and by extension, how do we build examples of such words. In this talk, I will answer these questions for dendric and eventually dendric words using return morphisms and a classical construction of F. Durand.