6. A machine-implemented method, comprising: receiving characters associated with a string each character representing a single letter; iteratively traversing the characters of the string finding substrings that match words of a hierarchically organized dictionary until each character of the string has been traversed, the hierarchically organized dictionary is a hierarchy where each node is a single character and where each leaf node represents a particular one of the words, and each word representing a common word, a domain specific word, an acronym for that word, a colloquialism for that word, an abbreviation for that word, a proper name, or a common misspelling for that word, the hierarchically organized dictionary stored as a directory where each character of each word is stored as its own independent sub-directory and a folder within the directory and each word including an annotation indicating an origin of that word; and returning each substring, which is found from the string and that is also located in the hierarchically organized dictionary, to a requesting service for subsequent processing by that requesting service.
6. A machine-implemented method, comprising: receiving characters associated with a string each character representing a single letter; iteratively traversing the characters of the string finding substrings that match words of a hierarchically organized dictionary until each character of the string has been traversed, the hierarchically organized dictionary is a hierarchy where each node is a single character and where each leaf node represents a particular one of the words, and each word representing a common word, a domain specific word, an acronym for that word, a colloquialism for that word, an abbreviation for that word, a proper name, or a common misspelling for that word, the hierarchically organized dictionary stored as a directory where each character of each word is stored as its own independent sub-directory and a folder within the directory and each word including an annotation indicating an origin of that word; and returning each substring, which is found from the string and that is also located in the hierarchically organized dictionary, to a requesting service for subsequent processing by that requesting service. 7. The method of claim 6 , wherein iteratively traversing further includes allowing a configurable number of garbage characters to be ignored in a middle of a particular one of the found substrings.