12. The method of claim 11 further comprising the steps of: i) receiving, by said one or more server computers, said text string without spaces; ii) setting, by said one or more server computers, a substring length to a number greater than 0; iii) identifying, by said one or more server computers, one or more substring-length substrings comprising one or more contiguous substrings with a length of said substring length within said text string; iv) for each of said one or more substring-length substrings: a) determining, by said one or more server computers, whether one of said one or more substring-length substrings matches any of said one or more dictionary words; and b) responsive to a determination that said one of said one or more substring-length substrings matches any of said one or more dictionary words, appending, by said one or more server computers, said substring-length substring to a micro dictionary keyword array; v) determining, by said one or more server computers, whether said substring length is greater than a length of said text string; vi) responsive to a determination that said substring length is not greater than said length of said text string; a) incrementing, by said one or more server computers, said substring length by 1; and b) repeating, by said one or more server computers, steps iii)-vi) b); and vii) generating, by said one or more server computers, a micro dictionary comprising one or more keywords comprising said one or more substring-length substrings in said micro dictionary keyword array ordered from a highest substring length to a lowest substring length.
12. The method of claim 11 further comprising the steps of: i) receiving, by said one or more server computers, said text string without spaces; ii) setting, by said one or more server computers, a substring length to a number greater than 0; iii) identifying, by said one or more server computers, one or more substring-length substrings comprising one or more contiguous substrings with a length of said substring length within said text string; iv) for each of said one or more substring-length substrings: a) determining, by said one or more server computers, whether one of said one or more substring-length substrings matches any of said one or more dictionary words; and b) responsive to a determination that said one of said one or more substring-length substrings matches any of said one or more dictionary words, appending, by said one or more server computers, said substring-length substring to a micro dictionary keyword array; v) determining, by said one or more server computers, whether said substring length is greater than a length of said text string; vi) responsive to a determination that said substring length is not greater than said length of said text string; a) incrementing, by said one or more server computers, said substring length by 1; and b) repeating, by said one or more server computers, steps iii)-vi) b); and vii) generating, by said one or more server computers, a micro dictionary comprising one or more keywords comprising said one or more substring-length substrings in said micro dictionary keyword array ordered from a highest substring length to a lowest substring length. 14. The method of claim 12 wherein said electronic dictionary comprises said micro dictionary.