SYSTEM AND METHOD FOR ADVANCED HANDLING OF MULTIPLE FORM FIELDS BASED ON RECENT OPERATOR BEHAVIOR

• US 20080294618A1
• Filed: 05/23/2007
• Published: 11/27/2008
• Est. Priority Date: 05/23/2007
• Status: Active Grant

• Current Assignee: X Corp. (f/k/a Twitter, Inc.) (X Holdings Corp.)
• Original Assignee: International Business Machines Corporation
• Inventors: O'Connell, Brian Marshall, Walker, Keith Raymond, Hamilton, Rick Allen II, Wismar, Andrew Ladd
• Granted Patent: US 7,756,860 B2
• Time in Patent Office: Days
• US Class Current: 1/1
• CPC Class Codes: G06F 16/338 Presentation of query results
• CPC Class Codes: G06F 16/9577 Optimising the visualization of content, e.g. distillation of HTML documents

Abstract

A method, system and computer program product for enhancing the usability of web browsers by analyzing the recent behavior of an operator while executing a search pattern on a computer network. In particular, a browser enhancement utility provides web browsers with the ability to store (for a limited time period) search terms used in a variety of web search patterns. The browser enhancement utility employs ranking algorithms to identify the relationships between searches and a ranking and matching algorithm to utilize stored search terms to find (text) matches in a web document. When the browser displays web pages after a search has occurred, the browser enhancement utility utilizes these matches in order to take actions to enhance document usability. These actions include: Highlighting terms that have been recently searched for; pre-selecting matching terms from drop down boxes or radio buttons; and focusing a web page to relevant sections of text.

Claims

1. A method comprising:

maintaining a history of search terms utilized to conduct searches;

responsive to receipt of a search request having a search string that includes one or more search keywords, retrieving search results that contain the one or more search keywords;

identifying, within a returned page of the search results, matches of one or more of the search keywords and matches of one or more of the search terms; and

outputting the returned page with an indication within the returned page of the presence of matches to both the one or more search keywords and the one or more search terms.

2. The method of claim 1, further comprising:

ranking each of the one or more search terms that are matched within the returned page, said ranking based on an established ranking methodology that evaluates at least one of (a) a degree to which the one or more search terms matches corresponding terms within the returned page and (b) the proximity of the current search to the previous search involving a matching search term;

selecting only matching search terms that are of a high ranking as the one or more search terms to indicate within the result page;

3. The method of claim 2, further comprising:

generating a set of instructions with metadata entries which indicate a location, a type of metadata for rendering, and a ranking of the matching search terms within the returned page; and

transferring the set of instructions with the content of the returned page to a rendering engine for rendering of the returned page.

4. The method of claim 3, wherein:

when the type of metadata includes metadata to generate text-based highlighting, said outputting further comprises;

generating a display of the returned page having therein the one or more search keywords and the one or more of the stored search terms; and

highlighting, within the display of the returned page, the one or more search keywords and selected ones of the high ranking, matched search terms, wherein efficient locating of terms of current interest, identified via the search keywords, and terms of historical interest, via the matched search terms, is provided within the display of the returned page;

when the type of metadata includes metadata for providing pre-selected entries for radio and drop down pre-select, said outputting further comprising;

providing at least one drop down box and a radio button with selections of matched search terms that may be identified within the returned page;

pre-selecting a high ranked, matched search term for display within the drop down box;

displaying the pre-selected matched search term within the drop down box; and

enabling selection, utilizing the drop down box and radio button, of other matched search terms for identifying within the returned page; and

when the type of metadata includes metadata for auto-focusing the returned page, said outputting further comprises;

identifying a location of a match of a highest ranking matched search term within the returned page, wherein a highest ranking matched search term is one of the search keywords;

determining that the match occurred from a most recent entry in a current search and follow pattern thread; and

automatically adjusting a physical rendering of the returned page to substantially place the search term in a location of visible prominence relative to the overall physical space within which the returned page is being outputted.

5. The method of claim 4, wherein said adjusting further comprises at least one of:

