A fundamental algorithmic question in group theory is the Word Problem for finitely generated groups, which asks whether there exists an algorithm to decide whether two words on the generators represent the same group element. A related notion is the Dehn function of a finitely presented group, the smallest isoperimetric function of the presentation's Cayley complex. While the Dehn function gives an upper bound for the complexity of the Word Problem for that group, this bound is only meaningful in the class of finitely presented groups and is very far from sharp even in this class. We resolve this disconnect by instead considering the Dehn functions of the finitely presented groups into which a group embeds, demonstrating a refinement of the Higman embedding theorem that gives a potentially quasi-optimal bound on the Dehn function of the ambient group.