For example, say I have a string and it has the letters:
This is not an actual English word or it doesn't start an actual english word, so the program would skip this string and would avoid it.
But say the string was:
This is the first 5 letters of an actual word, like microwave or microprocessor, etc. And it actually is a word
I want to write a program in Java that will be able to see if a given string contains any block of strings that belong to a potential word.
I'm playing a game where I have to decypher a secret language, so I set numbers equal to each "character", and now I want to run each number and put an English letter to each number and see if it possibly spells out a word.
Is this possible or is this just way too massive to do? I'm asking here because I'm not sure if it's impossible or possible based on the number of combinations or some kind of program to reference to check words against.
I think I can write the program to add a letter to each number then rotate through and spit out a string, but I am not sure about comparing the string to an English word.