이 제출물을 팔로우합니다
- 팔로우하는 게시물 피드에서 업데이트를 확인할 수 있습니다
- 정보 수신 기본 설정에 따라 이메일을 받을 수 있습니다
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
인용 양식
Khaled Hamed (2026). Text Twist Puzzle Solver (https://kr.mathworks.com/matlabcentral/fileexchange/24622-text-twist-puzzle-solver), MATLAB Central File Exchange. 검색 날짜: .
도움
도움 받은 파일: spellcheck
