algorithm - Word Unscrambler Complexity Class -

i'm not experienced in field of complexity classes , related concepts. but, task of outputting whether or not given scrambled word real english word p or np problem? (if makes sense) programs i've seen take input , generate permutations of word, compare permutations every word in dictionary. if there algorithm took different, more efficient approach? change problem's class complexity? sorry if i'm using terminolgy incorrectly

you don't need generate permutations. count number of times each letter appears in word , compare counts, or sort letters of each word compare them. these operations polynomial in p.