Apparently I'm so un-anagramable that it doesn't even bother.
I suppose there's really only what.. 4! possibilities? Right? 24?
EDIT:
Looked it up, with a repeated letter, the number of anagrams is reduced.. it's 4! / 2! = 12 possibilities.
As an exercise, wrote them all out.. boorrrrrring
Jinn
Jnin
Jnni
Ninj
Nijn
Nnji
Nnij
Njin
Njni
Ijnn
Injn
Ijnn
---------- Post added at 10:20 AM ---------- Previous post was at 09:41 AM ----------
As an aside, I considered the likelihood of someone dedicated reverse-engineering Redlemon's entry and retrieving his actual name, and I'm kinda a nerd for computability.
EMETICALLYWARMHEDONISM is 22 characters, so upper limit of calculations is 22!.
However, there are a number of repeated letters:
E E E
T
I I
C
L L
Y
W
A A
R
H
D
O
N
S
M M M
Leaving us 22! / 3! * 1! * 2! * 1! * 2! * 1! * 1! * 2! * 1! * 1! * 1! * 1! * 1! * 1! * 3!
Which simplifies to 22! / 3! * 2 * 2 * 2 * 3! or 22! / 288 =
3,902,780,304,783,360,000
Even making some assumptions about length of anagram words (>2 letters, with notable exceptions like Le, Hu, Ha, etc) and number of words (2 or 3), it's academically but not pragmatically computable. You could write an algorithm that spit out 'likely' 2 and 3 word anagrams with greater than 4 letters that have matches against a first name in boy/girl birth name popularity database but you'd still need a human to ascertain if the middle and last names seemed relevant.
And after all of that, you'd still not know with 100% certainty because in a data set that large (3 quintillion?) you are likely to hit quite a few that are full proper names.