......-...-..---...---.-..--.-..--..-.. -.----..-...--..-.-----..-...---.-.....
-.-..-.........-.....--..-....---..---. ....--.-----..-.-----..-.-..-.......-.. .-
.--.-----......-.....-------...-.

Charlie scanned for long words.
What about this idea:  any word can be put into pauseless Morse, then dit's and dah's can be 0's and 1's, and thus a word becomes a binary number.  Not necessarily unique, for example in Morse without pauses, THAT = BUT = -.....-- = 10000011

Meanwhile, the code above is translated to a long binary number about 200 digits long or so.

Generate a database of words, each paired with it's binary equivalent.   Now sort the database in numerical order according to the binary number.  Now you have a lookup table.

Start at the beginning of the long binary number, match the first n bits with valid entries in the database.  When you get a hit, look at bits n+1 through m.  Still very tedious but a whole lot better than trying to do the same thing one individual letter at a time.

Posted by Larry on 2005-03-25 23:51:32