27. A programmable computer an apparatus for locating unidentified breaks between words in an input character string, comprising A) a computer memory element for storing the input character string, B) first memory means for storing a character-transition table including character segments of morphemes, C) second memory means for storing a dictionary, said dictionary including lexical entries, D) a statistical analysis module operably coupled with said first memory means storing character-transition table for reducing the number of unidentified word breaks by locating a first word break in a first segment of said input character string as a function of at least one statistical morpheme in said first segment, said first word break dividing said first segment into a first sub-segment and a second sub-segment, and E) a database analysis module operably coupled with said dictionary for locating substantially all of the remaining unidentified word breaks in said first and second sub-segments by comparing said first and second sub-segments with entries in said dictionary.
27. A programmable computer an apparatus for locating unidentified breaks between words in an input character string, comprising A) a computer memory element for storing the input character string, B) first memory means for storing a character-transition table including character segments of morphemes, C) second memory means for storing a dictionary, said dictionary including lexical entries, D) a statistical analysis module operably coupled with said first memory means storing character-transition table for reducing the number of unidentified word breaks by locating a first word break in a first segment of said input character string as a function of at least one statistical morpheme in said first segment, said first word break dividing said first segment into a first sub-segment and a second sub-segment, and E) a database analysis module operably coupled with said dictionary for locating substantially all of the remaining unidentified word breaks in said first and second sub-segments by comparing said first and second sub-segments with entries in said dictionary. 38. The apparatus of claim 27, wherein said character-transition table includes character strings of morphemes that form a minimum spanning set necessary to identify character-transitions in said input character string.