13. A system, comprising: a hierarchically organized dictionary of words residing in a machine-accessible and computer-readable medium and accessible to a substring matching service that executes on a machine, the hierarchically organized dictionary of words stored in the machine-accessible and computer-readable medium as a directory where each character of each word is stored as its own independent sub-directory and a folder of the directory, and each word including an annotation indicating an origin of that word; the substring matching service implemented in a machine-accessible and computer-readable medium and to process on the machine; the substring matching service parses each character of a target string looking for a longest successive match of a substring of those characters within the hierarchically organized dictionary, each character representing a letter, the hierarchically organized dictionary of words is assembled so that each node of a hierarchy is a single character and each leaf node presents a particular word from the hierarchically organized dictionary of words and the substring matching service returns each of the substrings found to a requesting service for subsequent processing and manipulation by that requesting service, 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.
17. The system of claim 13 , wherein substring matching service finds at least two or more substrings in the hierarchically organized dictionary for the target string being processed.