3. The method of claim 1 , further comprising: identifying two or more long common substrings between the text search string and the hypertext markup language representation of the web page; and examining each of the two or more long common substrings to find the longest common substring between the text search string and the two or more long common substrings.
3. The method of claim 1 , further comprising: identifying two or more long common substrings between the text search string and the hypertext markup language representation of the web page; and examining each of the two or more long common substrings to find the longest common substring between the text search string and the two or more long common substrings. 4. The method of claim 3 , wherein identifying two or more long common substrings includes: identifying approximately 3 to 5 long common substrings.