13. A method of operating a processor comprising: operating the processor to produce word data representing a large set of words; the large set of words including a set of shared suffix branches, each shared suffix branch occurring at least twice in the large set of words; a first one of the words in the large set having two or more characters and a hyphenation point between a preceding character and a subsequent character; the hyphenation point of the first word being a point at which the first word can properly be hyphenated; the first word and a second one of the words in the large set both including a shared suffix that occurs in a first one of the shared suffix branches and a shared prefix; the shared suffix following a first word character in the first word and following a second word character in the second word; the word data including codes; the codes including: character codes representing characters of the words; and a hyphenation code representing the hyphenation point of the first word; the word data being searchable for a first sequence of the codes and for a second sequence of the codes; the first sequence representing the first word and including a preceding one of the character codes representing the preceding character, a following one of the character codes representing the subsequent character, the hyphenation code, and a first word character code representing the first word character; the second sequence of the codes representing the second word; the second sequence of codes including a second word character code representing the second word character; the hyphenation code being positioned between the preceding character code and the following character code in the first sequence so that the hyphenation point of the first word can be determined from the position of the hyphenation code; operating the processor to use the word data to obtain stored word data stored in a memory; the stored word data including: shared prefix codes that represent the shared prefix once for its occurrences in the first and second words; the first and second sequences of codes both including the shared prefix codes; shared suffix codes that begin at a first location in the memory; the shared suffix codes representing the shared suffix once for its occurrences in the first and second words; the first sequence of codes including information that a processor can use, after accessing the first word character code, to continue search by accessing the shared suffix codes at the first location; the second sequence of codes includes information that a processor can use, after accessing the second word character code, to continue search by accessing the shared suffix codes at the first location; the act of operating the processor to use the word data to obtain stored word data comprising: detecting each of the set of shared suffix branches; for each shared suffix branch detected, determining whether to represent the shared suffix branch only once; the act of operating the processor to use the word data to obtain stored word data determining to represent the first shared suffix branch only once; and for the shared suffix branches determined to be represented only once, including location codes in the stored word data, each location code indicating a location in the memory at which a shared suffix branch is represented; at least one of the first and second word character codes being followed by a first one of the location codes; the first location code indicating the first location so that a processor can use the first location code to continue search by accessing the shared suffix codes at the first location; the hyphenation code having a position in the stored word data so that the hyphenation point of the first word can be determined from the position of the hyphenation code in the stored word data.
13. A method of operating a processor comprising: operating the processor to produce word data representing a large set of words; the large set of words including a set of shared suffix branches, each shared suffix branch occurring at least twice in the large set of words; a first one of the words in the large set having two or more characters and a hyphenation point between a preceding character and a subsequent character; the hyphenation point of the first word being a point at which the first word can properly be hyphenated; the first word and a second one of the words in the large set both including a shared suffix that occurs in a first one of the shared suffix branches and a shared prefix; the shared suffix following a first word character in the first word and following a second word character in the second word; the word data including codes; the codes including: character codes representing characters of the words; and a hyphenation code representing the hyphenation point of the first word; the word data being searchable for a first sequence of the codes and for a second sequence of the codes; the first sequence representing the first word and including a preceding one of the character codes representing the preceding character, a following one of the character codes representing the subsequent character, the hyphenation code, and a first word character code representing the first word character; the second sequence of the codes representing the second word; the second sequence of codes including a second word character code representing the second word character; the hyphenation code being positioned between the preceding character code and the following character code in the first sequence so that the hyphenation point of the first word can be determined from the position of the hyphenation code; operating the processor to use the word data to obtain stored word data stored in a memory; the stored word data including: shared prefix codes that represent the shared prefix once for its occurrences in the first and second words; the first and second sequences of codes both including the shared prefix codes; shared suffix codes that begin at a first location in the memory; the shared suffix codes representing the shared suffix once for its occurrences in the first and second words; the first sequence of codes including information that a processor can use, after accessing the first word character code, to continue search by accessing the shared suffix codes at the first location; the second sequence of codes includes information that a processor can use, after accessing the second word character code, to continue search by accessing the shared suffix codes at the first location; the act of operating the processor to use the word data to obtain stored word data comprising: detecting each of the set of shared suffix branches; for each shared suffix branch detected, determining whether to represent the shared suffix branch only once; the act of operating the processor to use the word data to obtain stored word data determining to represent the first shared suffix branch only once; and for the shared suffix branches determined to be represented only once, including location codes in the stored word data, each location code indicating a location in the memory at which a shared suffix branch is represented; at least one of the first and second word character codes being followed by a first one of the location codes; the first location code indicating the first location so that a processor can use the first location code to continue search by accessing the shared suffix codes at the first location; the hyphenation code having a position in the stored word data so that the hyphenation point of the first word can be determined from the position of the hyphenation code in the stored word data. 14. The method of claim 13 in which the shared prefix ends with the preceding character that precedes the hyphenation point in the first word; the second word having an alternative character immediately following the preceding character and having no hyphenation point between the preceding character and the alternative character; the act of operating the processor to use the word data to obtain stored word data further comprising: positioning the hyphenation code and an alternative character code representing the alternative character at positions within the stored word data so that the alternative character code can be reached from the hyphenation code.