Xavier's Anagram Solver

See in action »

Source on Github »

The fastest anagram solver on the planet. Featuring a dictionary with over 150,000 words!

One anagram. Split second.

Solving an anagram barely takes a second with my anagram solver. This is the result of clever programming and use of modern technologies. PHP combined with a MySQL backend gives this solver speed and efficiency like no other!

How solving works

Anagrams are essentially scrambled words. For example 'ragaman' is an anagram for 'anagram'. All the letters of anagram are in 'ragaman'. The only difference is the position of the letters.

In otherwords, if you can re-arrange the letters of the anagram in a way that they would always match the same word, you could find the solution! For example: 'ragaman' or 'mnagraa' are both anagrams for 'anagram'.

So how do you re-arrange the letters? In alphabetic order of course. Example: 'ragaman' would become 'aaagmnr'. If you alphabetically re-arrange the letters of any other anagram for 'anagram', you would become the same, 'aaagmnr'

So you know how my anagram solver works. The rest is very simple. The database contains a huge dictionary with normal words. Next to every normal word is the alphabeticly re-arranged version. So next to 'dog' stands 'dgo'

When you enter an anagram, the solver re-arranges the letters of your anagram and finds a word that matches this combination.

Help me out

If you want a new language to be added to the solver (and you have a dictionary for it), please contact me! I'm always looking to improve the solver.

You can also help by sending me the solution for an anagram that couldn't be solved by the solver. I'll add it to the database!

Why an anagram solver?

A friend challenged me. "You can't program that!".