What I mean is, is there an algorithm that given any finitely presented group with soluble word problem can solve the word problem on that group?
No. This is the Boone-Rogers theorem on unsolvability of the uniform word problem. It's actually mentioned in the Wikipedia article on the word problem. https://en.wikipedia.org/wiki/Word_problem_for_groups