I have the following problem: I have a series of numbers (6, 9, 6, 2, 6, 3, 4, 7, 3, 5, 4, 3, 2, 5, 8, 6, 2, 6, 3, 4, 5, 8, 7, 8, 2, 7, 7, 4, 8, 3, 3, 2, 8, 8, 4, 3, 2, 4, 7, 7, 6, etc.), each number instance can correspond to 3-4 different letters (I know the correspondences, for example 2 can be A, B or C, 3 can be D, E of F, etc.).

The sequences of numbers represent sentences of English words (blank spaces are not encoded, so words are concatenated). I know where sentences end, but not where words end.

I have a list of English words, but the sentence may also contains proper nouns, for which I have no list.

I was planning to write a program to search all combinations, starting with the longest words and going through all combinations until the end of each sentence is reached (still I don't know how to deal with proper nouns that are not in my list). Before doing that I just want to ask the question:

Do you know of any existing software that may be adapted to do this?

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Browse other questions tagged or ask your own question.