|
|
| File Information |
| Description |
This code takes an input string (usually six letters) and displays all meaningful words (according to Microsoft Word dictionary) that can be formed from them. All combinations from three letters up to the full length of the input string are spell-checked to figure out meaningful words.
Example:
>> tt sttaes
Solution:
states
tastes
asset
sates
seats
state
stats
stets
taste
teats
tests
asst
east
eats
etas
sate
seas
seat
seta
sets
sett
stat
stet
tats
teas
teat
test
ass
ate
eat
eta
sat
sea
set
tae
tat
tea
|
| Acknowledgements |
The author wishes to acknowledge the following in the creation of this submission:
spellcheck
|
| MATLAB release |
MATLAB 7.7 (R2008b)
|
| Other requirements |
Microsoft Word |
|
Tags for This File
|
| Everyone's Tags |
|
| Tags I've Applied |
|
| Add New Tags |
Please login to tag files.
|
| Updates |
| 02 Jul 2009 |
Corrected error in Tags |
|
Contact us at files@mathworks.com