Spell check problem

Given a dictionary find out if given word can be made by two words in dictionary. For example "spellchecker" is composed by "spell" and "checker". How can you detect it in efficient space and time?