Scrambled word games involve re-arranging letters to form a word.

To unscramble a word using Lexifind, simply enter the scrambled letters in the Rack Letters: field of the Make Words column, making sure that sorting by word length has been selected. As you type in the scrambled letters, Lexifind will immediately make all of the words that it can from those letters. If the letters entered are in fact the scrambled letters of a single word, then that word will be the longest word found, and so will be at the front of the result list. For example, if you enter the letters TRYMEYS in the Letters: field of the Make Words column, they will be unscrambled to form the word MYSTERY.

Before using Lexifind to solve a scrambled word puzzle, make an attempt at solving it on your own. But if you get stuck, Lexifind provides a good way to see the answer that you've been trying to find without spending a long time agonizing over the solution. With this approach, you can experience a large number of scrambled words along with their solutions in a short time, which will give you greater insight into how letters can be transposed to form words. For example, you'll start to see that certain consonants, like TR, tend to go together, while other combinations of consonants, like ZP, are rarely found together, and therefore will usually need to be separated by a vowel. This increased insight into the "word space" of the scrambled words domain can help you to solve such puzzles more effectively on your own. This ability can also translate to other games, such as Scrabble ®, that involve rearranging letters to form words.

If you think that you have noticed a particular pattern such as the fact that Z and P do not usually occur together, you can confirm it by using Lexifind's Find Words facility. For example, you can enter #*ZP#* in the Board Area: field of Find Words to confirm that there are only ten words that include "ZP" (e.g., GAZPACHO), while there are 7.6 times that number (76) that have Z and P separated by some vowel (as shown by entering the expression #*Z[AEIOU]P#*). So now, when you see a scrambled word that contains a Z and a P, such as INZPU, you will try placing a vowel between the Z and the P before you try to place the Z and the P together. In doing this, you will have generalized to obtain a rule of thumb from a set of observed instances, a process known as inductive reasoning.

Please see help on constraints for an explanation of how constraint expressions, such as the ones that appear above, are constructed.