unscramble the scramble word

[alexchandriyaa]

how to unscramble the given letters any idea??

[Schneider21]

This isn’t really even a sentence, much less a sensible question. What exactly is it you’re trying to do?

[alexchandriyaa]

@Schneider21

This isn’t really even a sentence, much less a sensible question. What exactly is it you’re trying to do?

word scrambler type of game here am trying to list out all possible words which can be formed with the listed jumbled letters

[fire7side]

I think you would have to take every possibility of arrangement and check it against a word list. That would be something you only had to do once, because it would be time consuming and you would need a word list which would be very large. After that, you could save the answers. I suppose you could break it down to a word list for each starting letter, and if the words were alphabetical in the list, you could stop as soon as a consecutive letter didn’t have any words. Probably the simplest thing would be to have a finite number of choices and then look up the word possibilities with an online dictionary. Unless there are word lists like that around for use.

GitHub - dwyl/english-words: :memo: A text file containing 479k English words...

[JoeStrout]

Yes, that’s essentially it. If you need to do it really fast, you repack your word list into a tree structure. So from start (empty string), you have an entry for every possible starting letter. Then under (say) “e”, you have an entry for every letter that follows an initial e. And so on. So when considering all possible combinations of letters, you traverse this tree, and stop as soon as you don’t find the letter you need.

But probably you don’t need to do it all that fast… simply generating all possible strings and looking them up in a dictionary (dictionary lookups are constant time) will probably be fast enough. If your scrambled word is 8 letters long, then there are 8! (8 factorial) or 40,320 combinations. That’s really not so many for a computer.

[robertgnelson2020]

Why don’t you check it out some unscramble words cheat generator or search on Google? You will find a lot of sites and also tools which can help you. Also, fire7side gives you a GitHub link there you can also find a lot of information and tools.

[unit_dev123]

@JoeStrout

Yes, that’s essentially it. If you need to do it really fast, you repack your word list into a tree structure. So from start (empty string), you have an entry for every possible starting letter. Then under (say) “e”, you have an entry for every letter that follows an initial e. And so on. So when considering all possible combinations of letters, you traverse this tree, and stop as soon as you don’t find the letter you need.

But probably you don’t need to do it all that fast… simply generating all possible strings and looking them up in a dictionary (dictionary lookups are constant time) will probably be fast enough. If your scrambled word is 8 letters long, then there are 8! (8 factorial) or 40,320 combinations. That’s really not so many for a computer.

I know this is old thread but letter frequency algorithm is more optimal than factorial combinations and smaller big ‘O’ computations.

[james3361]

For Unscramble any set of words , I usually use this wordmaker tool , otherwise, its all about your grey cells to scracth your head and find those set of words.