Abstract: Given a group G, with a finite monoid generating set A, one can define the word problem of G to be the set of all words over A that represent the identity. This has generated significant interest since the 1970s with a number of successful attempts to link classes of languages with classes of groups. We give a brief overview of the word problem, investigate a method of generalising this language to inverse monoids, and explore some attempts to generalise the theorems about word problems.