automatically focusing the returned page within the display such that relevant sections of text within which the search keywords and the historical terms are found are prominently placed within the viewable area of the display; and

when a next matched search term is selected within a drop down box, auto-focusing the returned page to prominently exhibit an area in which the next matched search term is located.

6. The method of claim 1, further comprising:

parsing a search string to remove insignificant terms contained within the search string with at least on significant search term, said search string utilized to conduct a search for objects that may be located using the at least one significant search term;

storing each significant search term within a datastore of stored search terms;

assigning a thread rank to each stored search term;

time-stamping each stored search term at a time of storage and subsequent update;

updating a time stamp of a stored term when the stored term is identified within a subsequent return page;

monitoring an elapsed time between an initial time of storage or subsequent update of the stored search term and a current time; and

when the elapsed time exceeds a threshold expiration time without said stored search being identified within a returned page, automatically deleting the stored search term from storage.

7. The method of claim 1, further comprising:

tracking historical searches associated with the search terms across multiple browser instances, including searches from one or more of (a) other tabs, (b) other browser windows, and (c) alternate browsers during a search sequence associated with the historical search;

ranking search terms associated with each historical search relative to the current search based on a plurality of factors, including;

(1) whether a previous search term is connected to other search terms via a same search thread, whereby search terms connected to the current search via a same search thread are provided a higher ranking than search terms not a part of the same search thread; and

(2) proximity in time to the current search, whereby search terms associated with a more recent historical search are provided a higher ranking than search terms associated with a less recent search.

8. The method of claim 7, wherein said ranking further comprises:

determining a rank for each of a plurality of white space delimited character combinations of a returned page that matches with one of the search terms;

comparing the rank of each matched character combination with a pre-established threshold rank value;

initiating at least one of the following functions based on the rank of the matched character combination;

highlighting one or more of the plurality of white space delimited character combinations of the returned page when the particular matched character combination has a matching rank above the threshold rank value;

pre-selecting, from a radio button and a drop down box, one or more of a plurality of options corresponding to the matched character combination when the particular matched character combination has a highest matching rank; and

auto-focusing a returned page to a section containing text corresponding to the matched character combinations with a highest rank.

9. The method of claim 1, further comprising:

determining whether the current search request is a constituent of a search and follow pattern that originated with a previous search, whose search terms are stored;

when the current search request is a constituent of a search and follow pattern that originated with a previous search with search terms;

initiating a first ranking algorithm to rank the search terms in descending order; and

notifying a search history engine of an update to the search and follow pattern to now include the current search request and associated search keywords; and

when the current search request is not a constituent of a search and follow pattern, initiating a second ranking algorithm, which includes;

(a) ranking each search starting at a most recent search, which is assigned a rank of “

1”

, and incrementing a ranking by 1 for all previous searches not already ranked; and

(b) notifying a search history engine of the initiation of a new search and follow branch originated by the current search request.

10. The method of claim 9, wherein the first ranking algorithm comprises:

(a) assigning a most recent (entire) search phrase a rank of “

1”

;

(b) assigning each white space delimited character combination from the search phrase a rank of “

2”

;

(c) incrementing the rank assignment with each step backwards in the search and follow pattern to a previous search; and

(d) for a set of search terms not reachable by stepping backwards in the search and follow pattern, ranking each remaining search starting at the most recent remaining search, and incrementing the ranking by 1 for all previous searches not already ranked.

11. The method of claim 10, further comprising:

multiplying a rank of a search term by a preset constant, wherein, when the rank of one or more of the search terms is equal, each equal rank is multiplied by a same preset constant and when the rank of the one or more stored search terms is different, each different rank is multiplied by a different preset constant, wherein the preset constant is selected to favor more recently entered terms above less recent terms;

computing a closeness value between each one of a plurality of white space delimited character combinations within the returned page and each one of a plurality of search terms, which closeness value is computed based on relative rank order of the search terms, such that a closeness value of a highest ranking search term is first computed;

when the computed closeness value lies outside of a preset threshold range for acceptable closeness value, discarding an associated character combination as a match that is not relevant; and

when the computed closeness value lies within a preset threshold range for acceptable closeness value;

adding the closeness value to the multiplied rank associated with a previous search term that was used in the closeness value computation to determine a matching rank for the white space delimited character combination; and

storing the rank of the matched character combination in an ordered data structure.

12. The method of claim 9, wherein said determining further comprises:

detecting when a branching operation has taken place, wherein said branching operation is detected by one or more of;

(a) opening a link in a new window;

(b) opening a link in a new tab; and

(c) clicking of a link that opens in a new tab or window;

detecting entry of the search request; and

when a branching operation has taken place and entry of the search request is detected, adding the current and a most recent previous search to a search and follow branch/pattern.

13. A computer program product comprising:

a computer readable medium; and

program code on said computer readable medium that when executed provides the functionality of;

maintaining a history of search terms utilized to conduct searches;

responsive to receipt of a search request having a search string that includes one or more search keywords, retrieving search results that contain the one or more search keywords;

identifying, within a returned page of the search results, matches of one or more of the search keywords and matches of one or more of the search terms; and

outputting the returned page with an indication within the returned page of the presence of matches to both the one or more search keywords and the one or more search terms.

14. The computer program product of claim 13, further comprising program code for:

ranking each of the one or more search terms that are matched within the returned page, said ranking based on an established ranking methodology that evaluates at least one of (a) a degree to which the one or more search terms matches corresponding terms within the returned page and (b) the proximity of the current search to the previous search involving a matching search term;

selecting only matching search terms that are of a high ranking as the one or more search terms to indicate within the result page;

15. The computer program product of claim 14, further comprising program code for:

generating a set of instructions with metadata entries which indicate a location, a type of metadata for rendering, and a ranking of the matching search terms within the returned page;

transferring the set of instructions with the content of the returned page to a rendering engine for rendering of the returned page;

when the type of metadata includes metadata to generate text-based highlighting, said outputting further comprises;

generating a display of the returned page having therein the one or more search keywords and the one or more of the stored search terms; and

highlighting, within the display of the returned page, the one or more search keywords and selected ones of the high ranking, matched search terms, wherein efficient locating of terms of current interest, identified via the search keywords, and terms of historical interest, via the matched search terms, is provided within the display of the returned page;

when the type of metadata includes metadata for providing pre-selected entries for radio and drop down pre-select, said outputting further comprises;

providing at least one drop down box and a radio button with selections of matched search terms that may be identified within the returned page;

pre-selecting a high ranked, matched search term for display within the drop down box;

displaying the pre-selected matched search term within the drop down box; and

enabling selection, utilizing the drop down box and radio button, of other matched search terms for identifying within the returned page; and

when the type of metadata includes metadata for auto-focusing the returned page, said outputting further comprises;

identifying a location of a match of a highest ranking matched search term within the returned page, wherein a highest ranking matched search term is one of the search keywords;

determining that the match occurred from a most recent entry in a current search and follow pattern thread; and

automatically adjusting a physical rendering of the returned page to substantially place the search term in a location of visible prominence relative to the overall physical space within which the returned page is being outputted, wherein said adjusting further comprises at least one of;

automatically focusing the returned page within the display such that relevant sections of text within which the search keywords and the historical terms are found are prominently placed within the viewable area of the display; and

when a next matched search term is selected within a drop down box, auto-focusing the returned page to prominently exhibit an area in which the next matched search term is located.

16. The computer program product of claim 13, said program code further comprising code for:

parsing a search string to remove insignificant terms contained within the search string with at least on significant search term, said search string utilized to conduct a search for objects that may be located using the at least one significant search term;

storing each significant search term within a datastore of stored search terms;

assigning a thread rank to each stored search term;

time-stamping each stored search term at a time of storage and subsequent update;

updating a time stamp of a stored term when the stored term is identified within a subsequent return page;

monitoring an elapsed time between an initial time of storage or subsequent update of the stored search term and a current time; and

when the elapsed time exceeds a threshold expiration time without said stored search being identified within a returned page, automatically deleting the stored search term from storage.

17. The computer program product of claim 13, said program code further comprising code for:

tracking historical searches associated with the search terms across multiple browser instances, including searches from one or more of (a) other tabs, (b) other browser windows, and (c) alternate browsers during a search sequence associated with the historical search;

ranking search terms associated with each historical search relative to the current search based on a plurality of factors, including;

(1) whether a previous search term is connected to other search terms via a same search thread, whereby search terms connected to the current search via a same search thread are provided a higher ranking than search terms not a part of the same search thread; and

(2) proximity in time to the current search, whereby search terms associated with a more recent historical search are provided a higher ranking than search terms associated with a less recent search.

wherein said ranking further comprises;

determining a rank for each of a plurality of white space delimited character combinations of a returned page that matches with one of the search terms;

comparing the rank of each matched character combination with a pre-established threshold rank value;

initiating at least one of the following functions based on the rank of the matched character combination;

highlighting one or more of the plurality of white space delimited character combinations of the returned page when the particular matched character combination has a matching rank above the threshold rank value;

pre-selecting, from a radio button and a drop down box, one or more of a plurality of options corresponding to the matched character combination when the particular matched character combination has a highest matching rank; and

auto-focusing a returned page to a section containing text corresponding to the matched character combinations with a highest rank.

18. The computer program product of claim 14, further comprising program code for:

determining whether the current search request is a constituent of a search and follow pattern that originated with a previous search, whose search terms are stored;

when the current search request is a constituent of a search and follow pattern that originated with a previous search with search terms;

initiating a first ranking algorithm to rank the search terms in descending order, wherein the first ranking algorithm comprises code for;

(a) assigning a most recent (entire) search phrase a rank of “

1”

;

(b) assigning each white space delimited character combination from the search phrase a rank of “

2”

;

incrementing the rank assignment with each step backwards in the search and follow pattern to a previous search; and

(d) for a set of search terms not reachable by stepping backwards in the search and follow pattern, ranking each remaining search starting at the most recent remaining search, and incrementing the ranking by 1 for all previous searches not already ranked; and

notifying a search history engine of an update to the search and follow pattern to now include the current search request and associated search keywords; and

when the current search request is not a constituent of a search and follow pattern, initiating a second ranking algorithm, which includes;

(a) ranking each search starting at a most recent search, which is assigned a rank of “

1”

, and incrementing a ranking by 1 for all previous searches not already ranked; and

(b) notifying a search history engine of the initiation of a new search and follow branch originated by the current search request.

19. The computer program product of claim 18, further comprising code for:

multiplying a rank of a search term by a preset constant, wherein, when the rank of one or more of the search terms is equal, each equal rank is multiplied by a same preset constant and when the rank of the one or more stored search terms is different, each different rank is multiplied by a different preset constant, wherein the preset constant is selected to favor more recently entered terms above less recent terms;

computing a closeness value between each one of a plurality of white space delimited character combinations within the returned page and each one of a plurality of search terms, which closeness value is computed based on relative rank order of the search terms, such that a closeness value of a highest ranking search term is first computed;

when the computed closeness value lies outside of a preset threshold range for acceptable closeness value, discarding an associated character combination as a match that is not relevant; and

when the computed closeness value lies within a preset threshold range for acceptable closeness value;

adding the closeness value to the multiplied rank associated with a previous search term that was used in the closeness value computation to determine a matching rank for the white space delimited character combination; and

storing the rank of the matched character combination in an ordered data structure.

20. The computer program product of claim 18, further comprising code for determining further comprises code for:

detecting when a branching operation has taken place, wherein said branching operation is detected by one or more of;

(a) opening a link in a new window;

(b) opening a link in a new tab; and

(c) clicking of a link that opens in a new tab or window;

detecting entry of the search request; and

when a branching operation has taken place and entry of the search request is detected, adding the current and a most recent previous search to a search and follow branch/pattern.